/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-DerefFreeMemtrack-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/forester-heap/dll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:24:22,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:24:22,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:24:22,190 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:24:22,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:24:22,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:24:22,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:24:22,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:24:22,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:24:22,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:24:22,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:24:22,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:24:22,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:24:22,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:24:22,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:24:22,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:24:22,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:24:22,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:24:22,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:24:22,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:24:22,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:24:22,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:24:22,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:24:22,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:24:22,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:24:22,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:24:22,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:24:22,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:24:22,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:24:22,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:24:22,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:24:22,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:24:22,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:24:22,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:24:22,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:24:22,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:24:22,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:24:22,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:24:22,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:24:22,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:24:22,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:24:22,313 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2021-01-07 05:24:22,350 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:24:22,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:24:22,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:24:22,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:24:22,352 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:24:22,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:24:22,353 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:24:22,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:24:22,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:24:22,354 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:24:22,354 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:24:22,354 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:24:22,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:24:22,355 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:24:22,355 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:24:22,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:24:22,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:24:22,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:24:22,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:24:22,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:24:22,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:24:22,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:24:22,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:24:22,357 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:24:22,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 05:24:22,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:24:22,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:24:22,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:24:22,850 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:24:22,851 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:24:22,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-2.i [2021-01-07 05:24:22,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1e5f51e3b/408f526976594c9a9f323c6fac9c54ae/FLAG50415fe16 [2021-01-07 05:24:23,669 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:24:23,670 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i [2021-01-07 05:24:23,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1e5f51e3b/408f526976594c9a9f323c6fac9c54ae/FLAG50415fe16 [2021-01-07 05:24:23,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1e5f51e3b/408f526976594c9a9f323c6fac9c54ae [2021-01-07 05:24:23,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:24:23,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:24:23,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:24:23,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:24:23,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:24:23,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:24:23" (1/1) ... [2021-01-07 05:24:23,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e0fcdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:23, skipping insertion in model container [2021-01-07 05:24:23,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:24:23" (1/1) ... [2021-01-07 05:24:23,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:24:23,977 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],StructAccessExpression[IdentifierExpression[~list~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] [2021-01-07 05:24:24,289 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/forester-heap/dll-01-2.i[22080,22093] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem7,],offset]]]] [2021-01-07 05:24:24,298 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/forester-heap/dll-01-2.i[22353,22366] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem13,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem13,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] [2021-01-07 05:24:24,302 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/forester-heap/dll-01-2.i[22587,22600] [2021-01-07 05:24:24,303 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/forester-heap/dll-01-2.i[22657,22670] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem17,],base],StructAccessExpression[IdentifierExpression[#t~mem17,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem18,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem18,],offset]]]] [2021-01-07 05:24:24,307 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/forester-heap/dll-01-2.i[22924,22937] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2021-01-07 05:24:24,309 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/forester-heap/dll-01-2.i[23032,23045] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] [2021-01-07 05:24:24,312 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/forester-heap/dll-01-2.i[23263,23276] [2021-01-07 05:24:24,313 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/forester-heap/dll-01-2.i[23343,23356] [2021-01-07 05:24:24,314 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/forester-heap/dll-01-2.i[23422,23435] left hand side expression in assignment: lhs: VariableLHS[~inner~0,] [2021-01-07 05:24:24,316 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/forester-heap/dll-01-2.i[23512,23525] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2021-01-07 05:24:24,318 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/forester-heap/dll-01-2.i[23690,23703] [2021-01-07 05:24:24,319 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/forester-heap/dll-01-2.i[23768,23781] [2021-01-07 05:24:24,320 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/forester-heap/dll-01-2.i[23845,23858] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] [2021-01-07 05:24:24,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:24:24,349 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],StructAccessExpression[IdentifierExpression[~list~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] [2021-01-07 05:24:24,419 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/forester-heap/dll-01-2.i[22080,22093] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem7,],offset]]]] [2021-01-07 05:24:24,429 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/forester-heap/dll-01-2.i[22353,22366] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem13,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem13,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] [2021-01-07 05:24:24,432 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/forester-heap/dll-01-2.i[22587,22600] [2021-01-07 05:24:24,433 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/forester-heap/dll-01-2.i[22657,22670] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem17,],base],StructAccessExpression[IdentifierExpression[#t~mem17,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem18,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem18,],offset]]]] [2021-01-07 05:24:24,436 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/forester-heap/dll-01-2.i[22924,22937] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2021-01-07 05:24:24,438 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/forester-heap/dll-01-2.i[23032,23045] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] [2021-01-07 05:24:24,440 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/forester-heap/dll-01-2.i[23263,23276] [2021-01-07 05:24:24,441 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/forester-heap/dll-01-2.i[23343,23356] [2021-01-07 05:24:24,442 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/forester-heap/dll-01-2.i[23422,23435] left hand side expression in assignment: lhs: VariableLHS[~inner~0,] [2021-01-07 05:24:24,446 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/forester-heap/dll-01-2.i[23512,23525] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2021-01-07 05:24:24,450 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/forester-heap/dll-01-2.i[23690,23703] [2021-01-07 05:24:24,452 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/forester-heap/dll-01-2.i[23768,23781] [2021-01-07 05:24:24,458 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/forester-heap/dll-01-2.i[23845,23858] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] [2021-01-07 05:24:24,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:24:24,525 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:24:24,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:24 WrapperNode [2021-01-07 05:24:24,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:24:24,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:24:24,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:24:24,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:24:24,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:24" (1/1) ... [2021-01-07 05:24:24,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:24" (1/1) ... [2021-01-07 05:24:24,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:24:24,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:24:24,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:24:24,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:24:24,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:24" (1/1) ... [2021-01-07 05:24:24,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:24" (1/1) ... [2021-01-07 05:24:24,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:24" (1/1) ... [2021-01-07 05:24:24,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:24" (1/1) ... [2021-01-07 05:24:24,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:24" (1/1) ... [2021-01-07 05:24:24,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:24" (1/1) ... [2021-01-07 05:24:24,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:24" (1/1) ... [2021-01-07 05:24:24,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:24:24,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:24:24,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:24:24,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:24:24,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:24" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:24:24,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 05:24:24,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 05:24:24,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:24:24,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 05:24:24,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:24:24,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 05:24:24,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:24:24,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:24:25,982 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:24:25,983 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-01-07 05:24:25,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:24:25 BoogieIcfgContainer [2021-01-07 05:24:25,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:24:25,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:24:25,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:24:25,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:24:25,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:24:23" (1/3) ... [2021-01-07 05:24:25,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14dfa6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:24:25, skipping insertion in model container [2021-01-07 05:24:25,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:24" (2/3) ... [2021-01-07 05:24:25,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14dfa6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:24:25, skipping insertion in model container [2021-01-07 05:24:25,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:24:25" (3/3) ... [2021-01-07 05:24:25,996 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2021-01-07 05:24:26,003 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:24:26,011 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 86 error locations. [2021-01-07 05:24:26,033 INFO L253 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2021-01-07 05:24:26,061 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:24:26,061 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:24:26,062 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:24:26,062 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:24:26,062 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:24:26,062 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:24:26,062 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:24:26,063 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:24:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states. [2021-01-07 05:24:26,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-01-07 05:24:26,098 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:26,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-01-07 05:24:26,099 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:26,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:26,107 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-01-07 05:24:26,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:26,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871591146] [2021-01-07 05:24:26,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:26,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871591146] [2021-01-07 05:24:26,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:26,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:24:26,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719044801] [2021-01-07 05:24:26,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:24:26,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:26,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:24:26,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:26,382 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 3 states. [2021-01-07 05:24:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:26,801 INFO L93 Difference]: Finished difference Result 198 states and 207 transitions. [2021-01-07 05:24:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:24:26,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-01-07 05:24:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:26,818 INFO L225 Difference]: With dead ends: 198 [2021-01-07 05:24:26,818 INFO L226 Difference]: Without dead ends: 194 [2021-01-07 05:24:26,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-01-07 05:24:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2021-01-07 05:24:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2021-01-07 05:24:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 201 transitions. [2021-01-07 05:24:26,878 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 201 transitions. Word has length 3 [2021-01-07 05:24:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:26,879 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 201 transitions. [2021-01-07 05:24:26,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:24:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 201 transitions. [2021-01-07 05:24:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-01-07 05:24:26,880 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:26,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-01-07 05:24:26,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:24:26,882 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:26,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:26,883 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-01-07 05:24:26,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:26,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126478305] [2021-01-07 05:24:26,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:26,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126478305] [2021-01-07 05:24:26,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:26,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:24:26,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385966359] [2021-01-07 05:24:26,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:24:26,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:26,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:24:27,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:27,001 INFO L87 Difference]: Start difference. First operand 190 states and 201 transitions. Second operand 3 states. [2021-01-07 05:24:27,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:27,274 INFO L93 Difference]: Finished difference Result 219 states and 229 transitions. [2021-01-07 05:24:27,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:24:27,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-01-07 05:24:27,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:27,278 INFO L225 Difference]: With dead ends: 219 [2021-01-07 05:24:27,279 INFO L226 Difference]: Without dead ends: 219 [2021-01-07 05:24:27,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-01-07 05:24:27,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2021-01-07 05:24:27,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2021-01-07 05:24:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 221 transitions. [2021-01-07 05:24:27,301 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 221 transitions. Word has length 3 [2021-01-07 05:24:27,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:27,301 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 221 transitions. [2021-01-07 05:24:27,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:24:27,302 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 221 transitions. [2021-01-07 05:24:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-01-07 05:24:27,302 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:27,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-01-07 05:24:27,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:24:27,303 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:27,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:27,304 INFO L82 PathProgramCache]: Analyzing trace with hash 889446311, now seen corresponding path program 1 times [2021-01-07 05:24:27,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:27,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960466444] [2021-01-07 05:24:27,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:27,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960466444] [2021-01-07 05:24:27,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:27,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:24:27,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132538286] [2021-01-07 05:24:27,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:24:27,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:27,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:24:27,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:27,355 INFO L87 Difference]: Start difference. First operand 199 states and 221 transitions. Second operand 3 states. [2021-01-07 05:24:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:27,409 INFO L93 Difference]: Finished difference Result 214 states and 224 transitions. [2021-01-07 05:24:27,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:24:27,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2021-01-07 05:24:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:27,412 INFO L225 Difference]: With dead ends: 214 [2021-01-07 05:24:27,412 INFO L226 Difference]: Without dead ends: 214 [2021-01-07 05:24:27,413 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:27,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-01-07 05:24:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2021-01-07 05:24:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2021-01-07 05:24:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2021-01-07 05:24:27,426 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 6 [2021-01-07 05:24:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:27,427 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2021-01-07 05:24:27,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:24:27,427 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2021-01-07 05:24:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 05:24:27,428 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:27,428 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:27,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:24:27,429 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:27,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:27,430 INFO L82 PathProgramCache]: Analyzing trace with hash -73360970, now seen corresponding path program 1 times [2021-01-07 05:24:27,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:27,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275548498] [2021-01-07 05:24:27,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:27,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275548498] [2021-01-07 05:24:27,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:27,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:24:27,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793950702] [2021-01-07 05:24:27,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:24:27,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:27,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:24:27,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:27,506 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 5 states. [2021-01-07 05:24:27,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:27,930 INFO L93 Difference]: Finished difference Result 344 states and 373 transitions. [2021-01-07 05:24:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:24:27,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-01-07 05:24:27,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:27,933 INFO L225 Difference]: With dead ends: 344 [2021-01-07 05:24:27,934 INFO L226 Difference]: Without dead ends: 344 [2021-01-07 05:24:27,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:24:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-01-07 05:24:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 196. [2021-01-07 05:24:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2021-01-07 05:24:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 217 transitions. [2021-01-07 05:24:27,968 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 217 transitions. Word has length 11 [2021-01-07 05:24:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:27,968 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 217 transitions. [2021-01-07 05:24:27,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:24:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 217 transitions. [2021-01-07 05:24:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 05:24:27,971 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:27,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:27,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:24:27,972 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:27,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:27,974 INFO L82 PathProgramCache]: Analyzing trace with hash -73360969, now seen corresponding path program 1 times [2021-01-07 05:24:27,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:27,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623746120] [2021-01-07 05:24:27,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:28,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623746120] [2021-01-07 05:24:28,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:28,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:24:28,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396119105] [2021-01-07 05:24:28,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:24:28,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:28,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:24:28,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:28,099 INFO L87 Difference]: Start difference. First operand 196 states and 217 transitions. Second operand 5 states. [2021-01-07 05:24:28,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:28,537 INFO L93 Difference]: Finished difference Result 372 states and 413 transitions. [2021-01-07 05:24:28,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:24:28,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-01-07 05:24:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:28,540 INFO L225 Difference]: With dead ends: 372 [2021-01-07 05:24:28,540 INFO L226 Difference]: Without dead ends: 372 [2021-01-07 05:24:28,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:24:28,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-01-07 05:24:28,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 195. [2021-01-07 05:24:28,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2021-01-07 05:24:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 216 transitions. [2021-01-07 05:24:28,549 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 216 transitions. Word has length 11 [2021-01-07 05:24:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:28,550 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 216 transitions. [2021-01-07 05:24:28,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:24:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2021-01-07 05:24:28,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-07 05:24:28,551 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:28,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:28,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:24:28,551 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:28,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:28,552 INFO L82 PathProgramCache]: Analyzing trace with hash 641711324, now seen corresponding path program 1 times [2021-01-07 05:24:28,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:28,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735400182] [2021-01-07 05:24:28,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:28,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735400182] [2021-01-07 05:24:28,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:28,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:24:28,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170767600] [2021-01-07 05:24:28,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:24:28,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:28,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:24:28,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:24:28,793 INFO L87 Difference]: Start difference. First operand 195 states and 216 transitions. Second operand 8 states. [2021-01-07 05:24:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:29,556 INFO L93 Difference]: Finished difference Result 342 states and 371 transitions. [2021-01-07 05:24:29,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:24:29,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2021-01-07 05:24:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:29,564 INFO L225 Difference]: With dead ends: 342 [2021-01-07 05:24:29,565 INFO L226 Difference]: Without dead ends: 342 [2021-01-07 05:24:29,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:24:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-01-07 05:24:29,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 194. [2021-01-07 05:24:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2021-01-07 05:24:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2021-01-07 05:24:29,572 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 14 [2021-01-07 05:24:29,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:29,572 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2021-01-07 05:24:29,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:24:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2021-01-07 05:24:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-07 05:24:29,573 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:29,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:29,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:24:29,574 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:29,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash 641711325, now seen corresponding path program 1 times [2021-01-07 05:24:29,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:29,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286130185] [2021-01-07 05:24:29,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:29,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286130185] [2021-01-07 05:24:29,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:29,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:24:29,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853101199] [2021-01-07 05:24:29,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:24:29,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:29,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:24:29,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:24:29,706 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand 8 states. [2021-01-07 05:24:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:30,885 INFO L93 Difference]: Finished difference Result 343 states and 372 transitions. [2021-01-07 05:24:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:24:30,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2021-01-07 05:24:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:30,888 INFO L225 Difference]: With dead ends: 343 [2021-01-07 05:24:30,888 INFO L226 Difference]: Without dead ends: 343 [2021-01-07 05:24:30,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:24:30,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-01-07 05:24:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 193. [2021-01-07 05:24:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2021-01-07 05:24:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 214 transitions. [2021-01-07 05:24:30,895 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 214 transitions. Word has length 14 [2021-01-07 05:24:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:30,895 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 214 transitions. [2021-01-07 05:24:30,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:24:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 214 transitions. [2021-01-07 05:24:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-07 05:24:30,896 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:30,896 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:30,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:24:30,897 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash 372237930, now seen corresponding path program 1 times [2021-01-07 05:24:30,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:30,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285633681] [2021-01-07 05:24:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:30,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285633681] [2021-01-07 05:24:30,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:30,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:24:30,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501753111] [2021-01-07 05:24:30,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:24:30,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:30,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:24:30,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:30,941 INFO L87 Difference]: Start difference. First operand 193 states and 214 transitions. Second operand 3 states. [2021-01-07 05:24:30,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:30,952 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2021-01-07 05:24:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:24:30,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2021-01-07 05:24:30,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:30,955 INFO L225 Difference]: With dead ends: 194 [2021-01-07 05:24:30,955 INFO L226 Difference]: Without dead ends: 194 [2021-01-07 05:24:30,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-01-07 05:24:30,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-01-07 05:24:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2021-01-07 05:24:30,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2021-01-07 05:24:30,960 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 14 [2021-01-07 05:24:30,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:30,961 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2021-01-07 05:24:30,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:24:30,961 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2021-01-07 05:24:30,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:24:30,962 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:30,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:30,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:24:30,962 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:30,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:30,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1240001167, now seen corresponding path program 1 times [2021-01-07 05:24:30,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:30,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335355799] [2021-01-07 05:24:30,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:31,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335355799] [2021-01-07 05:24:31,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:31,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:24:31,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924994979] [2021-01-07 05:24:31,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:24:31,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:31,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:24:31,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:24:31,047 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand 7 states. [2021-01-07 05:24:31,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:31,368 INFO L93 Difference]: Finished difference Result 286 states and 313 transitions. [2021-01-07 05:24:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:24:31,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2021-01-07 05:24:31,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:31,371 INFO L225 Difference]: With dead ends: 286 [2021-01-07 05:24:31,371 INFO L226 Difference]: Without dead ends: 286 [2021-01-07 05:24:31,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:24:31,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-01-07 05:24:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 191. [2021-01-07 05:24:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2021-01-07 05:24:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 212 transitions. [2021-01-07 05:24:31,378 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 212 transitions. Word has length 16 [2021-01-07 05:24:31,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:31,378 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 212 transitions. [2021-01-07 05:24:31,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:24:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 212 transitions. [2021-01-07 05:24:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:24:31,380 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:31,380 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:31,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 05:24:31,380 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:31,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:31,381 INFO L82 PathProgramCache]: Analyzing trace with hash 486582708, now seen corresponding path program 1 times [2021-01-07 05:24:31,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:31,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683460071] [2021-01-07 05:24:31,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:31,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683460071] [2021-01-07 05:24:31,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:31,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:24:31,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162208414] [2021-01-07 05:24:31,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:24:31,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:31,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:24:31,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:31,438 INFO L87 Difference]: Start difference. First operand 191 states and 212 transitions. Second operand 5 states. [2021-01-07 05:24:31,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:31,618 INFO L93 Difference]: Finished difference Result 287 states and 313 transitions. [2021-01-07 05:24:31,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:24:31,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2021-01-07 05:24:31,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:31,620 INFO L225 Difference]: With dead ends: 287 [2021-01-07 05:24:31,620 INFO L226 Difference]: Without dead ends: 287 [2021-01-07 05:24:31,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:24:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-01-07 05:24:31,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 194. [2021-01-07 05:24:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2021-01-07 05:24:31,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2021-01-07 05:24:31,627 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 18 [2021-01-07 05:24:31,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:31,627 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2021-01-07 05:24:31,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:24:31,628 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2021-01-07 05:24:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:24:31,628 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:31,629 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] [2021-01-07 05:24:31,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 05:24:31,629 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:31,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:31,630 INFO L82 PathProgramCache]: Analyzing trace with hash 111219545, now seen corresponding path program 1 times [2021-01-07 05:24:31,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:31,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625846345] [2021-01-07 05:24:31,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:31,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625846345] [2021-01-07 05:24:31,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:31,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:24:31,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237765257] [2021-01-07 05:24:31,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:24:31,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:31,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:24:31,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:24:31,685 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand 4 states. [2021-01-07 05:24:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:31,899 INFO L93 Difference]: Finished difference Result 188 states and 208 transitions. [2021-01-07 05:24:31,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:24:31,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2021-01-07 05:24:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:31,901 INFO L225 Difference]: With dead ends: 188 [2021-01-07 05:24:31,901 INFO L226 Difference]: Without dead ends: 188 [2021-01-07 05:24:31,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:31,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-07 05:24:31,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2021-01-07 05:24:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2021-01-07 05:24:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 205 transitions. [2021-01-07 05:24:31,908 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 205 transitions. Word has length 20 [2021-01-07 05:24:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:31,908 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 205 transitions. [2021-01-07 05:24:31,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:24:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 205 transitions. [2021-01-07 05:24:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:24:31,909 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:31,909 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] [2021-01-07 05:24:31,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:24:31,910 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:31,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:31,911 INFO L82 PathProgramCache]: Analyzing trace with hash 111219546, now seen corresponding path program 1 times [2021-01-07 05:24:31,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:31,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423712756] [2021-01-07 05:24:31,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:31,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423712756] [2021-01-07 05:24:31,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:31,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:24:31,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462511049] [2021-01-07 05:24:31,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:24:31,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:31,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:24:31,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:24:31,969 INFO L87 Difference]: Start difference. First operand 184 states and 205 transitions. Second operand 4 states. [2021-01-07 05:24:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:32,242 INFO L93 Difference]: Finished difference Result 244 states and 258 transitions. [2021-01-07 05:24:32,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:24:32,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2021-01-07 05:24:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:32,244 INFO L225 Difference]: With dead ends: 244 [2021-01-07 05:24:32,245 INFO L226 Difference]: Without dead ends: 244 [2021-01-07 05:24:32,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:32,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-01-07 05:24:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 207. [2021-01-07 05:24:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2021-01-07 05:24:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 242 transitions. [2021-01-07 05:24:32,252 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 242 transitions. Word has length 20 [2021-01-07 05:24:32,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:32,252 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 242 transitions. [2021-01-07 05:24:32,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:24:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 242 transitions. [2021-01-07 05:24:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:24:32,253 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:32,253 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] [2021-01-07 05:24:32,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:24:32,254 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:32,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:32,255 INFO L82 PathProgramCache]: Analyzing trace with hash -492144724, now seen corresponding path program 1 times [2021-01-07 05:24:32,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:32,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509132038] [2021-01-07 05:24:32,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:32,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509132038] [2021-01-07 05:24:32,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:32,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:24:32,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090505380] [2021-01-07 05:24:32,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:24:32,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:32,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:24:32,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:24:32,291 INFO L87 Difference]: Start difference. First operand 207 states and 242 transitions. Second operand 4 states. [2021-01-07 05:24:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:32,434 INFO L93 Difference]: Finished difference Result 239 states and 252 transitions. [2021-01-07 05:24:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:24:32,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2021-01-07 05:24:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:32,436 INFO L225 Difference]: With dead ends: 239 [2021-01-07 05:24:32,437 INFO L226 Difference]: Without dead ends: 239 [2021-01-07 05:24:32,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-01-07 05:24:32,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 205. [2021-01-07 05:24:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2021-01-07 05:24:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 239 transitions. [2021-01-07 05:24:32,443 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 239 transitions. Word has length 22 [2021-01-07 05:24:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:32,443 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 239 transitions. [2021-01-07 05:24:32,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:24:32,443 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 239 transitions. [2021-01-07 05:24:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:24:32,444 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:32,444 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] [2021-01-07 05:24:32,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 05:24:32,445 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:32,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:32,445 INFO L82 PathProgramCache]: Analyzing trace with hash -492197444, now seen corresponding path program 1 times [2021-01-07 05:24:32,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:32,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870432162] [2021-01-07 05:24:32,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:32,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870432162] [2021-01-07 05:24:32,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:32,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:24:32,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047860147] [2021-01-07 05:24:32,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:24:32,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:32,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:24:32,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:32,486 INFO L87 Difference]: Start difference. First operand 205 states and 239 transitions. Second operand 5 states. [2021-01-07 05:24:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:32,841 INFO L93 Difference]: Finished difference Result 293 states and 342 transitions. [2021-01-07 05:24:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:24:32,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2021-01-07 05:24:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:32,844 INFO L225 Difference]: With dead ends: 293 [2021-01-07 05:24:32,844 INFO L226 Difference]: Without dead ends: 293 [2021-01-07 05:24:32,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:24:32,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-01-07 05:24:32,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 204. [2021-01-07 05:24:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2021-01-07 05:24:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 237 transitions. [2021-01-07 05:24:32,852 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 237 transitions. Word has length 22 [2021-01-07 05:24:32,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:32,853 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 237 transitions. [2021-01-07 05:24:32,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:24:32,853 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 237 transitions. [2021-01-07 05:24:32,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:24:32,854 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:32,854 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] [2021-01-07 05:24:32,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 05:24:32,855 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:32,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:32,855 INFO L82 PathProgramCache]: Analyzing trace with hash -492197443, now seen corresponding path program 1 times [2021-01-07 05:24:32,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:32,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614414767] [2021-01-07 05:24:32,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:32,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614414767] [2021-01-07 05:24:32,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:32,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:24:32,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097695808] [2021-01-07 05:24:32,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:24:32,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:32,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:24:32,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:32,918 INFO L87 Difference]: Start difference. First operand 204 states and 237 transitions. Second operand 5 states. [2021-01-07 05:24:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:33,272 INFO L93 Difference]: Finished difference Result 321 states and 379 transitions. [2021-01-07 05:24:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:24:33,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2021-01-07 05:24:33,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:33,275 INFO L225 Difference]: With dead ends: 321 [2021-01-07 05:24:33,275 INFO L226 Difference]: Without dead ends: 321 [2021-01-07 05:24:33,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:24:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-01-07 05:24:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 203. [2021-01-07 05:24:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2021-01-07 05:24:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 235 transitions. [2021-01-07 05:24:33,282 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 235 transitions. Word has length 22 [2021-01-07 05:24:33,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:33,282 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 235 transitions. [2021-01-07 05:24:33,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:24:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 235 transitions. [2021-01-07 05:24:33,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 05:24:33,283 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:33,283 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] [2021-01-07 05:24:33,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 05:24:33,284 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:33,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:33,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1104565569, now seen corresponding path program 1 times [2021-01-07 05:24:33,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:33,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978211186] [2021-01-07 05:24:33,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:33,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978211186] [2021-01-07 05:24:33,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:33,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:24:33,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556464918] [2021-01-07 05:24:33,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:24:33,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:33,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:24:33,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:24:33,458 INFO L87 Difference]: Start difference. First operand 203 states and 235 transitions. Second operand 10 states. [2021-01-07 05:24:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:34,225 INFO L93 Difference]: Finished difference Result 195 states and 227 transitions. [2021-01-07 05:24:34,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 05:24:34,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2021-01-07 05:24:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:34,227 INFO L225 Difference]: With dead ends: 195 [2021-01-07 05:24:34,227 INFO L226 Difference]: Without dead ends: 195 [2021-01-07 05:24:34,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:24:34,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-01-07 05:24:34,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2021-01-07 05:24:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2021-01-07 05:24:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 217 transitions. [2021-01-07 05:24:34,233 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 217 transitions. Word has length 26 [2021-01-07 05:24:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:34,233 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 217 transitions. [2021-01-07 05:24:34,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:24:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 217 transitions. [2021-01-07 05:24:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 05:24:34,234 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:34,234 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] [2021-01-07 05:24:34,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:24:34,235 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:34,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1104565570, now seen corresponding path program 1 times [2021-01-07 05:24:34,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:34,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435454696] [2021-01-07 05:24:34,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:34,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435454696] [2021-01-07 05:24:34,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:34,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:24:34,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463188432] [2021-01-07 05:24:34,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:24:34,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:34,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:24:34,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:24:34,331 INFO L87 Difference]: Start difference. First operand 186 states and 217 transitions. Second operand 9 states. [2021-01-07 05:24:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:34,886 INFO L93 Difference]: Finished difference Result 185 states and 216 transitions. [2021-01-07 05:24:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:24:34,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2021-01-07 05:24:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:34,889 INFO L225 Difference]: With dead ends: 185 [2021-01-07 05:24:34,889 INFO L226 Difference]: Without dead ends: 185 [2021-01-07 05:24:34,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:24:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-07 05:24:34,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-01-07 05:24:34,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2021-01-07 05:24:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 216 transitions. [2021-01-07 05:24:34,894 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 216 transitions. Word has length 26 [2021-01-07 05:24:34,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:34,895 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 216 transitions. [2021-01-07 05:24:34,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:24:34,895 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 216 transitions. [2021-01-07 05:24:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 05:24:34,895 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:34,896 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] [2021-01-07 05:24:34,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 05:24:34,896 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:34,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:34,897 INFO L82 PathProgramCache]: Analyzing trace with hash -72989096, now seen corresponding path program 1 times [2021-01-07 05:24:34,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:34,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062472920] [2021-01-07 05:24:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:34,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062472920] [2021-01-07 05:24:34,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:34,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:24:34,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266640220] [2021-01-07 05:24:34,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:24:34,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:34,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:24:34,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:34,924 INFO L87 Difference]: Start difference. First operand 185 states and 216 transitions. Second operand 3 states. [2021-01-07 05:24:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:34,936 INFO L93 Difference]: Finished difference Result 259 states and 304 transitions. [2021-01-07 05:24:34,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:24:34,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2021-01-07 05:24:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:34,938 INFO L225 Difference]: With dead ends: 259 [2021-01-07 05:24:34,938 INFO L226 Difference]: Without dead ends: 259 [2021-01-07 05:24:34,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:34,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-01-07 05:24:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 191. [2021-01-07 05:24:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2021-01-07 05:24:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 224 transitions. [2021-01-07 05:24:34,944 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 224 transitions. Word has length 28 [2021-01-07 05:24:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:34,944 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 224 transitions. [2021-01-07 05:24:34,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:24:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 224 transitions. [2021-01-07 05:24:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 05:24:34,945 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:34,945 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] [2021-01-07 05:24:34,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 05:24:34,946 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:34,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:34,946 INFO L82 PathProgramCache]: Analyzing trace with hash -630587842, now seen corresponding path program 1 times [2021-01-07 05:24:34,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:34,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377626741] [2021-01-07 05:24:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:35,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377626741] [2021-01-07 05:24:35,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:35,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 05:24:35,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005095978] [2021-01-07 05:24:35,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:24:35,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:35,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:24:35,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:24:35,052 INFO L87 Difference]: Start difference. First operand 191 states and 224 transitions. Second operand 10 states. [2021-01-07 05:24:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:35,823 INFO L93 Difference]: Finished difference Result 196 states and 230 transitions. [2021-01-07 05:24:35,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 05:24:35,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2021-01-07 05:24:35,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:35,825 INFO L225 Difference]: With dead ends: 196 [2021-01-07 05:24:35,825 INFO L226 Difference]: Without dead ends: 196 [2021-01-07 05:24:35,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:24:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-01-07 05:24:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2021-01-07 05:24:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2021-01-07 05:24:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 220 transitions. [2021-01-07 05:24:35,830 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 220 transitions. Word has length 28 [2021-01-07 05:24:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:35,830 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 220 transitions. [2021-01-07 05:24:35,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:24:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2021-01-07 05:24:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:24:35,831 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:35,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:35,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 05:24:35,832 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:35,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:35,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2032293955, now seen corresponding path program 1 times [2021-01-07 05:24:35,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:35,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758275773] [2021-01-07 05:24:35,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:35,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758275773] [2021-01-07 05:24:35,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:35,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:24:35,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516724353] [2021-01-07 05:24:35,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:24:35,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:35,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:24:35,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:35,864 INFO L87 Difference]: Start difference. First operand 187 states and 220 transitions. Second operand 3 states. [2021-01-07 05:24:35,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:35,887 INFO L93 Difference]: Finished difference Result 185 states and 217 transitions. [2021-01-07 05:24:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:24:35,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2021-01-07 05:24:35,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:35,889 INFO L225 Difference]: With dead ends: 185 [2021-01-07 05:24:35,889 INFO L226 Difference]: Without dead ends: 185 [2021-01-07 05:24:35,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-07 05:24:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-01-07 05:24:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2021-01-07 05:24:35,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 217 transitions. [2021-01-07 05:24:35,894 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 217 transitions. Word has length 29 [2021-01-07 05:24:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:35,894 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 217 transitions. [2021-01-07 05:24:35,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:24:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 217 transitions. [2021-01-07 05:24:35,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-07 05:24:35,895 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:35,895 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] [2021-01-07 05:24:35,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 05:24:35,896 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:35,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:35,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1423392499, now seen corresponding path program 1 times [2021-01-07 05:24:35,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:35,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650643593] [2021-01-07 05:24:35,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:36,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650643593] [2021-01-07 05:24:36,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:36,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:24:36,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231813749] [2021-01-07 05:24:36,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:24:36,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:36,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:24:36,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:24:36,018 INFO L87 Difference]: Start difference. First operand 185 states and 217 transitions. Second operand 9 states. [2021-01-07 05:24:36,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:36,549 INFO L93 Difference]: Finished difference Result 287 states and 316 transitions. [2021-01-07 05:24:36,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 05:24:36,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2021-01-07 05:24:36,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:36,552 INFO L225 Difference]: With dead ends: 287 [2021-01-07 05:24:36,552 INFO L226 Difference]: Without dead ends: 287 [2021-01-07 05:24:36,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:24:36,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-01-07 05:24:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 197. [2021-01-07 05:24:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2021-01-07 05:24:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 230 transitions. [2021-01-07 05:24:36,558 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 230 transitions. Word has length 30 [2021-01-07 05:24:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:36,558 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 230 transitions. [2021-01-07 05:24:36,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:24:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 230 transitions. [2021-01-07 05:24:36,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-07 05:24:36,560 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:36,561 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:36,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 05:24:36,561 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:36,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1614859264, now seen corresponding path program 1 times [2021-01-07 05:24:36,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:36,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822621212] [2021-01-07 05:24:36,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:36,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822621212] [2021-01-07 05:24:36,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032905612] [2021-01-07 05:24:36,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:24:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:36,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-07 05:24:36,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:24:36,997 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:24:37,000 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,014 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:37,022 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:24:37,023 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,037 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:37,039 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,039 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2021-01-07 05:24:37,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:37,081 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-01-07 05:24:37,083 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,099 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:37,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:37,104 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-01-07 05:24:37,106 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,118 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:37,119 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,120 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2021-01-07 05:24:37,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:37,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:37,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:37,201 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-01-07 05:24:37,207 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,229 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:37,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:37,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:37,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:37,240 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-01-07 05:24:37,243 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,260 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:37,261 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,262 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2021-01-07 05:24:37,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:37,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:37,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:24:37,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:37,550 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2021-01-07 05:24:37,556 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,591 INFO L625 ElimStorePlain]: treesize reduction 3, result has 93.8 percent of original size [2021-01-07 05:24:37,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:37,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:37,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:24:37,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:37,602 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:37,603 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 16 [2021-01-07 05:24:37,607 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,617 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:37,620 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,620 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:77, output treesize:7 [2021-01-07 05:24:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:37,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:24:37,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2021-01-07 05:24:37,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642274015] [2021-01-07 05:24:37,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 05:24:37,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:37,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 05:24:37,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:24:37,651 INFO L87 Difference]: Start difference. First operand 197 states and 230 transitions. Second operand 11 states. [2021-01-07 05:24:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:38,576 INFO L93 Difference]: Finished difference Result 345 states and 376 transitions. [2021-01-07 05:24:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-07 05:24:38,577 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2021-01-07 05:24:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:38,579 INFO L225 Difference]: With dead ends: 345 [2021-01-07 05:24:38,579 INFO L226 Difference]: Without dead ends: 345 [2021-01-07 05:24:38,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:24:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-01-07 05:24:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 225. [2021-01-07 05:24:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2021-01-07 05:24:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 271 transitions. [2021-01-07 05:24:38,591 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 271 transitions. Word has length 32 [2021-01-07 05:24:38,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:38,591 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 271 transitions. [2021-01-07 05:24:38,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 05:24:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 271 transitions. [2021-01-07 05:24:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:24:38,592 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:38,592 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] [2021-01-07 05:24:38,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-01-07 05:24:38,795 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:38,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:38,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1275838399, now seen corresponding path program 1 times [2021-01-07 05:24:38,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:38,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238155115] [2021-01-07 05:24:38,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:38,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238155115] [2021-01-07 05:24:38,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:38,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 05:24:38,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640928660] [2021-01-07 05:24:38,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 05:24:38,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:38,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 05:24:38,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:24:38,934 INFO L87 Difference]: Start difference. First operand 225 states and 271 transitions. Second operand 11 states. [2021-01-07 05:24:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:39,964 INFO L93 Difference]: Finished difference Result 457 states and 513 transitions. [2021-01-07 05:24:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 05:24:39,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2021-01-07 05:24:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:39,970 INFO L225 Difference]: With dead ends: 457 [2021-01-07 05:24:39,970 INFO L226 Difference]: Without dead ends: 457 [2021-01-07 05:24:39,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2021-01-07 05:24:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-01-07 05:24:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 226. [2021-01-07 05:24:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2021-01-07 05:24:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 269 transitions. [2021-01-07 05:24:39,983 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 269 transitions. Word has length 34 [2021-01-07 05:24:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:39,983 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 269 transitions. [2021-01-07 05:24:39,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 05:24:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 269 transitions. [2021-01-07 05:24:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:24:39,984 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:39,984 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] [2021-01-07 05:24:39,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-07 05:24:39,985 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:39,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:39,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1275838398, now seen corresponding path program 1 times [2021-01-07 05:24:39,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:39,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500163038] [2021-01-07 05:24:39,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:40,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500163038] [2021-01-07 05:24:40,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:40,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-07 05:24:40,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820252657] [2021-01-07 05:24:40,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 05:24:40,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:40,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 05:24:40,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:24:40,277 INFO L87 Difference]: Start difference. First operand 226 states and 269 transitions. Second operand 14 states. [2021-01-07 05:24:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:42,402 INFO L93 Difference]: Finished difference Result 510 states and 561 transitions. [2021-01-07 05:24:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-07 05:24:42,402 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2021-01-07 05:24:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:42,405 INFO L225 Difference]: With dead ends: 510 [2021-01-07 05:24:42,405 INFO L226 Difference]: Without dead ends: 510 [2021-01-07 05:24:42,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=299, Invalid=1107, Unknown=0, NotChecked=0, Total=1406 [2021-01-07 05:24:42,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-01-07 05:24:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 232. [2021-01-07 05:24:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2021-01-07 05:24:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 276 transitions. [2021-01-07 05:24:42,414 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 276 transitions. Word has length 34 [2021-01-07 05:24:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:42,414 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 276 transitions. [2021-01-07 05:24:42,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-07 05:24:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 276 transitions. [2021-01-07 05:24:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:24:42,415 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:42,415 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] [2021-01-07 05:24:42,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-07 05:24:42,416 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:42,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:42,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1103813356, now seen corresponding path program 1 times [2021-01-07 05:24:42,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:42,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899081584] [2021-01-07 05:24:42,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:42,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899081584] [2021-01-07 05:24:42,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:42,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:24:42,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989404095] [2021-01-07 05:24:42,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:24:42,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:42,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:24:42,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:42,461 INFO L87 Difference]: Start difference. First operand 232 states and 276 transitions. Second operand 5 states. [2021-01-07 05:24:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:42,757 INFO L93 Difference]: Finished difference Result 347 states and 409 transitions. [2021-01-07 05:24:42,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:24:42,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2021-01-07 05:24:42,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:42,760 INFO L225 Difference]: With dead ends: 347 [2021-01-07 05:24:42,760 INFO L226 Difference]: Without dead ends: 347 [2021-01-07 05:24:42,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:24:42,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-01-07 05:24:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 231. [2021-01-07 05:24:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2021-01-07 05:24:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 275 transitions. [2021-01-07 05:24:42,767 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 275 transitions. Word has length 35 [2021-01-07 05:24:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:42,768 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 275 transitions. [2021-01-07 05:24:42,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:24:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 275 transitions. [2021-01-07 05:24:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:24:42,768 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:42,769 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] [2021-01-07 05:24:42,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-07 05:24:42,769 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:42,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:42,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1103813355, now seen corresponding path program 1 times [2021-01-07 05:24:42,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:42,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413646435] [2021-01-07 05:24:42,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:42,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413646435] [2021-01-07 05:24:42,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:42,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:24:42,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164853626] [2021-01-07 05:24:42,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:24:42,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:42,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:24:42,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:42,828 INFO L87 Difference]: Start difference. First operand 231 states and 275 transitions. Second operand 5 states. [2021-01-07 05:24:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:43,198 INFO L93 Difference]: Finished difference Result 375 states and 447 transitions. [2021-01-07 05:24:43,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:24:43,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2021-01-07 05:24:43,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:43,201 INFO L225 Difference]: With dead ends: 375 [2021-01-07 05:24:43,201 INFO L226 Difference]: Without dead ends: 375 [2021-01-07 05:24:43,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:24:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-01-07 05:24:43,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 230. [2021-01-07 05:24:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-07 05:24:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 274 transitions. [2021-01-07 05:24:43,212 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 274 transitions. Word has length 35 [2021-01-07 05:24:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:43,212 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 274 transitions. [2021-01-07 05:24:43,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:24:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 274 transitions. [2021-01-07 05:24:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:24:43,213 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:43,213 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] [2021-01-07 05:24:43,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-07 05:24:43,213 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:43,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:43,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2015014111, now seen corresponding path program 1 times [2021-01-07 05:24:43,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:43,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259708528] [2021-01-07 05:24:43,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:43,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259708528] [2021-01-07 05:24:43,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:43,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-01-07 05:24:43,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435904343] [2021-01-07 05:24:43,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-07 05:24:43,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:43,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-07 05:24:43,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-01-07 05:24:43,643 INFO L87 Difference]: Start difference. First operand 230 states and 274 transitions. Second operand 15 states. [2021-01-07 05:24:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:46,170 INFO L93 Difference]: Finished difference Result 512 states and 563 transitions. [2021-01-07 05:24:46,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-01-07 05:24:46,171 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2021-01-07 05:24:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:46,174 INFO L225 Difference]: With dead ends: 512 [2021-01-07 05:24:46,175 INFO L226 Difference]: Without dead ends: 512 [2021-01-07 05:24:46,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=357, Invalid=1365, Unknown=0, NotChecked=0, Total=1722 [2021-01-07 05:24:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-01-07 05:24:46,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 230. [2021-01-07 05:24:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-07 05:24:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 273 transitions. [2021-01-07 05:24:46,183 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 273 transitions. Word has length 36 [2021-01-07 05:24:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:46,183 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 273 transitions. [2021-01-07 05:24:46,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-07 05:24:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 273 transitions. [2021-01-07 05:24:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-07 05:24:46,184 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:46,184 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] [2021-01-07 05:24:46,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-07 05:24:46,184 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:46,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2036268432, now seen corresponding path program 1 times [2021-01-07 05:24:46,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:46,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934687514] [2021-01-07 05:24:46,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:24:46,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934687514] [2021-01-07 05:24:46,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:46,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:24:46,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414280672] [2021-01-07 05:24:46,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:24:46,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:46,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:24:46,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:24:46,267 INFO L87 Difference]: Start difference. First operand 230 states and 273 transitions. Second operand 7 states. [2021-01-07 05:24:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:46,553 INFO L93 Difference]: Finished difference Result 253 states and 296 transitions. [2021-01-07 05:24:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:24:46,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2021-01-07 05:24:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:46,555 INFO L225 Difference]: With dead ends: 253 [2021-01-07 05:24:46,555 INFO L226 Difference]: Without dead ends: 253 [2021-01-07 05:24:46,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:24:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-01-07 05:24:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 239. [2021-01-07 05:24:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-07 05:24:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 282 transitions. [2021-01-07 05:24:46,562 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 282 transitions. Word has length 37 [2021-01-07 05:24:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:46,563 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 282 transitions. [2021-01-07 05:24:46,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:24:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 282 transitions. [2021-01-07 05:24:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 05:24:46,563 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:46,564 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] [2021-01-07 05:24:46,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-07 05:24:46,564 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:46,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:46,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1703408731, now seen corresponding path program 1 times [2021-01-07 05:24:46,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:46,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223916449] [2021-01-07 05:24:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:46,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223916449] [2021-01-07 05:24:46,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:46,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:24:46,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468111720] [2021-01-07 05:24:46,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:24:46,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:46,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:24:46,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:46,596 INFO L87 Difference]: Start difference. First operand 239 states and 282 transitions. Second operand 3 states. [2021-01-07 05:24:46,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:46,607 INFO L93 Difference]: Finished difference Result 240 states and 283 transitions. [2021-01-07 05:24:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:24:46,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2021-01-07 05:24:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:46,610 INFO L225 Difference]: With dead ends: 240 [2021-01-07 05:24:46,610 INFO L226 Difference]: Without dead ends: 240 [2021-01-07 05:24:46,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-01-07 05:24:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-01-07 05:24:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2021-01-07 05:24:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 283 transitions. [2021-01-07 05:24:46,616 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 283 transitions. Word has length 38 [2021-01-07 05:24:46,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:46,616 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 283 transitions. [2021-01-07 05:24:46,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:24:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 283 transitions. [2021-01-07 05:24:46,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 05:24:46,617 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:46,617 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] [2021-01-07 05:24:46,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-07 05:24:46,618 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:46,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:46,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1433935337, now seen corresponding path program 1 times [2021-01-07 05:24:46,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:46,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219121802] [2021-01-07 05:24:46,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:46,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219121802] [2021-01-07 05:24:46,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:46,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-07 05:24:46,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188089841] [2021-01-07 05:24:46,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 05:24:46,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:46,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 05:24:46,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:24:46,831 INFO L87 Difference]: Start difference. First operand 240 states and 283 transitions. Second operand 14 states. [2021-01-07 05:24:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:47,984 INFO L93 Difference]: Finished difference Result 258 states and 303 transitions. [2021-01-07 05:24:47,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-07 05:24:47,985 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2021-01-07 05:24:47,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:47,987 INFO L225 Difference]: With dead ends: 258 [2021-01-07 05:24:47,987 INFO L226 Difference]: Without dead ends: 258 [2021-01-07 05:24:47,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2021-01-07 05:24:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-01-07 05:24:48,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 239. [2021-01-07 05:24:48,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-07 05:24:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 282 transitions. [2021-01-07 05:24:48,005 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 282 transitions. Word has length 38 [2021-01-07 05:24:48,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:48,005 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 282 transitions. [2021-01-07 05:24:48,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-07 05:24:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 282 transitions. [2021-01-07 05:24:48,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 05:24:48,006 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:48,006 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] [2021-01-07 05:24:48,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-07 05:24:48,007 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:48,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:48,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1433935336, now seen corresponding path program 1 times [2021-01-07 05:24:48,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:48,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540596327] [2021-01-07 05:24:48,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:48,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540596327] [2021-01-07 05:24:48,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:48,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-07 05:24:48,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034100153] [2021-01-07 05:24:48,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 05:24:48,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:48,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 05:24:48,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:24:48,243 INFO L87 Difference]: Start difference. First operand 239 states and 282 transitions. Second operand 14 states. [2021-01-07 05:24:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:49,586 INFO L93 Difference]: Finished difference Result 257 states and 302 transitions. [2021-01-07 05:24:49,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-07 05:24:49,587 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2021-01-07 05:24:49,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:49,588 INFO L225 Difference]: With dead ends: 257 [2021-01-07 05:24:49,589 INFO L226 Difference]: Without dead ends: 257 [2021-01-07 05:24:49,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2021-01-07 05:24:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-01-07 05:24:49,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 238. [2021-01-07 05:24:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2021-01-07 05:24:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 281 transitions. [2021-01-07 05:24:49,595 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 281 transitions. Word has length 38 [2021-01-07 05:24:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:49,596 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 281 transitions. [2021-01-07 05:24:49,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-07 05:24:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 281 transitions. [2021-01-07 05:24:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-07 05:24:49,597 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:49,597 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] [2021-01-07 05:24:49,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-07 05:24:49,597 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:49,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:49,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1476710115, now seen corresponding path program 1 times [2021-01-07 05:24:49,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:49,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151098326] [2021-01-07 05:24:49,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:49,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151098326] [2021-01-07 05:24:49,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:49,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-07 05:24:49,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931472305] [2021-01-07 05:24:49,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 05:24:49,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:49,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 05:24:49,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:24:49,911 INFO L87 Difference]: Start difference. First operand 238 states and 281 transitions. Second operand 14 states. [2021-01-07 05:24:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:51,446 INFO L93 Difference]: Finished difference Result 534 states and 582 transitions. [2021-01-07 05:24:51,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 05:24:51,447 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2021-01-07 05:24:51,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:51,450 INFO L225 Difference]: With dead ends: 534 [2021-01-07 05:24:51,450 INFO L226 Difference]: Without dead ends: 534 [2021-01-07 05:24:51,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:24:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-01-07 05:24:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 238. [2021-01-07 05:24:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2021-01-07 05:24:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 280 transitions. [2021-01-07 05:24:51,458 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 280 transitions. Word has length 39 [2021-01-07 05:24:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:51,459 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 280 transitions. [2021-01-07 05:24:51,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-07 05:24:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 280 transitions. [2021-01-07 05:24:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-07 05:24:51,460 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:51,460 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] [2021-01-07 05:24:51,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-07 05:24:51,460 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:51,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1716861432, now seen corresponding path program 1 times [2021-01-07 05:24:51,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:51,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860709203] [2021-01-07 05:24:51,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:24:51,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860709203] [2021-01-07 05:24:51,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:51,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:24:51,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762938331] [2021-01-07 05:24:51,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:24:51,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:51,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:24:51,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:51,494 INFO L87 Difference]: Start difference. First operand 238 states and 280 transitions. Second operand 3 states. [2021-01-07 05:24:51,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:51,549 INFO L93 Difference]: Finished difference Result 251 states and 284 transitions. [2021-01-07 05:24:51,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:24:51,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-01-07 05:24:51,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:51,551 INFO L225 Difference]: With dead ends: 251 [2021-01-07 05:24:51,551 INFO L226 Difference]: Without dead ends: 251 [2021-01-07 05:24:51,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:51,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-01-07 05:24:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 239. [2021-01-07 05:24:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-07 05:24:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 281 transitions. [2021-01-07 05:24:51,556 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 281 transitions. Word has length 39 [2021-01-07 05:24:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:51,557 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 281 transitions. [2021-01-07 05:24:51,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:24:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 281 transitions. [2021-01-07 05:24:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 05:24:51,558 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:51,558 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] [2021-01-07 05:24:51,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-07 05:24:51,558 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:51,559 INFO L82 PathProgramCache]: Analyzing trace with hash -591610838, now seen corresponding path program 1 times [2021-01-07 05:24:51,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:51,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883388871] [2021-01-07 05:24:51,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:51,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883388871] [2021-01-07 05:24:51,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:51,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:24:51,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389810263] [2021-01-07 05:24:51,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:24:51,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:51,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:24:51,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:24:51,630 INFO L87 Difference]: Start difference. First operand 239 states and 281 transitions. Second operand 7 states. [2021-01-07 05:24:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:51,917 INFO L93 Difference]: Finished difference Result 248 states and 292 transitions. [2021-01-07 05:24:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:24:51,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2021-01-07 05:24:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:51,919 INFO L225 Difference]: With dead ends: 248 [2021-01-07 05:24:51,919 INFO L226 Difference]: Without dead ends: 248 [2021-01-07 05:24:51,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:24:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-01-07 05:24:51,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 236. [2021-01-07 05:24:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2021-01-07 05:24:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 278 transitions. [2021-01-07 05:24:51,925 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 278 transitions. Word has length 40 [2021-01-07 05:24:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:51,925 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 278 transitions. [2021-01-07 05:24:51,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:24:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 278 transitions. [2021-01-07 05:24:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 05:24:51,927 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:51,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:51,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-07 05:24:51,927 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:51,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:51,928 INFO L82 PathProgramCache]: Analyzing trace with hash -495599428, now seen corresponding path program 1 times [2021-01-07 05:24:51,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:51,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697918195] [2021-01-07 05:24:51,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:24:51,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697918195] [2021-01-07 05:24:51,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:51,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:24:51,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192479138] [2021-01-07 05:24:51,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:24:51,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:51,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:24:51,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:51,964 INFO L87 Difference]: Start difference. First operand 236 states and 278 transitions. Second operand 3 states. [2021-01-07 05:24:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:52,034 INFO L93 Difference]: Finished difference Result 245 states and 286 transitions. [2021-01-07 05:24:52,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:24:52,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2021-01-07 05:24:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:52,037 INFO L225 Difference]: With dead ends: 245 [2021-01-07 05:24:52,037 INFO L226 Difference]: Without dead ends: 245 [2021-01-07 05:24:52,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:52,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-01-07 05:24:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 234. [2021-01-07 05:24:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-07 05:24:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 275 transitions. [2021-01-07 05:24:52,043 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 275 transitions. Word has length 41 [2021-01-07 05:24:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:52,043 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 275 transitions. [2021-01-07 05:24:52,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:24:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 275 transitions. [2021-01-07 05:24:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 05:24:52,044 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:52,044 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] [2021-01-07 05:24:52,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-07 05:24:52,045 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:52,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:52,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1816291356, now seen corresponding path program 1 times [2021-01-07 05:24:52,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:52,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809879658] [2021-01-07 05:24:52,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:24:52,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809879658] [2021-01-07 05:24:52,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:52,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:24:52,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100311343] [2021-01-07 05:24:52,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:24:52,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:52,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:24:52,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:24:52,170 INFO L87 Difference]: Start difference. First operand 234 states and 275 transitions. Second operand 10 states. [2021-01-07 05:24:52,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:52,824 INFO L93 Difference]: Finished difference Result 414 states and 468 transitions. [2021-01-07 05:24:52,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:24:52,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2021-01-07 05:24:52,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:52,827 INFO L225 Difference]: With dead ends: 414 [2021-01-07 05:24:52,827 INFO L226 Difference]: Without dead ends: 414 [2021-01-07 05:24:52,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:24:52,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-01-07 05:24:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 241. [2021-01-07 05:24:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2021-01-07 05:24:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 284 transitions. [2021-01-07 05:24:52,834 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 284 transitions. Word has length 42 [2021-01-07 05:24:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:52,835 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 284 transitions. [2021-01-07 05:24:52,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:24:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 284 transitions. [2021-01-07 05:24:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 05:24:52,835 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:52,836 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] [2021-01-07 05:24:52,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-07 05:24:52,836 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1816291357, now seen corresponding path program 1 times [2021-01-07 05:24:52,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:52,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903374364] [2021-01-07 05:24:52,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:24:52,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903374364] [2021-01-07 05:24:52,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:52,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:24:52,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307546674] [2021-01-07 05:24:52,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:24:52,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:52,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:24:52,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:24:52,980 INFO L87 Difference]: Start difference. First operand 241 states and 284 transitions. Second operand 10 states. [2021-01-07 05:24:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:53,993 INFO L93 Difference]: Finished difference Result 417 states and 471 transitions. [2021-01-07 05:24:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:24:53,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2021-01-07 05:24:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:53,996 INFO L225 Difference]: With dead ends: 417 [2021-01-07 05:24:53,996 INFO L226 Difference]: Without dead ends: 417 [2021-01-07 05:24:53,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:24:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2021-01-07 05:24:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 247. [2021-01-07 05:24:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2021-01-07 05:24:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 291 transitions. [2021-01-07 05:24:54,002 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 291 transitions. Word has length 42 [2021-01-07 05:24:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:54,003 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 291 transitions. [2021-01-07 05:24:54,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:24:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 291 transitions. [2021-01-07 05:24:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 05:24:54,004 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:54,004 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:54,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-07 05:24:54,004 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:54,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:54,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1746146402, now seen corresponding path program 1 times [2021-01-07 05:24:54,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:54,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536260031] [2021-01-07 05:24:54,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:54,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536260031] [2021-01-07 05:24:54,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608170069] [2021-01-07 05:24:54,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:24:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:54,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-07 05:24:54,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:24:54,296 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:24:54,297 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:54,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:54,305 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:24:54,306 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:54,311 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:54,312 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:54,312 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2021-01-07 05:24:54,325 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-01-07 05:24:54,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,338 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2021-01-07 05:24:54,339 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:54,344 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:54,345 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:54,353 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:54,358 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-01-07 05:24:54,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,369 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2021-01-07 05:24:54,370 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:54,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:54,376 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:54,384 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:54,385 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:54,385 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33 [2021-01-07 05:24:54,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,422 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-01-07 05:24:54,424 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:54,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:54,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,444 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-01-07 05:24:54,446 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:54,458 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:54,459 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:54,459 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2021-01-07 05:24:54,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:54,553 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2021-01-07 05:24:54,556 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:54,566 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:54,573 INFO L348 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-01-07 05:24:54,573 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 13 [2021-01-07 05:24:54,580 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:54,584 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:54,585 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:54,585 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:7 [2021-01-07 05:24:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:24:54,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:24:54,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2021-01-07 05:24:54,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925328293] [2021-01-07 05:24:54,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:24:54,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:54,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:24:54,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:24:54,612 INFO L87 Difference]: Start difference. First operand 247 states and 291 transitions. Second operand 9 states. [2021-01-07 05:24:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:55,211 INFO L93 Difference]: Finished difference Result 312 states and 347 transitions. [2021-01-07 05:24:55,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-07 05:24:55,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2021-01-07 05:24:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:55,214 INFO L225 Difference]: With dead ends: 312 [2021-01-07 05:24:55,214 INFO L226 Difference]: Without dead ends: 312 [2021-01-07 05:24:55,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:24:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-01-07 05:24:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 256. [2021-01-07 05:24:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2021-01-07 05:24:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 302 transitions. [2021-01-07 05:24:55,221 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 302 transitions. Word has length 42 [2021-01-07 05:24:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:55,221 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 302 transitions. [2021-01-07 05:24:55,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:24:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 302 transitions. [2021-01-07 05:24:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-07 05:24:55,222 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:55,222 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] [2021-01-07 05:24:55,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-01-07 05:24:55,438 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:55,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:55,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1704037666, now seen corresponding path program 1 times [2021-01-07 05:24:55,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:55,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597729937] [2021-01-07 05:24:55,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:24:55,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597729937] [2021-01-07 05:24:55,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613453507] [2021-01-07 05:24:55,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:24:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:55,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 05:24:55,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:24:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:24:55,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:24:55,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2021-01-07 05:24:55,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287801643] [2021-01-07 05:24:55,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:24:55,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:55,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:24:55,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:24:55,675 INFO L87 Difference]: Start difference. First operand 256 states and 302 transitions. Second operand 6 states. [2021-01-07 05:24:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:55,812 INFO L93 Difference]: Finished difference Result 287 states and 333 transitions. [2021-01-07 05:24:55,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:24:55,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2021-01-07 05:24:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:55,815 INFO L225 Difference]: With dead ends: 287 [2021-01-07 05:24:55,815 INFO L226 Difference]: Without dead ends: 263 [2021-01-07 05:24:55,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:24:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-01-07 05:24:55,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2021-01-07 05:24:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2021-01-07 05:24:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 309 transitions. [2021-01-07 05:24:55,821 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 309 transitions. Word has length 43 [2021-01-07 05:24:55,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:55,821 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 309 transitions. [2021-01-07 05:24:55,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:24:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 309 transitions. [2021-01-07 05:24:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 05:24:55,822 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:55,823 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] [2021-01-07 05:24:56,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-01-07 05:24:56,037 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:56,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:56,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1699282236, now seen corresponding path program 1 times [2021-01-07 05:24:56,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:56,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026167229] [2021-01-07 05:24:56,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:56,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026167229] [2021-01-07 05:24:56,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:56,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:24:56,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316443574] [2021-01-07 05:24:56,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:24:56,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:56,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:24:56,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:24:56,301 INFO L87 Difference]: Start difference. First operand 263 states and 309 transitions. Second operand 8 states. [2021-01-07 05:24:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:56,862 INFO L93 Difference]: Finished difference Result 287 states and 321 transitions. [2021-01-07 05:24:56,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:24:56,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2021-01-07 05:24:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:56,865 INFO L225 Difference]: With dead ends: 287 [2021-01-07 05:24:56,865 INFO L226 Difference]: Without dead ends: 287 [2021-01-07 05:24:56,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:24:56,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-01-07 05:24:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 262. [2021-01-07 05:24:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-01-07 05:24:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 307 transitions. [2021-01-07 05:24:56,872 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 307 transitions. Word has length 44 [2021-01-07 05:24:56,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:56,872 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 307 transitions. [2021-01-07 05:24:56,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:24:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 307 transitions. [2021-01-07 05:24:56,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 05:24:56,873 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:56,873 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] [2021-01-07 05:24:56,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-07 05:24:56,874 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:56,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash 91388494, now seen corresponding path program 1 times [2021-01-07 05:24:56,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:56,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514001362] [2021-01-07 05:24:56,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:56,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514001362] [2021-01-07 05:24:56,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:56,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:24:56,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321235627] [2021-01-07 05:24:56,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:24:56,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:56,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:24:56,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:56,910 INFO L87 Difference]: Start difference. First operand 262 states and 307 transitions. Second operand 3 states. [2021-01-07 05:24:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:56,923 INFO L93 Difference]: Finished difference Result 402 states and 478 transitions. [2021-01-07 05:24:56,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:24:56,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-07 05:24:56,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:56,925 INFO L225 Difference]: With dead ends: 402 [2021-01-07 05:24:56,926 INFO L226 Difference]: Without dead ends: 402 [2021-01-07 05:24:56,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:56,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-01-07 05:24:56,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 299. [2021-01-07 05:24:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2021-01-07 05:24:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 365 transitions. [2021-01-07 05:24:56,933 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 365 transitions. Word has length 44 [2021-01-07 05:24:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:56,933 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 365 transitions. [2021-01-07 05:24:56,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:24:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 365 transitions. [2021-01-07 05:24:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-07 05:24:56,934 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:56,934 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:56,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-07 05:24:56,935 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:56,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1924708417, now seen corresponding path program 1 times [2021-01-07 05:24:56,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:56,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835713977] [2021-01-07 05:24:56,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:56,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835713977] [2021-01-07 05:24:56,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:56,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:24:56,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537065395] [2021-01-07 05:24:56,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:24:56,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:56,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:24:56,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:24:56,997 INFO L87 Difference]: Start difference. First operand 299 states and 365 transitions. Second operand 6 states. [2021-01-07 05:24:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:57,150 INFO L93 Difference]: Finished difference Result 246 states and 277 transitions. [2021-01-07 05:24:57,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:24:57,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2021-01-07 05:24:57,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:57,153 INFO L225 Difference]: With dead ends: 246 [2021-01-07 05:24:57,153 INFO L226 Difference]: Without dead ends: 246 [2021-01-07 05:24:57,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:24:57,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-01-07 05:24:57,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2021-01-07 05:24:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2021-01-07 05:24:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 277 transitions. [2021-01-07 05:24:57,160 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 277 transitions. Word has length 46 [2021-01-07 05:24:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:57,160 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 277 transitions. [2021-01-07 05:24:57,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:24:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 277 transitions. [2021-01-07 05:24:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-07 05:24:57,162 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:57,162 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] [2021-01-07 05:24:57,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-07 05:24:57,162 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:57,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:57,163 INFO L82 PathProgramCache]: Analyzing trace with hash -89945751, now seen corresponding path program 1 times [2021-01-07 05:24:57,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:57,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534548342] [2021-01-07 05:24:57,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:24:57,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534548342] [2021-01-07 05:24:57,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:57,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 05:24:57,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569406857] [2021-01-07 05:24:57,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:24:57,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:57,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:24:57,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:24:57,279 INFO L87 Difference]: Start difference. First operand 246 states and 277 transitions. Second operand 10 states. [2021-01-07 05:24:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:57,914 INFO L93 Difference]: Finished difference Result 349 states and 387 transitions. [2021-01-07 05:24:57,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:24:57,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2021-01-07 05:24:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:57,917 INFO L225 Difference]: With dead ends: 349 [2021-01-07 05:24:57,917 INFO L226 Difference]: Without dead ends: 349 [2021-01-07 05:24:57,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:24:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-01-07 05:24:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 223. [2021-01-07 05:24:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2021-01-07 05:24:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 252 transitions. [2021-01-07 05:24:57,922 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 252 transitions. Word has length 49 [2021-01-07 05:24:57,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:57,923 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 252 transitions. [2021-01-07 05:24:57,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:24:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 252 transitions. [2021-01-07 05:24:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 05:24:57,924 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:57,924 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:57,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-07 05:24:57,924 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:57,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:57,925 INFO L82 PathProgramCache]: Analyzing trace with hash -179789688, now seen corresponding path program 1 times [2021-01-07 05:24:57,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:57,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628531234] [2021-01-07 05:24:57,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:57,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628531234] [2021-01-07 05:24:57,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:57,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:24:57,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374120939] [2021-01-07 05:24:57,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:24:57,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:57,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:24:57,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:57,985 INFO L87 Difference]: Start difference. First operand 223 states and 252 transitions. Second operand 5 states. [2021-01-07 05:24:58,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:58,137 INFO L93 Difference]: Finished difference Result 236 states and 266 transitions. [2021-01-07 05:24:58,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:24:58,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2021-01-07 05:24:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:58,139 INFO L225 Difference]: With dead ends: 236 [2021-01-07 05:24:58,139 INFO L226 Difference]: Without dead ends: 236 [2021-01-07 05:24:58,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:24:58,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-01-07 05:24:58,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 226. [2021-01-07 05:24:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2021-01-07 05:24:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 255 transitions. [2021-01-07 05:24:58,145 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 255 transitions. Word has length 51 [2021-01-07 05:24:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:58,145 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 255 transitions. [2021-01-07 05:24:58,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:24:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 255 transitions. [2021-01-07 05:24:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-07 05:24:58,146 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:58,146 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:58,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-07 05:24:58,146 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:24:58,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:58,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1415295011, now seen corresponding path program 1 times [2021-01-07 05:24:58,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:58,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193780768] [2021-01-07 05:24:58,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:58,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193780768] [2021-01-07 05:24:58,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322721348] [2021-01-07 05:24:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:24:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:58,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 41 conjunts are in the unsatisfiable core [2021-01-07 05:24:58,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:24:58,747 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:24:58,748 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:58,752 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:58,753 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:58,753 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:24:58,790 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:24:58,791 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:58,798 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:58,802 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:24:58,802 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:58,811 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:58,812 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:58,812 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2021-01-07 05:24:58,871 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:58,871 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:24:58,873 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:58,877 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:58,888 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:58,889 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:58,889 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2021-01-07 05:24:58,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:58,939 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-01-07 05:24:58,941 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:58,957 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:58,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:58,964 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-01-07 05:24:58,966 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:58,985 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:58,988 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:58,988 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:36 [2021-01-07 05:24:59,079 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_56|], 6=[|v_#memory_$Pointer$.base_56|]} [2021-01-07 05:24:59,084 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-01-07 05:24:59,085 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:59,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:59,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:59,143 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:59,143 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 107 [2021-01-07 05:24:59,148 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-07 05:24:59,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:24:59,152 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-01-07 05:24:59,191 INFO L625 ElimStorePlain]: treesize reduction 46, result has 57.4 percent of original size [2021-01-07 05:24:59,193 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:59,194 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:62 [2021-01-07 05:24:59,430 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_57|], 12=[|v_#memory_$Pointer$.base_57|]} [2021-01-07 05:24:59,449 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:59,450 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 62 [2021-01-07 05:24:59,452 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:59,522 INFO L625 ElimStorePlain]: treesize reduction 20, result has 81.8 percent of original size [2021-01-07 05:24:59,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:59,619 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:59,620 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 178 [2021-01-07 05:24:59,629 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:59,692 INFO L625 ElimStorePlain]: treesize reduction 16, result has 83.3 percent of original size [2021-01-07 05:24:59,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:24:59,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:59,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:59,711 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:59,712 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:50 [2021-01-07 05:24:59,821 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_58|], 12=[|v_#memory_$Pointer$.base_58|]} [2021-01-07 05:24:59,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:59,827 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2021-01-07 05:24:59,828 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:59,849 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:59,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:59,952 INFO L348 Elim1Store]: treesize reduction 46, result has 65.2 percent of original size [2021-01-07 05:24:59,953 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 124 [2021-01-07 05:24:59,959 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-07 05:24:59,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:24:59,963 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:59,989 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:59,993 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:59,994 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:97, output treesize:81 [2021-01-07 05:25:00,323 INFO L443 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2021-01-07 05:25:00,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:25:00,329 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2021-01-07 05:25:00,331 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:00,345 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:00,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:25:00,404 INFO L348 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2021-01-07 05:25:00,404 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 72 [2021-01-07 05:25:00,407 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:25:00,408 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:25:00,409 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:25:00,410 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:25:00,411 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:25:00,412 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:25:00,414 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:00,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:00,422 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:00,422 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:88, output treesize:7 [2021-01-07 05:25:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:25:00,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:25:00,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2021-01-07 05:25:00,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611122442] [2021-01-07 05:25:00,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-01-07 05:25:00,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:25:00,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-01-07 05:25:00,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:25:00,467 INFO L87 Difference]: Start difference. First operand 226 states and 255 transitions. Second operand 27 states. [2021-01-07 05:25:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:25:05,010 INFO L93 Difference]: Finished difference Result 461 states and 487 transitions. [2021-01-07 05:25:05,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-01-07 05:25:05,011 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2021-01-07 05:25:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:25:05,014 INFO L225 Difference]: With dead ends: 461 [2021-01-07 05:25:05,023 INFO L226 Difference]: Without dead ends: 461 [2021-01-07 05:25:05,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=593, Invalid=2829, Unknown=0, NotChecked=0, Total=3422 [2021-01-07 05:25:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-01-07 05:25:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 265. [2021-01-07 05:25:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2021-01-07 05:25:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 297 transitions. [2021-01-07 05:25:05,033 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 297 transitions. Word has length 53 [2021-01-07 05:25:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:25:05,033 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 297 transitions. [2021-01-07 05:25:05,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-01-07 05:25:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 297 transitions. [2021-01-07 05:25:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-07 05:25:05,034 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:25:05,034 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:25:05,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:25:05,250 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:25:05,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:25:05,251 INFO L82 PathProgramCache]: Analyzing trace with hash -940395114, now seen corresponding path program 1 times [2021-01-07 05:25:05,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:25:05,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954117324] [2021-01-07 05:25:05,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:25:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:25:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:25:05,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954117324] [2021-01-07 05:25:05,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783889487] [2021-01-07 05:25:05,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:25:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:25:05,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 32 conjunts are in the unsatisfiable core [2021-01-07 05:25:05,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:25:05,853 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:05,853 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:25:05,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:05,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:05,859 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:05,869 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:05,870 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:05,870 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-01-07 05:25:05,907 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:25:05,908 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:05,920 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:05,922 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:05,922 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2021-01-07 05:25:06,020 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:06,020 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 52 [2021-01-07 05:25:06,022 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2021-01-07 05:25:06,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:25:06,024 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:25:06,053 INFO L625 ElimStorePlain]: treesize reduction 28, result has 54.8 percent of original size [2021-01-07 05:25:06,055 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:06,055 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2021-01-07 05:25:06,249 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:06,249 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 105 [2021-01-07 05:25:06,254 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:06,306 INFO L625 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2021-01-07 05:25:06,310 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:06,310 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:30 [2021-01-07 05:25:06,418 INFO L348 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2021-01-07 05:25:06,418 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 67 [2021-01-07 05:25:06,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:25:06,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:25:06,426 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:06,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:06,441 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:06,441 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2021-01-07 05:25:06,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:25:06,748 INFO L348 Elim1Store]: treesize reduction 10, result has 84.8 percent of original size [2021-01-07 05:25:06,749 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 77 [2021-01-07 05:25:06,752 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:06,773 INFO L625 ElimStorePlain]: treesize reduction 3, result has 86.4 percent of original size [2021-01-07 05:25:06,776 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:06,776 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:5 [2021-01-07 05:25:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:25:06,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:25:06,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2021-01-07 05:25:06,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285257747] [2021-01-07 05:25:06,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-01-07 05:25:06,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:25:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-01-07 05:25:06,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:25:06,874 INFO L87 Difference]: Start difference. First operand 265 states and 297 transitions. Second operand 27 states. [2021-01-07 05:25:09,726 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-01-07 05:25:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:25:11,694 INFO L93 Difference]: Finished difference Result 556 states and 590 transitions. [2021-01-07 05:25:11,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-01-07 05:25:11,694 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2021-01-07 05:25:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:25:11,698 INFO L225 Difference]: With dead ends: 556 [2021-01-07 05:25:11,698 INFO L226 Difference]: Without dead ends: 556 [2021-01-07 05:25:11,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=606, Invalid=2256, Unknown=0, NotChecked=0, Total=2862 [2021-01-07 05:25:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-01-07 05:25:11,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 352. [2021-01-07 05:25:11,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2021-01-07 05:25:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 399 transitions. [2021-01-07 05:25:11,708 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 399 transitions. Word has length 55 [2021-01-07 05:25:11,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:25:11,708 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 399 transitions. [2021-01-07 05:25:11,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-01-07 05:25:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 399 transitions. [2021-01-07 05:25:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-07 05:25:11,709 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:25:11,709 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:25:11,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-01-07 05:25:11,925 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:25:11,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:25:11,926 INFO L82 PathProgramCache]: Analyzing trace with hash -940395113, now seen corresponding path program 1 times [2021-01-07 05:25:11,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:25:11,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281041117] [2021-01-07 05:25:11,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:25:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:25:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:25:12,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281041117] [2021-01-07 05:25:12,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381275892] [2021-01-07 05:25:12,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:25:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:25:12,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 43 conjunts are in the unsatisfiable core [2021-01-07 05:25:12,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:25:12,369 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:25:12,370 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:12,377 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:12,378 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:12,378 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:25:12,489 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_78|], 1=[|v_#valid_93|]} [2021-01-07 05:25:12,493 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:25:12,494 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:12,513 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:12,523 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:12,523 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:25:12,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:12,526 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:12,540 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:12,542 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:12,542 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2021-01-07 05:25:12,593 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:25:12,594 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:12,611 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:12,616 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:25:12,616 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:12,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:12,636 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:12,636 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2021-01-07 05:25:12,752 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:12,753 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 70 [2021-01-07 05:25:12,756 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:25:12,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:25:12,758 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:25:12,831 INFO L625 ElimStorePlain]: treesize reduction 46, result has 60.7 percent of original size [2021-01-07 05:25:12,837 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-01-07 05:25:12,838 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:12,857 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:12,858 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:12,859 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:63 [2021-01-07 05:25:13,072 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:13,073 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 60 [2021-01-07 05:25:13,077 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:13,141 INFO L625 ElimStorePlain]: treesize reduction 26, result has 75.9 percent of original size [2021-01-07 05:25:13,199 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:13,199 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 119 [2021-01-07 05:25:13,204 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:13,267 INFO L625 ElimStorePlain]: treesize reduction 16, result has 81.0 percent of original size [2021-01-07 05:25:13,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:13,272 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:13,273 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:68 [2021-01-07 05:25:13,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:13,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:25:13,396 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2021-01-07 05:25:13,398 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:13,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:13,470 INFO L348 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2021-01-07 05:25:13,471 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 83 [2021-01-07 05:25:13,474 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:25:13,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:25:13,476 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:13,498 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:13,499 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:13,500 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:79 [2021-01-07 05:25:13,806 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:25:13,836 INFO L348 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2021-01-07 05:25:13,839 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 64 [2021-01-07 05:25:13,842 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:13,888 INFO L625 ElimStorePlain]: treesize reduction 3, result has 94.2 percent of original size [2021-01-07 05:25:13,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:25:13,896 INFO L348 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-01-07 05:25:13,896 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 13 [2021-01-07 05:25:13,898 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:13,910 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:13,913 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:13,914 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:99, output treesize:9 [2021-01-07 05:25:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:25:13,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:25:13,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2021-01-07 05:25:13,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773538562] [2021-01-07 05:25:13,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-01-07 05:25:13,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:25:13,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-01-07 05:25:13,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2021-01-07 05:25:13,959 INFO L87 Difference]: Start difference. First operand 352 states and 399 transitions. Second operand 26 states. [2021-01-07 05:25:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:25:16,872 INFO L93 Difference]: Finished difference Result 506 states and 546 transitions. [2021-01-07 05:25:16,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:25:16,873 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2021-01-07 05:25:16,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:25:16,875 INFO L225 Difference]: With dead ends: 506 [2021-01-07 05:25:16,875 INFO L226 Difference]: Without dead ends: 506 [2021-01-07 05:25:16,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=319, Invalid=1487, Unknown=0, NotChecked=0, Total=1806 [2021-01-07 05:25:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-01-07 05:25:16,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 382. [2021-01-07 05:25:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2021-01-07 05:25:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 437 transitions. [2021-01-07 05:25:16,885 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 437 transitions. Word has length 55 [2021-01-07 05:25:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:25:16,885 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 437 transitions. [2021-01-07 05:25:16,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2021-01-07 05:25:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 437 transitions. [2021-01-07 05:25:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-07 05:25:16,886 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:25:16,887 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] [2021-01-07 05:25:17,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:25:17,100 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:25:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:25:17,101 INFO L82 PathProgramCache]: Analyzing trace with hash -283385346, now seen corresponding path program 1 times [2021-01-07 05:25:17,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:25:17,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243237465] [2021-01-07 05:25:17,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:25:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:25:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:25:17,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243237465] [2021-01-07 05:25:17,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9223804] [2021-01-07 05:25:17,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:25:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:25:17,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 35 conjunts are in the unsatisfiable core [2021-01-07 05:25:17,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:25:17,765 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:25:17,766 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:17,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:17,772 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:17,773 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2021-01-07 05:25:17,808 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:17,809 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:25:17,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:17,813 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:17,817 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:17,818 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:17,819 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2021-01-07 05:25:17,844 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:25:17,845 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:17,851 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:17,852 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:17,852 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2021-01-07 05:25:17,932 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:17,933 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 54 [2021-01-07 05:25:17,935 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2021-01-07 05:25:17,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:25:17,936 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:17,943 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:17,944 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:17,944 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:28 [2021-01-07 05:25:18,048 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_63|], 6=[|v_#memory_$Pointer$.base_69|]} [2021-01-07 05:25:18,054 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2021-01-07 05:25:18,056 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:18,072 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:18,123 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:18,123 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 149 [2021-01-07 05:25:18,126 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:25:18,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:25:18,129 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:18,161 INFO L625 ElimStorePlain]: treesize reduction 38, result has 64.8 percent of original size [2021-01-07 05:25:18,162 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:18,162 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:70 [2021-01-07 05:25:18,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:18,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:18,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:25:18,728 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:18,729 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 66 [2021-01-07 05:25:18,731 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:25:18,733 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:18,767 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:18,779 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:18,780 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 70 [2021-01-07 05:25:18,782 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:25:18,785 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:18,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:18,822 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2021-01-07 05:25:18,824 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:18,848 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:18,852 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 16 [2021-01-07 05:25:18,854 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:18,873 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:18,875 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:18,876 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:219, output treesize:7 [2021-01-07 05:25:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:25:18,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:25:18,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 25 [2021-01-07 05:25:18,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393922399] [2021-01-07 05:25:18,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-07 05:25:18,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:25:18,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-07 05:25:18,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2021-01-07 05:25:18,912 INFO L87 Difference]: Start difference. First operand 382 states and 437 transitions. Second operand 13 states. [2021-01-07 05:25:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:25:24,711 INFO L93 Difference]: Finished difference Result 581 states and 650 transitions. [2021-01-07 05:25:24,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 05:25:24,712 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2021-01-07 05:25:24,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:25:24,714 INFO L225 Difference]: With dead ends: 581 [2021-01-07 05:25:24,714 INFO L226 Difference]: Without dead ends: 581 [2021-01-07 05:25:24,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=225, Invalid=1257, Unknown=0, NotChecked=0, Total=1482 [2021-01-07 05:25:24,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-01-07 05:25:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 382. [2021-01-07 05:25:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2021-01-07 05:25:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 436 transitions. [2021-01-07 05:25:24,724 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 436 transitions. Word has length 56 [2021-01-07 05:25:24,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:25:24,724 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 436 transitions. [2021-01-07 05:25:24,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-07 05:25:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 436 transitions. [2021-01-07 05:25:24,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-07 05:25:24,725 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:25:24,725 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:25:24,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-01-07 05:25:24,939 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:25:24,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:25:24,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1922935185, now seen corresponding path program 1 times [2021-01-07 05:25:24,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:25:24,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914655318] [2021-01-07 05:25:24,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:25:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:25:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:25:25,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914655318] [2021-01-07 05:25:25,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367686504] [2021-01-07 05:25:25,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:25:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:25:25,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 40 conjunts are in the unsatisfiable core [2021-01-07 05:25:25,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:25:25,662 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:25:25,663 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:25,669 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:25,670 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:25,670 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:25:25,735 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:25,735 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:25:25,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:25,739 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:25,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:25,747 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:25,748 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-01-07 05:25:25,794 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:25:25,795 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:25,807 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:25,808 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:25,808 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2021-01-07 05:25:25,887 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:25,887 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 59 [2021-01-07 05:25:25,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 05:25:25,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:25:25,892 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:25,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:25,906 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:25,906 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2021-01-07 05:25:26,088 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:26,089 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 109 [2021-01-07 05:25:26,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:25:26,093 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:25:26,095 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:26,130 INFO L625 ElimStorePlain]: treesize reduction 26, result has 69.0 percent of original size [2021-01-07 05:25:26,132 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:26,132 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2021-01-07 05:25:32,245 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2021-01-07 05:25:32,383 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:32,384 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2021-01-07 05:25:32,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:25:32,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:32,392 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:32,416 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:32,418 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:32,418 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:67 [2021-01-07 05:25:32,568 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:32,569 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 113 [2021-01-07 05:25:32,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:25:32,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:25:32,575 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:25:32,576 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:25:32,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:25:32,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:25:32,583 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:25:32,586 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:32,667 INFO L625 ElimStorePlain]: treesize reduction 46, result has 58.6 percent of original size [2021-01-07 05:25:32,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:25:32,673 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:32,673 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:78, output treesize:70 [2021-01-07 05:25:32,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:25:32,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:25:32,985 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 10, 1] term [2021-01-07 05:25:32,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:32,996 INFO L443 ElimStorePlain]: Different costs {6=[v_prenex_9], 12=[|v_#memory_$Pointer$.base_74|]} [2021-01-07 05:25:33,050 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:33,050 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 107 [2021-01-07 05:25:33,054 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:25:33,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:25:33,059 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:25:33,204 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2021-01-07 05:25:33,205 INFO L625 ElimStorePlain]: treesize reduction 46, result has 79.1 percent of original size [2021-01-07 05:25:33,322 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-07 05:25:33,323 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:33,324 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 202 [2021-01-07 05:25:33,331 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 2, 1] term [2021-01-07 05:25:33,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:25:33,333 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:25:33,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:25:33,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:25:33,335 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:25:33,336 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:25:33,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:25:33,338 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:25:33,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:25:33,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:25:33,341 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:25:33,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:25:33,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:25:33,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:25:33,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:25:33,347 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:25:33,348 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:25:33,350 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:25:33,356 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 1] term [2021-01-07 05:25:33,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:25:33,357 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:33,518 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2021-01-07 05:25:33,519 INFO L625 ElimStorePlain]: treesize reduction 109, result has 60.4 percent of original size [2021-01-07 05:25:33,523 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2021-01-07 05:25:33,524 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:182, output treesize:166 [2021-01-07 05:25:33,722 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 10, 1] term [2021-01-07 05:25:33,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:34,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:34,204 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:34,205 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 182 [2021-01-07 05:25:34,213 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:34,405 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-01-07 05:25:34,405 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:34,406 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 279 [2021-01-07 05:25:34,413 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:25:34,415 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:25:34,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:25:34,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:25:34,418 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:25:34,419 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:25:34,419 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:25:34,424 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:34,615 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2021-01-07 05:25:34,616 INFO L625 ElimStorePlain]: treesize reduction 38, result has 81.3 percent of original size [2021-01-07 05:25:34,621 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-01-07 05:25:34,622 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:201, output treesize:135 [2021-01-07 05:25:36,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:36,854 INFO L443 ElimStorePlain]: Different costs {12=[v_prenex_13], 20=[|v_#memory_$Pointer$.base_76|]} [2021-01-07 05:25:36,965 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2021-01-07 05:25:36,966 INFO L348 Elim1Store]: treesize reduction 48, result has 66.2 percent of original size [2021-01-07 05:25:36,966 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 125 [2021-01-07 05:25:36,970 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-07 05:25:36,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:25:36,975 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:37,039 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:37,275 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2021-01-07 05:25:37,276 INFO L348 Elim1Store]: treesize reduction 60, result has 73.8 percent of original size [2021-01-07 05:25:37,277 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 100 treesize of output 212 [2021-01-07 05:25:37,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:25:37,284 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:25:37,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:25:37,286 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:25:37,286 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:25:37,288 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[12, 3, 2, 1] term [2021-01-07 05:25:37,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:25:37,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:25:37,291 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:25:37,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:25:37,292 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:25:37,292 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:25:37,295 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:25:37,431 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2021-01-07 05:25:37,431 INFO L625 ElimStorePlain]: treesize reduction 6, result has 96.9 percent of original size [2021-01-07 05:25:37,435 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2021-01-07 05:25:37,435 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:205, output treesize:187 [2021-01-07 05:25:37,979 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2021-01-07 05:25:37,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:25:37,995 INFO L443 ElimStorePlain]: Different costs {12=[v_prenex_16], 20=[|#memory_$Pointer$.base|]} [2021-01-07 05:25:38,068 INFO L348 Elim1Store]: treesize reduction 10, result has 85.1 percent of original size [2021-01-07 05:25:38,069 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 85 [2021-01-07 05:25:38,072 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:38,114 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:38,279 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2021-01-07 05:25:38,279 INFO L348 Elim1Store]: treesize reduction 10, result has 92.2 percent of original size [2021-01-07 05:25:38,280 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 159 [2021-01-07 05:25:38,284 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:25:38,285 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:25:38,286 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:25:38,286 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:25:38,287 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:25:38,289 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:25:38,290 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:25:38,290 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:25:38,292 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:25:38,293 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:25:38,293 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:25:38,296 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:25:38,324 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:38,329 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-01-07 05:25:38,329 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:177, output treesize:57 [2021-01-07 05:25:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:25:38,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:25:38,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2021-01-07 05:25:38,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419943823] [2021-01-07 05:25:38,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-01-07 05:25:38,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:25:38,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-01-07 05:25:38,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1194, Unknown=4, NotChecked=0, Total=1406 [2021-01-07 05:25:38,595 INFO L87 Difference]: Start difference. First operand 382 states and 436 transitions. Second operand 38 states. [2021-01-07 05:25:52,315 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2021-01-07 05:26:02,980 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2021-01-07 05:26:05,329 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2021-01-07 05:26:09,694 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2021-01-07 05:26:10,071 WARN L197 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2021-01-07 05:26:10,657 WARN L197 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2021-01-07 05:26:11,018 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2021-01-07 05:26:18,938 WARN L197 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-01-07 05:26:25,694 WARN L197 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2021-01-07 05:26:35,989 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-01-07 05:26:42,315 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 74 [2021-01-07 05:26:43,043 WARN L197 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 77 [2021-01-07 05:26:43,666 WARN L197 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 77 [2021-01-07 05:26:47,272 WARN L197 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 139 DAG size of output: 84 [2021-01-07 05:26:51,331 WARN L197 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2021-01-07 05:26:57,121 WARN L197 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 79 DAG size of output: 79 [2021-01-07 05:26:57,590 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2021-01-07 05:26:58,519 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2021-01-07 05:27:01,235 WARN L197 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2021-01-07 05:27:03,708 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2021-01-07 05:27:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:27:04,262 INFO L93 Difference]: Finished difference Result 716 states and 792 transitions. [2021-01-07 05:27:04,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-01-07 05:27:04,262 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 57 [2021-01-07 05:27:04,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:27:04,266 INFO L225 Difference]: With dead ends: 716 [2021-01-07 05:27:04,266 INFO L226 Difference]: Without dead ends: 716 [2021-01-07 05:27:04,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 69.9s TimeCoverageRelationStatistics Valid=894, Invalid=4196, Unknown=22, NotChecked=0, Total=5112 [2021-01-07 05:27:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-01-07 05:27:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 382. [2021-01-07 05:27:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2021-01-07 05:27:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 435 transitions. [2021-01-07 05:27:04,276 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 435 transitions. Word has length 57 [2021-01-07 05:27:04,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:27:04,277 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 435 transitions. [2021-01-07 05:27:04,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2021-01-07 05:27:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 435 transitions. [2021-01-07 05:27:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-07 05:27:04,278 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:27:04,278 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:27:04,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-01-07 05:27:04,492 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:27:04,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:27:04,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1922935184, now seen corresponding path program 1 times [2021-01-07 05:27:04,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:27:04,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963986520] [2021-01-07 05:27:04,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:27:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:27:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:27:05,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963986520] [2021-01-07 05:27:05,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454533360] [2021-01-07 05:27:05,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:27:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:27:05,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 58 conjunts are in the unsatisfiable core [2021-01-07 05:27:05,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:27:05,388 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:27:05,388 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:05,394 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:05,395 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:05,396 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:27:05,435 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_79|], 3=[|v_#valid_100|]} [2021-01-07 05:27:05,439 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:27:05,441 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:05,456 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:05,481 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:05,481 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:27:05,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:27:05,486 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:05,498 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:05,500 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:05,500 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2021-01-07 05:27:05,561 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:27:05,562 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:05,581 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:05,586 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:27:05,587 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:05,603 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:05,604 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:05,604 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:50 [2021-01-07 05:27:05,727 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2021-01-07 05:27:05,729 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:05,750 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:05,776 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:05,776 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 71 [2021-01-07 05:27:05,778 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-07 05:27:05,779 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:27:05,780 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:05,800 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:05,802 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:05,802 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:76 [2021-01-07 05:27:06,026 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:06,027 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 73 [2021-01-07 05:27:06,028 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:06,126 INFO L625 ElimStorePlain]: treesize reduction 26, result has 83.5 percent of original size [2021-01-07 05:27:06,184 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:06,186 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 137 [2021-01-07 05:27:06,190 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[12, 3, 2, 1] term [2021-01-07 05:27:06,190 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:27:06,192 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:06,286 INFO L625 ElimStorePlain]: treesize reduction 26, result has 82.4 percent of original size [2021-01-07 05:27:06,288 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:06,288 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:148, output treesize:122 [2021-01-07 05:27:06,600 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_80|], 3=[|v_#valid_101|]} [2021-01-07 05:27:06,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:06,608 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-01-07 05:27:06,610 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:06,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:06,678 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:06,679 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2021-01-07 05:27:06,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:27:06,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:27:06,684 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:06,725 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:06,728 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:06,728 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:113, output treesize:105 [2021-01-07 05:27:06,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:06,861 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2021-01-07 05:27:06,863 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:06,920 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:06,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:06,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:06,941 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:06,942 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 77 [2021-01-07 05:27:06,949 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:06,998 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:07,004 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:07,004 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:127, output treesize:117 [2021-01-07 05:27:07,252 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_68|], 12=[|v_#memory_$Pointer$.base_81|]} [2021-01-07 05:27:07,260 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2021-01-07 05:27:07,262 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:07,317 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:07,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:07,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:07,424 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:07,425 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 130 treesize of output 203 [2021-01-07 05:27:07,432 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 2, 1] term [2021-01-07 05:27:07,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:27:07,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:27:07,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:27:07,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:27:07,436 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:27:07,437 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:07,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:27:07,440 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:27:07,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:27:07,442 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:07,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:27:07,444 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:27:07,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 9, 1] term [2021-01-07 05:27:07,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:27:07,451 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:27:07,559 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2021-01-07 05:27:07,559 INFO L625 ElimStorePlain]: treesize reduction 116, result has 55.2 percent of original size [2021-01-07 05:27:07,561 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:07,561 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:159, output treesize:143 [2021-01-07 05:27:08,013 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_69|], 20=[|v_#memory_$Pointer$.base_82|]} [2021-01-07 05:27:08,039 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:08,039 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 80 [2021-01-07 05:27:08,041 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:08,196 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2021-01-07 05:27:08,197 INFO L625 ElimStorePlain]: treesize reduction 20, result has 89.5 percent of original size [2021-01-07 05:27:08,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:08,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:08,397 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-01-07 05:27:08,398 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:08,398 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 146 treesize of output 286 [2021-01-07 05:27:08,403 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-07 05:27:08,404 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:27:08,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:27:08,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:27:08,407 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:27:08,408 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:08,408 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:08,412 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:08,576 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2021-01-07 05:27:08,577 INFO L625 ElimStorePlain]: treesize reduction 16, result has 90.5 percent of original size [2021-01-07 05:27:08,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:27:08,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:27:08,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:27:08,586 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:08,587 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:169, output treesize:123 [2021-01-07 05:27:08,794 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_70|], 20=[|v_#memory_$Pointer$.base_83|]} [2021-01-07 05:27:08,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:08,802 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 58 [2021-01-07 05:27:08,804 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:08,868 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:08,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:08,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:09,089 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2021-01-07 05:27:09,090 INFO L348 Elim1Store]: treesize reduction 60, result has 70.7 percent of original size [2021-01-07 05:27:09,091 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 152 treesize of output 220 [2021-01-07 05:27:09,097 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:27:09,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:27:09,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:27:09,100 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:09,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 3, 2, 1] term [2021-01-07 05:27:09,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-07 05:27:09,103 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:27:09,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:27:09,105 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:09,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:27:09,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:27:09,110 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:09,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:09,172 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:09,173 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:178, output treesize:162 [2021-01-07 05:27:09,606 INFO L443 ElimStorePlain]: Different costs {12=[|#memory_$Pointer$.offset|], 20=[|#memory_$Pointer$.base|]} [2021-01-07 05:27:09,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:09,615 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 16 [2021-01-07 05:27:09,618 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:09,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:09,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:09,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:09,828 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2021-01-07 05:27:09,829 INFO L348 Elim1Store]: treesize reduction 10, result has 90.7 percent of original size [2021-01-07 05:27:09,829 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 102 treesize of output 144 [2021-01-07 05:27:09,833 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:09,834 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:27:09,835 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:09,835 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:27:09,843 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:09,866 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:09,870 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:09,870 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:159, output treesize:23 [2021-01-07 05:27:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:27:10,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:27:10,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2021-01-07 05:27:10,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718137015] [2021-01-07 05:27:10,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-01-07 05:27:10,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:27:10,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-01-07 05:27:10,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1282, Unknown=0, NotChecked=0, Total=1482 [2021-01-07 05:27:10,098 INFO L87 Difference]: Start difference. First operand 382 states and 435 transitions. Second operand 39 states. [2021-01-07 05:27:10,983 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2021-01-07 05:27:11,366 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2021-01-07 05:27:11,645 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2021-01-07 05:27:11,940 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2021-01-07 05:27:12,243 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2021-01-07 05:27:13,751 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2021-01-07 05:27:14,051 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2021-01-07 05:27:14,260 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2021-01-07 05:27:15,947 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2021-01-07 05:27:16,135 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2021-01-07 05:27:19,483 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 77 [2021-01-07 05:27:19,684 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2021-01-07 05:27:20,179 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 82 [2021-01-07 05:27:20,495 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 82 [2021-01-07 05:27:20,795 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 89 [2021-01-07 05:27:21,260 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2021-01-07 05:27:21,660 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2021-01-07 05:27:21,921 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2021-01-07 05:27:22,765 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2021-01-07 05:27:23,308 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2021-01-07 05:27:24,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:27:24,525 INFO L93 Difference]: Finished difference Result 770 states and 846 transitions. [2021-01-07 05:27:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-01-07 05:27:24,526 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 57 [2021-01-07 05:27:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:27:24,530 INFO L225 Difference]: With dead ends: 770 [2021-01-07 05:27:24,530 INFO L226 Difference]: Without dead ends: 770 [2021-01-07 05:27:24,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=981, Invalid=4569, Unknown=0, NotChecked=0, Total=5550 [2021-01-07 05:27:24,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2021-01-07 05:27:24,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 382. [2021-01-07 05:27:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2021-01-07 05:27:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 432 transitions. [2021-01-07 05:27:24,542 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 432 transitions. Word has length 57 [2021-01-07 05:27:24,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:27:24,542 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 432 transitions. [2021-01-07 05:27:24,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2021-01-07 05:27:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 432 transitions. [2021-01-07 05:27:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-07 05:27:24,543 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:27:24,543 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:27:24,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-01-07 05:27:24,758 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:27:24,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:27:24,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1577159246, now seen corresponding path program 1 times [2021-01-07 05:27:24,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:27:24,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827827395] [2021-01-07 05:27:24,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:27:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:27:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:27:25,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827827395] [2021-01-07 05:27:25,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:27:25,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-07 05:27:25,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807959710] [2021-01-07 05:27:25,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 05:27:25,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:27:25,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 05:27:25,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:27:25,040 INFO L87 Difference]: Start difference. First operand 382 states and 432 transitions. Second operand 12 states. [2021-01-07 05:27:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:27:26,532 INFO L93 Difference]: Finished difference Result 560 states and 632 transitions. [2021-01-07 05:27:26,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-07 05:27:26,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2021-01-07 05:27:26,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:27:26,535 INFO L225 Difference]: With dead ends: 560 [2021-01-07 05:27:26,535 INFO L226 Difference]: Without dead ends: 560 [2021-01-07 05:27:26,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2021-01-07 05:27:26,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-01-07 05:27:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2021-01-07 05:27:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2021-01-07 05:27:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 431 transitions. [2021-01-07 05:27:26,542 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 431 transitions. Word has length 59 [2021-01-07 05:27:26,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:27:26,543 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 431 transitions. [2021-01-07 05:27:26,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 05:27:26,543 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 431 transitions. [2021-01-07 05:27:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-07 05:27:26,544 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:27:26,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:27:26,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-01-07 05:27:26,544 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:27:26,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:27:26,545 INFO L82 PathProgramCache]: Analyzing trace with hash -609997204, now seen corresponding path program 1 times [2021-01-07 05:27:26,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:27:26,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561417887] [2021-01-07 05:27:26,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:27:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:27:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:27:26,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561417887] [2021-01-07 05:27:26,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:27:26,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:27:26,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242115907] [2021-01-07 05:27:26,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:27:26,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:27:26,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:27:26,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:27:26,638 INFO L87 Difference]: Start difference. First operand 382 states and 431 transitions. Second operand 7 states. [2021-01-07 05:27:27,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:27:27,110 INFO L93 Difference]: Finished difference Result 389 states and 435 transitions. [2021-01-07 05:27:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:27:27,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2021-01-07 05:27:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:27:27,113 INFO L225 Difference]: With dead ends: 389 [2021-01-07 05:27:27,113 INFO L226 Difference]: Without dead ends: 389 [2021-01-07 05:27:27,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:27:27,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-01-07 05:27:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 382. [2021-01-07 05:27:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2021-01-07 05:27:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 430 transitions. [2021-01-07 05:27:27,119 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 430 transitions. Word has length 59 [2021-01-07 05:27:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:27:27,120 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 430 transitions. [2021-01-07 05:27:27,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:27:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 430 transitions. [2021-01-07 05:27:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-07 05:27:27,121 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:27:27,121 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:27:27,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-01-07 05:27:27,121 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:27:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:27:27,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1104767537, now seen corresponding path program 1 times [2021-01-07 05:27:27,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:27:27,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944266579] [2021-01-07 05:27:27,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:27:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:27:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:27:28,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944266579] [2021-01-07 05:27:28,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778944650] [2021-01-07 05:27:28,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:27:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:27:28,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 55 conjunts are in the unsatisfiable core [2021-01-07 05:27:28,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:27:28,342 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:27:28,343 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:28,348 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:28,349 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:28,349 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:27:28,408 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:28,408 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:27:28,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:27:28,412 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:28,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:28,421 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:28,421 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-01-07 05:27:28,479 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:27:28,480 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:28,494 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:28,495 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:28,496 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2021-01-07 05:27:28,643 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:28,643 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 59 [2021-01-07 05:27:28,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 05:27:28,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:27:28,647 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:28,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:28,662 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:28,662 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2021-01-07 05:27:28,842 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_71|], 6=[|v_#memory_$Pointer$.base_86|]} [2021-01-07 05:27:28,848 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2021-01-07 05:27:28,849 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:28,873 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:28,931 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:28,932 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 154 [2021-01-07 05:27:28,934 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-07 05:27:28,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:27:28,936 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:28,986 INFO L625 ElimStorePlain]: treesize reduction 38, result has 69.1 percent of original size [2021-01-07 05:27:28,987 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:28,988 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:85 [2021-01-07 05:27:29,238 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:29,239 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2021-01-07 05:27:29,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:27:29,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:27:29,244 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:29,271 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:29,272 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:29,273 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:83, output treesize:76 [2021-01-07 05:27:29,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:29,373 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2021-01-07 05:27:29,375 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:29,408 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:29,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:29,458 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:29,459 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 131 [2021-01-07 05:27:29,462 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:29,537 INFO L625 ElimStorePlain]: treesize reduction 66, result has 57.7 percent of original size [2021-01-07 05:27:29,539 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:29,539 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:84 [2021-01-07 05:27:29,731 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_73|], 12=[|v_#memory_$Pointer$.base_88|]} [2021-01-07 05:27:29,738 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 59 [2021-01-07 05:27:29,748 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:29,782 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:29,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:29,897 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2021-01-07 05:27:29,897 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:29,898 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 242 [2021-01-07 05:27:29,903 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 2, 1] term [2021-01-07 05:27:29,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:27:29,904 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:27:29,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:27:29,906 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:29,907 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:27:29,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:27:29,908 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:27:29,909 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:29,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:27:29,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:27:29,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:27:29,912 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:29,913 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:27:29,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:27:29,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:27:29,916 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:29,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:27:29,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:27:29,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:27:29,921 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:29,921 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:27:29,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:27:29,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:27:29,924 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:29,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:27:29,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:27:29,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:27:29,927 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:29,928 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:27:29,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:27:29,930 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:27:29,931 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:29,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:27:29,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:27:29,938 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 1] term [2021-01-07 05:27:29,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:27:29,939 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:27:30,022 INFO L625 ElimStorePlain]: treesize reduction 129, result has 46.0 percent of original size [2021-01-07 05:27:30,024 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:30,024 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:110 [2021-01-07 05:27:30,394 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_74|], 20=[|v_#memory_$Pointer$.base_89|]} [2021-01-07 05:27:30,421 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:30,422 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 95 [2021-01-07 05:27:30,424 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:30,534 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2021-01-07 05:27:30,535 INFO L625 ElimStorePlain]: treesize reduction 20, result has 87.3 percent of original size [2021-01-07 05:27:30,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:30,741 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-01-07 05:27:30,742 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:30,742 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 125 treesize of output 331 [2021-01-07 05:27:30,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:27:30,749 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:27:30,749 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:27:30,750 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:27:30,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:27:30,751 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:27:30,751 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:30,752 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:30,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:27:30,754 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:27:30,755 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:30,756 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:30,758 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:27:30,759 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:27:30,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:27:30,760 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:27:30,761 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:30,762 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:30,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:27:30,764 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:27:30,765 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:30,766 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:30,771 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:30,861 INFO L625 ElimStorePlain]: treesize reduction 16, result has 88.6 percent of original size [2021-01-07 05:27:30,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:27:30,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:27:30,865 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:30,865 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:136, output treesize:94 [2021-01-07 05:27:31,024 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_75|], 20=[|v_#memory_$Pointer$.base_90|]} [2021-01-07 05:27:31,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:31,030 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2021-01-07 05:27:31,032 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:31,074 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:31,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:31,330 WARN L197 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2021-01-07 05:27:31,331 INFO L348 Elim1Store]: treesize reduction 66, result has 74.7 percent of original size [2021-01-07 05:27:31,332 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 259 [2021-01-07 05:27:31,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:27:31,346 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:31,346 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:31,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:27:31,348 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:31,349 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:27:31,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:27:31,350 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:31,352 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 3, 2, 1] term [2021-01-07 05:27:31,353 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-07 05:27:31,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:27:31,354 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:27:31,355 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:31,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:27:31,356 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:31,359 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:31,394 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:31,397 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:31,397 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:145, output treesize:129 [2021-01-07 05:27:32,104 INFO L443 ElimStorePlain]: Different costs {12=[|#memory_$Pointer$.offset|], 20=[|#memory_$Pointer$.base|]} [2021-01-07 05:27:32,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:32,111 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 44 [2021-01-07 05:27:32,114 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:32,138 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:32,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:32,330 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2021-01-07 05:27:32,331 INFO L348 Elim1Store]: treesize reduction 10, result has 91.2 percent of original size [2021-01-07 05:27:32,331 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 133 [2021-01-07 05:27:32,336 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:32,337 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:27:32,338 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:32,339 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:27:32,339 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:27:32,345 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:27:32,346 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:27:32,347 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:27:32,348 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:27:32,350 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:32,359 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:32,361 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:32,361 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:148, output treesize:7 [2021-01-07 05:27:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:27:32,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:27:32,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 40 [2021-01-07 05:27:32,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435720010] [2021-01-07 05:27:32,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-01-07 05:27:32,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:27:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-01-07 05:27:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1394, Unknown=0, NotChecked=0, Total=1560 [2021-01-07 05:27:32,436 INFO L87 Difference]: Start difference. First operand 382 states and 430 transitions. Second operand 40 states. [2021-01-07 05:27:34,482 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2021-01-07 05:27:34,874 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 62 [2021-01-07 05:27:35,300 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2021-01-07 05:27:35,680 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 70 [2021-01-07 05:27:36,041 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2021-01-07 05:27:36,634 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 89 [2021-01-07 05:27:37,062 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2021-01-07 05:27:37,400 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2021-01-07 05:27:38,457 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2021-01-07 05:27:39,430 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2021-01-07 05:27:39,711 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 62 [2021-01-07 05:27:39,992 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2021-01-07 05:27:40,707 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 98 [2021-01-07 05:27:41,103 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 98 [2021-01-07 05:27:41,555 WARN L197 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 110 [2021-01-07 05:27:42,130 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2021-01-07 05:27:42,478 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 102 [2021-01-07 05:27:43,117 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2021-01-07 05:27:43,540 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 96 [2021-01-07 05:27:44,675 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 108 [2021-01-07 05:27:45,473 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2021-01-07 05:27:46,457 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2021-01-07 05:27:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:27:47,061 INFO L93 Difference]: Finished difference Result 794 states and 870 transitions. [2021-01-07 05:27:47,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-01-07 05:27:47,062 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 59 [2021-01-07 05:27:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:27:47,065 INFO L225 Difference]: With dead ends: 794 [2021-01-07 05:27:47,065 INFO L226 Difference]: Without dead ends: 794 [2021-01-07 05:27:47,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1001, Invalid=5319, Unknown=0, NotChecked=0, Total=6320 [2021-01-07 05:27:47,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2021-01-07 05:27:47,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 382. [2021-01-07 05:27:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2021-01-07 05:27:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 429 transitions. [2021-01-07 05:27:47,075 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 429 transitions. Word has length 59 [2021-01-07 05:27:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:27:47,076 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 429 transitions. [2021-01-07 05:27:47,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2021-01-07 05:27:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 429 transitions. [2021-01-07 05:27:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-07 05:27:47,077 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:27:47,077 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:27:47,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:27:47,292 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:27:47,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:27:47,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1012593699, now seen corresponding path program 1 times [2021-01-07 05:27:47,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:27:47,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469930725] [2021-01-07 05:27:47,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:27:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:27:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:27:47,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469930725] [2021-01-07 05:27:47,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623716979] [2021-01-07 05:27:47,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:27:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:27:48,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 55 conjunts are in the unsatisfiable core [2021-01-07 05:27:48,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:27:48,070 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:27:48,071 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:48,076 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:48,076 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:48,077 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:27:48,279 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:48,279 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:27:48,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:27:48,284 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:48,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:48,306 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:48,307 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2021-01-07 05:27:48,386 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:27:48,387 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:48,438 INFO L625 ElimStorePlain]: treesize reduction 5, result has 90.0 percent of original size [2021-01-07 05:27:48,443 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:27:48,444 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:48,469 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:48,470 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:48,471 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:42 [2021-01-07 05:27:48,657 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-01-07 05:27:48,658 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:48,692 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:48,723 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:48,723 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 66 [2021-01-07 05:27:48,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:27:48,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:27:48,729 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-01-07 05:27:48,795 INFO L625 ElimStorePlain]: treesize reduction 42, result has 61.8 percent of original size [2021-01-07 05:27:48,797 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:48,797 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:68 [2021-01-07 05:27:49,205 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:49,206 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 119 [2021-01-07 05:27:49,209 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:49,319 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2021-01-07 05:27:49,320 INFO L625 ElimStorePlain]: treesize reduction 16, result has 83.3 percent of original size [2021-01-07 05:27:49,346 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:49,347 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2021-01-07 05:27:49,349 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:49,453 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2021-01-07 05:27:49,454 INFO L625 ElimStorePlain]: treesize reduction 22, result has 77.6 percent of original size [2021-01-07 05:27:49,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:27:49,457 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:49,457 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:76 [2021-01-07 05:27:49,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:27:49,642 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:49,643 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2021-01-07 05:27:49,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:27:49,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:27:49,647 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:49,673 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:49,675 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:49,675 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:50 [2021-01-07 05:27:49,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:49,783 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-01-07 05:27:49,785 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:49,828 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:49,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:49,837 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-01-07 05:27:49,839 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:49,885 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:49,888 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:49,888 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:83, output treesize:69 [2021-01-07 05:27:50,128 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_80|], 12=[|v_#memory_$Pointer$.base_95|]} [2021-01-07 05:27:50,134 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2021-01-07 05:27:50,138 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:50,185 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:50,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:50,277 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:50,278 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 133 [2021-01-07 05:27:50,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2021-01-07 05:27:50,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:27:50,283 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:50,328 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:50,330 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:50,330 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:115, output treesize:95 [2021-01-07 05:27:50,618 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_81|], 20=[|v_#memory_$Pointer$.base_96|]} [2021-01-07 05:27:50,649 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:50,650 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 94 [2021-01-07 05:27:50,654 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:50,788 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2021-01-07 05:27:50,789 INFO L625 ElimStorePlain]: treesize reduction 30, result has 85.4 percent of original size [2021-01-07 05:27:50,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:50,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:50,967 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-01-07 05:27:50,968 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:50,969 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 160 treesize of output 254 [2021-01-07 05:27:50,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[15, 3, 2, 1] term [2021-01-07 05:27:50,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 05:27:50,977 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 18 disjuncts [2021-01-07 05:27:50,978 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 17 disjuncts [2021-01-07 05:27:50,978 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 17 disjuncts [2021-01-07 05:27:50,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 17 disjuncts [2021-01-07 05:27:50,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2021-01-07 05:27:50,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2021-01-07 05:27:50,983 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2021-01-07 05:27:50,984 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2021-01-07 05:27:50,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 05:27:50,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 05:27:50,988 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2021-01-07 05:27:50,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 05:27:50,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 05:27:50,992 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2021-01-07 05:27:51,018 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2021-01-07 05:27:51,310 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2021-01-07 05:27:51,311 INFO L625 ElimStorePlain]: treesize reduction 776, result has 17.3 percent of original size [2021-01-07 05:27:51,314 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 05:27:51,315 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:190, output treesize:162 [2021-01-07 05:27:55,935 INFO L443 ElimStorePlain]: Different costs {20=[|#memory_$Pointer$.offset|], 30=[|#memory_$Pointer$.base|]} [2021-01-07 05:27:55,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:27:55,952 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:55,952 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 26 [2021-01-07 05:27:55,954 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:56,066 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2021-01-07 05:27:56,067 INFO L625 ElimStorePlain]: treesize reduction 3, result has 97.6 percent of original size [2021-01-07 05:27:56,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:56,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:56,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:56,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:27:56,236 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-07 05:27:56,237 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:56,238 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 183 [2021-01-07 05:27:56,242 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:27:56,243 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:27:56,244 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:27:56,245 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:56,245 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:27:56,246 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:27:56,247 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:27:56,248 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:27:56,248 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:27:56,256 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:27:56,256 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:27:56,258 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:27:56,260 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:56,281 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:56,285 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:27:56,285 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:182, output treesize:9 [2021-01-07 05:27:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:27:56,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:27:56,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 37 [2021-01-07 05:27:56,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795296613] [2021-01-07 05:27:56,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-01-07 05:27:56,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:27:56,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-01-07 05:27:56,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1266, Unknown=2, NotChecked=0, Total=1406 [2021-01-07 05:27:56,495 INFO L87 Difference]: Start difference. First operand 382 states and 429 transitions. Second operand 38 states. [2021-01-07 05:27:57,666 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2021-01-07 05:27:57,926 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2021-01-07 05:27:58,115 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2021-01-07 05:27:58,414 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2021-01-07 05:27:59,324 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2021-01-07 05:28:01,865 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2021-01-07 05:28:04,311 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2021-01-07 05:28:08,701 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2021-01-07 05:28:12,957 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2021-01-07 05:28:19,398 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 66 [2021-01-07 05:28:25,891 WARN L197 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 125 DAG size of output: 74