./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 20:45:26,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 20:45:26,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 20:45:26,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 20:45:26,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 20:45:26,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 20:45:26,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 20:45:26,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 20:45:26,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 20:45:26,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 20:45:26,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 20:45:26,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 20:45:26,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 20:45:26,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 20:45:26,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 20:45:26,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 20:45:26,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 20:45:26,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 20:45:26,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 20:45:26,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 20:45:26,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 20:45:26,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 20:45:26,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 20:45:26,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 20:45:26,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 20:45:26,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 20:45:26,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 20:45:26,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 20:45:26,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 20:45:26,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 20:45:26,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 20:45:26,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 20:45:26,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 20:45:26,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 20:45:26,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 20:45:26,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 20:45:26,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 20:45:26,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 20:45:26,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 20:45:26,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 20:45:26,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 20:45:26,581 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 20:45:26,612 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 20:45:26,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 20:45:26,613 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 20:45:26,613 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 20:45:26,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 20:45:26,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 20:45:26,614 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 20:45:26,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 20:45:26,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 20:45:26,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 20:45:26,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 20:45:26,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 20:45:26,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 20:45:26,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 20:45:26,616 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 20:45:26,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 20:45:26,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 20:45:26,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 20:45:26,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 20:45:26,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:45:26,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 20:45:26,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 20:45:26,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 20:45:26,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 20:45:26,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 20:45:26,618 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 20:45:26,619 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 20:45:26,619 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 20:45:26,619 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 20:45:26,619 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce [2021-11-22 20:45:26,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 20:45:26,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 20:45:26,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 20:45:26,879 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 20:45:26,881 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 20:45:26,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2021-11-22 20:45:26,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488d5bf94/387c228266b2473787ab9f04809c0980/FLAG814588251 [2021-11-22 20:45:27,694 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 20:45:27,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2021-11-22 20:45:27,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488d5bf94/387c228266b2473787ab9f04809c0980/FLAG814588251 [2021-11-22 20:45:27,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488d5bf94/387c228266b2473787ab9f04809c0980 [2021-11-22 20:45:27,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 20:45:27,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 20:45:27,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 20:45:27,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 20:45:27,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 20:45:27,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:45:27" (1/1) ... [2021-11-22 20:45:27,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f32b7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:27, skipping insertion in model container [2021-11-22 20:45:27,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:45:27" (1/1) ... [2021-11-22 20:45:27,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 20:45:28,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:45:28,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4496,4509] [2021-11-22 20:45:28,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4556,4569] [2021-11-22 20:45:28,864 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:28,865 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:28,865 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:28,866 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:28,867 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:28,878 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:28,879 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:28,880 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:28,881 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:29,153 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:45:29,154 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:45:29,155 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:45:29,158 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:45:29,160 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:45:29,163 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:45:29,164 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:45:29,165 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:45:29,166 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:45:29,166 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:45:29,294 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:45:29,423 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:29,423 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:29,501 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:45:29,541 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 20:45:29,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4496,4509] [2021-11-22 20:45:29,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4556,4569] [2021-11-22 20:45:29,580 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:29,581 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:29,581 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:29,582 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:29,582 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:29,591 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:29,591 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:29,592 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:29,592 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:29,617 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:45:29,617 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:45:29,618 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:45:29,618 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:45:29,619 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:45:29,619 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:45:29,620 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:45:29,620 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:45:29,620 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:45:29,621 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:45:29,638 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:45:29,685 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:29,685 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:29,758 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:45:29,952 INFO L208 MainTranslator]: Completed translation [2021-11-22 20:45:29,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:29 WrapperNode [2021-11-22 20:45:29,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 20:45:29,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 20:45:29,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 20:45:29,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 20:45:29,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:29" (1/1) ... [2021-11-22 20:45:30,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:29" (1/1) ... [2021-11-22 20:45:30,141 INFO L137 Inliner]: procedures = 693, calls = 2792, calls flagged for inlining = 1059, calls inlined = 40, statements flattened = 1155 [2021-11-22 20:45:30,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 20:45:30,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 20:45:30,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 20:45:30,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 20:45:30,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:29" (1/1) ... [2021-11-22 20:45:30,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:29" (1/1) ... [2021-11-22 20:45:30,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:29" (1/1) ... [2021-11-22 20:45:30,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:29" (1/1) ... [2021-11-22 20:45:30,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:29" (1/1) ... [2021-11-22 20:45:30,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:29" (1/1) ... [2021-11-22 20:45:30,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:29" (1/1) ... [2021-11-22 20:45:30,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 20:45:30,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 20:45:30,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 20:45:30,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 20:45:30,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:29" (1/1) ... [2021-11-22 20:45:30,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:45:30,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:45:30,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 20:45:30,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 20:45:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-22 20:45:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 20:45:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 20:45:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 20:45:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 20:45:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 20:45:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 20:45:30,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 20:45:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-22 20:45:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 20:45:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 20:45:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 20:45:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 20:45:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 20:45:30,560 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 20:45:30,562 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 20:45:31,550 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 20:45:31,557 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 20:45:31,557 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-22 20:45:31,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:45:31 BoogieIcfgContainer [2021-11-22 20:45:31,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 20:45:31,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 20:45:31,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 20:45:31,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 20:45:31,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:45:27" (1/3) ... [2021-11-22 20:45:31,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ab9ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:45:31, skipping insertion in model container [2021-11-22 20:45:31,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:29" (2/3) ... [2021-11-22 20:45:31,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ab9ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:45:31, skipping insertion in model container [2021-11-22 20:45:31,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:45:31" (3/3) ... [2021-11-22 20:45:31,565 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_buf_harness.i [2021-11-22 20:45:31,569 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 20:45:31,570 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-22 20:45:31,605 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 20:45:31,610 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 20:45:31,610 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-22 20:45:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 136 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 20:45:31,628 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:31,629 INFO L514 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-11-22 20:45:31,629 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:31,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:31,633 INFO L85 PathProgramCache]: Analyzing trace with hash -33651646, now seen corresponding path program 1 times [2021-11-22 20:45:31,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:31,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645318294] [2021-11-22 20:45:31,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:31,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:32,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:32,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645318294] [2021-11-22 20:45:32,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645318294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:32,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:32,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 20:45:32,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667216370] [2021-11-22 20:45:32,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:32,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 20:45:32,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:32,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 20:45:32,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:45:32,100 INFO L87 Difference]: Start difference. First operand has 137 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 136 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:32,128 INFO L93 Difference]: Finished difference Result 268 states and 368 transitions. [2021-11-22 20:45:32,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 20:45:32,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-22 20:45:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:32,138 INFO L225 Difference]: With dead ends: 268 [2021-11-22 20:45:32,138 INFO L226 Difference]: Without dead ends: 132 [2021-11-22 20:45:32,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:45:32,144 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:32,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-22 20:45:32,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-11-22 20:45:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.3228346456692914) internal successors, (168), 131 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 168 transitions. [2021-11-22 20:45:32,191 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 168 transitions. Word has length 36 [2021-11-22 20:45:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:32,192 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 168 transitions. [2021-11-22 20:45:32,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions. [2021-11-22 20:45:32,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 20:45:32,194 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:32,194 INFO L514 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-11-22 20:45:32,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 20:45:32,194 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:32,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:32,201 INFO L85 PathProgramCache]: Analyzing trace with hash 611456452, now seen corresponding path program 1 times [2021-11-22 20:45:32,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:32,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257411273] [2021-11-22 20:45:32,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:32,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:32,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:32,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257411273] [2021-11-22 20:45:32,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257411273] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:32,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:32,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:45:32,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100830934] [2021-11-22 20:45:32,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:32,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:45:32,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:32,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:45:32,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:32,442 INFO L87 Difference]: Start difference. First operand 132 states and 168 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:32,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:32,519 INFO L93 Difference]: Finished difference Result 223 states and 285 transitions. [2021-11-22 20:45:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:45:32,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-22 20:45:32,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:32,521 INFO L225 Difference]: With dead ends: 223 [2021-11-22 20:45:32,522 INFO L226 Difference]: Without dead ends: 132 [2021-11-22 20:45:32,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:32,524 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 191 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:32,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 254 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:32,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-22 20:45:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-11-22 20:45:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 131 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2021-11-22 20:45:32,540 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 36 [2021-11-22 20:45:32,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:32,541 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2021-11-22 20:45:32,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2021-11-22 20:45:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 20:45:32,544 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:32,545 INFO L514 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-11-22 20:45:32,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 20:45:32,545 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:32,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:32,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2037285817, now seen corresponding path program 1 times [2021-11-22 20:45:32,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:32,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205627187] [2021-11-22 20:45:32,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:32,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:32,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:32,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205627187] [2021-11-22 20:45:32,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205627187] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:32,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:32,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:45:32,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003401384] [2021-11-22 20:45:32,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:32,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:45:32,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:32,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:45:32,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:45:32,791 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:32,848 INFO L93 Difference]: Finished difference Result 264 states and 331 transitions. [2021-11-22 20:45:32,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:45:32,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-22 20:45:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:32,850 INFO L225 Difference]: With dead ends: 264 [2021-11-22 20:45:32,850 INFO L226 Difference]: Without dead ends: 217 [2021-11-22 20:45:32,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:45:32,851 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 285 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:32,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 564 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-22 20:45:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 162. [2021-11-22 20:45:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 157 states have (on average 1.3184713375796178) internal successors, (207), 161 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 207 transitions. [2021-11-22 20:45:32,863 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 207 transitions. Word has length 42 [2021-11-22 20:45:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:32,863 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 207 transitions. [2021-11-22 20:45:32,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 207 transitions. [2021-11-22 20:45:32,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 20:45:32,864 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:32,865 INFO L514 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-11-22 20:45:32,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 20:45:32,865 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:32,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:32,866 INFO L85 PathProgramCache]: Analyzing trace with hash 757422139, now seen corresponding path program 1 times [2021-11-22 20:45:32,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:32,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645729450] [2021-11-22 20:45:32,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:32,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:33,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:33,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645729450] [2021-11-22 20:45:33,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645729450] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:33,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:33,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:45:33,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316454820] [2021-11-22 20:45:33,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:33,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:45:33,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:33,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:45:33,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:33,056 INFO L87 Difference]: Start difference. First operand 162 states and 207 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:33,095 INFO L93 Difference]: Finished difference Result 327 states and 420 transitions. [2021-11-22 20:45:33,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:45:33,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-22 20:45:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:33,098 INFO L225 Difference]: With dead ends: 327 [2021-11-22 20:45:33,098 INFO L226 Difference]: Without dead ends: 282 [2021-11-22 20:45:33,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:33,100 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 83 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:33,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 482 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-11-22 20:45:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 263. [2021-11-22 20:45:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.3255813953488371) internal successors, (342), 262 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 342 transitions. [2021-11-22 20:45:33,130 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 342 transitions. Word has length 42 [2021-11-22 20:45:33,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:33,132 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 342 transitions. [2021-11-22 20:45:33,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 342 transitions. [2021-11-22 20:45:33,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-22 20:45:33,137 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:33,137 INFO L514 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] [2021-11-22 20:45:33,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 20:45:33,138 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:33,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:33,139 INFO L85 PathProgramCache]: Analyzing trace with hash 767639687, now seen corresponding path program 1 times [2021-11-22 20:45:33,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:33,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085717022] [2021-11-22 20:45:33,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:33,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:33,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:33,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085717022] [2021-11-22 20:45:33,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085717022] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:33,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:33,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:45:33,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735869567] [2021-11-22 20:45:33,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:33,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:45:33,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:33,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:45:33,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:45:33,319 INFO L87 Difference]: Start difference. First operand 263 states and 342 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:33,420 INFO L93 Difference]: Finished difference Result 402 states and 510 transitions. [2021-11-22 20:45:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:45:33,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-22 20:45:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:33,422 INFO L225 Difference]: With dead ends: 402 [2021-11-22 20:45:33,423 INFO L226 Difference]: Without dead ends: 396 [2021-11-22 20:45:33,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:45:33,424 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 121 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:33,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 702 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:45:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-22 20:45:33,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 263. [2021-11-22 20:45:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.321705426356589) internal successors, (341), 262 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 341 transitions. [2021-11-22 20:45:33,432 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 341 transitions. Word has length 52 [2021-11-22 20:45:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:33,433 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 341 transitions. [2021-11-22 20:45:33,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:33,433 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 341 transitions. [2021-11-22 20:45:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-22 20:45:33,434 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:33,434 INFO L514 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] [2021-11-22 20:45:33,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 20:45:33,435 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:33,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash -554030433, now seen corresponding path program 1 times [2021-11-22 20:45:33,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:33,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82378262] [2021-11-22 20:45:33,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:33,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:33,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:33,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82378262] [2021-11-22 20:45:33,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82378262] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:33,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:33,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 20:45:33,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578470596] [2021-11-22 20:45:33,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:33,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:45:33,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:33,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:45:33,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:45:33,692 INFO L87 Difference]: Start difference. First operand 263 states and 341 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:33,853 INFO L93 Difference]: Finished difference Result 329 states and 419 transitions. [2021-11-22 20:45:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 20:45:33,853 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-22 20:45:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:33,855 INFO L225 Difference]: With dead ends: 329 [2021-11-22 20:45:33,855 INFO L226 Difference]: Without dead ends: 282 [2021-11-22 20:45:33,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-11-22 20:45:33,856 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 814 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:33,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [814 Valid, 1215 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:45:33,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-11-22 20:45:33,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 233. [2021-11-22 20:45:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 232 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 299 transitions. [2021-11-22 20:45:33,864 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 299 transitions. Word has length 53 [2021-11-22 20:45:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:33,864 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 299 transitions. [2021-11-22 20:45:33,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:33,865 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 299 transitions. [2021-11-22 20:45:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-22 20:45:33,865 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:33,866 INFO L514 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] [2021-11-22 20:45:33,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 20:45:33,866 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:33,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:33,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1055454782, now seen corresponding path program 1 times [2021-11-22 20:45:33,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:33,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624717741] [2021-11-22 20:45:33,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:33,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:34,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:34,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624717741] [2021-11-22 20:45:34,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624717741] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:34,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:34,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 20:45:34,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934852033] [2021-11-22 20:45:34,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:34,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 20:45:34,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:34,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 20:45:34,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:45:34,084 INFO L87 Difference]: Start difference. First operand 233 states and 299 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:34,331 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2021-11-22 20:45:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 20:45:34,331 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-22 20:45:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:34,333 INFO L225 Difference]: With dead ends: 384 [2021-11-22 20:45:34,333 INFO L226 Difference]: Without dead ends: 337 [2021-11-22 20:45:34,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2021-11-22 20:45:34,334 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 1067 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:34,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1067 Valid, 1568 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:45:34,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-11-22 20:45:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 264. [2021-11-22 20:45:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.3166023166023166) internal successors, (341), 263 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 341 transitions. [2021-11-22 20:45:34,342 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 341 transitions. Word has length 54 [2021-11-22 20:45:34,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:34,343 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 341 transitions. [2021-11-22 20:45:34,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 341 transitions. [2021-11-22 20:45:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-22 20:45:34,344 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:34,344 INFO L514 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] [2021-11-22 20:45:34,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 20:45:34,345 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:34,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:34,346 INFO L85 PathProgramCache]: Analyzing trace with hash 34386428, now seen corresponding path program 1 times [2021-11-22 20:45:34,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:34,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221423304] [2021-11-22 20:45:34,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:34,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:34,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:34,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221423304] [2021-11-22 20:45:34,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221423304] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:34,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:34,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 20:45:34,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14101473] [2021-11-22 20:45:34,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:34,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:45:34,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:34,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:45:34,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:45:34,573 INFO L87 Difference]: Start difference. First operand 264 states and 341 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:34,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:34,736 INFO L93 Difference]: Finished difference Result 385 states and 493 transitions. [2021-11-22 20:45:34,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 20:45:34,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-22 20:45:34,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:34,738 INFO L225 Difference]: With dead ends: 385 [2021-11-22 20:45:34,738 INFO L226 Difference]: Without dead ends: 283 [2021-11-22 20:45:34,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-11-22 20:45:34,739 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 718 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:34,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [718 Valid, 1304 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:45:34,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-11-22 20:45:34,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 264. [2021-11-22 20:45:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.308880308880309) internal successors, (339), 263 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 339 transitions. [2021-11-22 20:45:34,748 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 339 transitions. Word has length 54 [2021-11-22 20:45:34,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:34,749 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 339 transitions. [2021-11-22 20:45:34,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 339 transitions. [2021-11-22 20:45:34,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-22 20:45:34,750 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:34,750 INFO L514 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-11-22 20:45:34,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 20:45:34,750 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:34,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash 77415231, now seen corresponding path program 1 times [2021-11-22 20:45:34,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:34,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616900282] [2021-11-22 20:45:34,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:34,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:34,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:34,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616900282] [2021-11-22 20:45:34,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616900282] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:34,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:34,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:45:34,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734444050] [2021-11-22 20:45:34,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:34,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:45:34,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:34,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:45:34,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:45:34,924 INFO L87 Difference]: Start difference. First operand 264 states and 339 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:35,150 INFO L93 Difference]: Finished difference Result 749 states and 961 transitions. [2021-11-22 20:45:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:45:35,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-22 20:45:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:35,154 INFO L225 Difference]: With dead ends: 749 [2021-11-22 20:45:35,154 INFO L226 Difference]: Without dead ends: 539 [2021-11-22 20:45:35,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:45:35,155 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 335 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:35,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 395 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:45:35,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-11-22 20:45:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 299. [2021-11-22 20:45:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.316326530612245) internal successors, (387), 298 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 387 transitions. [2021-11-22 20:45:35,168 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 387 transitions. Word has length 56 [2021-11-22 20:45:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:35,168 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 387 transitions. [2021-11-22 20:45:35,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 387 transitions. [2021-11-22 20:45:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-22 20:45:35,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:35,169 INFO L514 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-11-22 20:45:35,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 20:45:35,170 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:35,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash 757473601, now seen corresponding path program 1 times [2021-11-22 20:45:35,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:35,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260382661] [2021-11-22 20:45:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:35,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:35,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:35,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260382661] [2021-11-22 20:45:35,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260382661] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:35,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:35,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 20:45:35,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676188430] [2021-11-22 20:45:35,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:35,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:45:35,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:35,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:45:35,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:45:35,598 INFO L87 Difference]: Start difference. First operand 299 states and 387 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:35,851 INFO L93 Difference]: Finished difference Result 640 states and 827 transitions. [2021-11-22 20:45:35,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 20:45:35,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-22 20:45:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:35,853 INFO L225 Difference]: With dead ends: 640 [2021-11-22 20:45:35,854 INFO L226 Difference]: Without dead ends: 415 [2021-11-22 20:45:35,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2021-11-22 20:45:35,855 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 572 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:35,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 482 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:45:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2021-11-22 20:45:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 315. [2021-11-22 20:45:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.2870967741935484) internal successors, (399), 314 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:35,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 399 transitions. [2021-11-22 20:45:35,865 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 399 transitions. Word has length 56 [2021-11-22 20:45:35,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:35,865 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 399 transitions. [2021-11-22 20:45:35,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:35,866 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 399 transitions. [2021-11-22 20:45:35,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-22 20:45:35,866 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:35,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:35,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 20:45:35,867 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:35,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:35,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1278595131, now seen corresponding path program 1 times [2021-11-22 20:45:35,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:35,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995864126] [2021-11-22 20:45:35,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:35,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:36,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:36,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995864126] [2021-11-22 20:45:36,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995864126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:36,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:36,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:45:36,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523364249] [2021-11-22 20:45:36,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:36,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:45:36,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:36,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:45:36,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:45:36,049 INFO L87 Difference]: Start difference. First operand 315 states and 399 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:36,197 INFO L93 Difference]: Finished difference Result 649 states and 811 transitions. [2021-11-22 20:45:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:45:36,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-22 20:45:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:36,199 INFO L225 Difference]: With dead ends: 649 [2021-11-22 20:45:36,199 INFO L226 Difference]: Without dead ends: 406 [2021-11-22 20:45:36,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:45:36,201 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 83 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:36,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 1074 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:45:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-11-22 20:45:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 315. [2021-11-22 20:45:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.2806451612903227) internal successors, (397), 314 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 397 transitions. [2021-11-22 20:45:36,212 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 397 transitions. Word has length 60 [2021-11-22 20:45:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:36,213 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 397 transitions. [2021-11-22 20:45:36,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 397 transitions. [2021-11-22 20:45:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 20:45:36,214 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:36,214 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:36,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 20:45:36,214 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:36,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:36,215 INFO L85 PathProgramCache]: Analyzing trace with hash 230333236, now seen corresponding path program 1 times [2021-11-22 20:45:36,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:36,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641277647] [2021-11-22 20:45:36,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:36,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:36,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:36,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641277647] [2021-11-22 20:45:36,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641277647] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:36,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:36,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:45:36,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818961726] [2021-11-22 20:45:36,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:36,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:45:36,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:36,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:45:36,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:36,341 INFO L87 Difference]: Start difference. First operand 315 states and 397 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:36,394 INFO L93 Difference]: Finished difference Result 606 states and 763 transitions. [2021-11-22 20:45:36,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:45:36,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-22 20:45:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:36,396 INFO L225 Difference]: With dead ends: 606 [2021-11-22 20:45:36,396 INFO L226 Difference]: Without dead ends: 345 [2021-11-22 20:45:36,397 INFO L932 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-11-22 20:45:36,397 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 19 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:36,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 445 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-11-22 20:45:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 315. [2021-11-22 20:45:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.261290322580645) internal successors, (391), 314 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 391 transitions. [2021-11-22 20:45:36,408 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 391 transitions. Word has length 62 [2021-11-22 20:45:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:36,408 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 391 transitions. [2021-11-22 20:45:36,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 391 transitions. [2021-11-22 20:45:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 20:45:36,410 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:36,410 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:36,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 20:45:36,410 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:36,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:36,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1734959216, now seen corresponding path program 1 times [2021-11-22 20:45:36,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:36,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900644219] [2021-11-22 20:45:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:36,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:36,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:36,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900644219] [2021-11-22 20:45:36,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900644219] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:36,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:36,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:45:36,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827518689] [2021-11-22 20:45:36,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:36,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:45:36,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:36,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:45:36,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:36,514 INFO L87 Difference]: Start difference. First operand 315 states and 391 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:36,562 INFO L93 Difference]: Finished difference Result 631 states and 773 transitions. [2021-11-22 20:45:36,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:45:36,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-22 20:45:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:36,564 INFO L225 Difference]: With dead ends: 631 [2021-11-22 20:45:36,564 INFO L226 Difference]: Without dead ends: 364 [2021-11-22 20:45:36,565 INFO L932 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-11-22 20:45:36,565 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 75 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:36,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 431 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-11-22 20:45:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 307. [2021-11-22 20:45:36,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 302 states have (on average 1.2317880794701987) internal successors, (372), 306 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 372 transitions. [2021-11-22 20:45:36,576 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 372 transitions. Word has length 62 [2021-11-22 20:45:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:36,576 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 372 transitions. [2021-11-22 20:45:36,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 372 transitions. [2021-11-22 20:45:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 20:45:36,578 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:36,578 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:36,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 20:45:36,578 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:36,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:36,579 INFO L85 PathProgramCache]: Analyzing trace with hash -314428626, now seen corresponding path program 1 times [2021-11-22 20:45:36,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:36,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031426926] [2021-11-22 20:45:36,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:36,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:36,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:36,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031426926] [2021-11-22 20:45:36,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031426926] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:36,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:36,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:45:36,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927747033] [2021-11-22 20:45:36,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:36,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:45:36,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:36,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:45:36,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:45:36,849 INFO L87 Difference]: Start difference. First operand 307 states and 372 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:37,432 INFO L93 Difference]: Finished difference Result 830 states and 975 transitions. [2021-11-22 20:45:37,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 20:45:37,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-22 20:45:37,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:37,438 INFO L225 Difference]: With dead ends: 830 [2021-11-22 20:45:37,438 INFO L226 Difference]: Without dead ends: 818 [2021-11-22 20:45:37,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2021-11-22 20:45:37,439 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 664 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:37,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [664 Valid, 941 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:45:37,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2021-11-22 20:45:37,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 525. [2021-11-22 20:45:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 520 states have (on average 1.25) internal successors, (650), 524 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 650 transitions. [2021-11-22 20:45:37,462 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 650 transitions. Word has length 62 [2021-11-22 20:45:37,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:37,463 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 650 transitions. [2021-11-22 20:45:37,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 650 transitions. [2021-11-22 20:45:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 20:45:37,464 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:37,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:37,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 20:45:37,465 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:37,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash -56263188, now seen corresponding path program 1 times [2021-11-22 20:45:37,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:37,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756789637] [2021-11-22 20:45:37,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:37,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:38,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:38,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756789637] [2021-11-22 20:45:38,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756789637] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:38,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:38,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 20:45:38,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826201023] [2021-11-22 20:45:38,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:38,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:45:38,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:38,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:45:38,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:45:38,120 INFO L87 Difference]: Start difference. First operand 525 states and 650 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:38,332 INFO L93 Difference]: Finished difference Result 694 states and 844 transitions. [2021-11-22 20:45:38,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 20:45:38,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-22 20:45:38,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:38,335 INFO L225 Difference]: With dead ends: 694 [2021-11-22 20:45:38,335 INFO L226 Difference]: Without dead ends: 678 [2021-11-22 20:45:38,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:45:38,336 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 390 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:38,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 510 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:45:38,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2021-11-22 20:45:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 302. [2021-11-22 20:45:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 297 states have (on average 1.228956228956229) internal successors, (365), 301 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 365 transitions. [2021-11-22 20:45:38,351 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 365 transitions. Word has length 62 [2021-11-22 20:45:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:38,351 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 365 transitions. [2021-11-22 20:45:38,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 365 transitions. [2021-11-22 20:45:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 20:45:38,352 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:38,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:38,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 20:45:38,353 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:38,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1747438808, now seen corresponding path program 1 times [2021-11-22 20:45:38,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:38,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476699112] [2021-11-22 20:45:38,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:38,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:39,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:39,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476699112] [2021-11-22 20:45:39,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476699112] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:39,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:39,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 20:45:39,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5196742] [2021-11-22 20:45:39,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:39,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 20:45:39,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:39,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 20:45:39,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-11-22 20:45:39,145 INFO L87 Difference]: Start difference. First operand 302 states and 365 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:39,569 INFO L93 Difference]: Finished difference Result 376 states and 449 transitions. [2021-11-22 20:45:39,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 20:45:39,570 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-22 20:45:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:39,572 INFO L225 Difference]: With dead ends: 376 [2021-11-22 20:45:39,572 INFO L226 Difference]: Without dead ends: 369 [2021-11-22 20:45:39,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-22 20:45:39,573 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 543 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:39,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [543 Valid, 776 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:45:39,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-11-22 20:45:39,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 302. [2021-11-22 20:45:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 297 states have (on average 1.2255892255892256) internal successors, (364), 301 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 364 transitions. [2021-11-22 20:45:39,595 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 364 transitions. Word has length 62 [2021-11-22 20:45:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:39,596 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 364 transitions. [2021-11-22 20:45:39,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 364 transitions. [2021-11-22 20:45:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 20:45:39,597 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:39,597 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:39,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 20:45:39,598 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:39,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:39,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1067380438, now seen corresponding path program 1 times [2021-11-22 20:45:39,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:39,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553018687] [2021-11-22 20:45:39,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:39,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:39,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:39,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:39,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553018687] [2021-11-22 20:45:39,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553018687] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:39,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:39,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:45:39,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447904247] [2021-11-22 20:45:39,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:39,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:45:39,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:39,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:45:39,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:45:39,749 INFO L87 Difference]: Start difference. First operand 302 states and 364 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:39,902 INFO L93 Difference]: Finished difference Result 488 states and 573 transitions. [2021-11-22 20:45:39,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:45:39,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-22 20:45:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:39,904 INFO L225 Difference]: With dead ends: 488 [2021-11-22 20:45:39,904 INFO L226 Difference]: Without dead ends: 380 [2021-11-22 20:45:39,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:45:39,904 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 218 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:39,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 348 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:45:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-11-22 20:45:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 300. [2021-11-22 20:45:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.2101694915254237) internal successors, (357), 299 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 357 transitions. [2021-11-22 20:45:39,918 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 357 transitions. Word has length 62 [2021-11-22 20:45:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:39,918 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 357 transitions. [2021-11-22 20:45:39,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 357 transitions. [2021-11-22 20:45:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 20:45:39,919 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:39,919 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:39,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 20:45:39,920 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:39,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1160615043, now seen corresponding path program 1 times [2021-11-22 20:45:39,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:39,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611101607] [2021-11-22 20:45:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:39,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:40,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:40,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611101607] [2021-11-22 20:45:40,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611101607] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:40,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:40,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:45:40,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995866588] [2021-11-22 20:45:40,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:40,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:45:40,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:40,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:45:40,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:45:40,070 INFO L87 Difference]: Start difference. First operand 300 states and 357 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:40,277 INFO L93 Difference]: Finished difference Result 462 states and 545 transitions. [2021-11-22 20:45:40,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 20:45:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-22 20:45:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:40,279 INFO L225 Difference]: With dead ends: 462 [2021-11-22 20:45:40,279 INFO L226 Difference]: Without dead ends: 454 [2021-11-22 20:45:40,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-11-22 20:45:40,280 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 124 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:40,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 1321 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:45:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-11-22 20:45:40,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 300. [2021-11-22 20:45:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.2067796610169492) internal successors, (356), 299 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:40,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 356 transitions. [2021-11-22 20:45:40,294 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 356 transitions. Word has length 64 [2021-11-22 20:45:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:40,294 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 356 transitions. [2021-11-22 20:45:40,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 356 transitions. [2021-11-22 20:45:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 20:45:40,295 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:40,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:40,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 20:45:40,297 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:40,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash 351268417, now seen corresponding path program 1 times [2021-11-22 20:45:40,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:40,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561477324] [2021-11-22 20:45:40,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:40,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:40,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:40,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561477324] [2021-11-22 20:45:40,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561477324] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:40,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:40,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-22 20:45:40,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348341277] [2021-11-22 20:45:40,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:40,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-22 20:45:40,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:40,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-22 20:45:40,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2021-11-22 20:45:40,879 INFO L87 Difference]: Start difference. First operand 300 states and 356 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:42,632 INFO L93 Difference]: Finished difference Result 936 states and 1097 transitions. [2021-11-22 20:45:42,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-22 20:45:42,633 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-22 20:45:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:42,636 INFO L225 Difference]: With dead ends: 936 [2021-11-22 20:45:42,636 INFO L226 Difference]: Without dead ends: 765 [2021-11-22 20:45:42,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=816, Invalid=2724, Unknown=0, NotChecked=0, Total=3540 [2021-11-22 20:45:42,638 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 1866 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:42,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1866 Valid, 2584 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 20:45:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-11-22 20:45:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 415. [2021-11-22 20:45:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.2146341463414634) internal successors, (498), 414 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 498 transitions. [2021-11-22 20:45:42,663 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 498 transitions. Word has length 64 [2021-11-22 20:45:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:42,663 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 498 transitions. [2021-11-22 20:45:42,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 498 transitions. [2021-11-22 20:45:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 20:45:42,665 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:42,665 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:42,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 20:45:42,665 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:42,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:42,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1723075715, now seen corresponding path program 1 times [2021-11-22 20:45:42,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:42,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620801714] [2021-11-22 20:45:42,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:42,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:42,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:42,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:42,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620801714] [2021-11-22 20:45:42,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620801714] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:42,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:42,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 20:45:42,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362251334] [2021-11-22 20:45:42,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:42,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 20:45:42,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:42,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 20:45:42,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:45:42,960 INFO L87 Difference]: Start difference. First operand 415 states and 498 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:43,429 INFO L93 Difference]: Finished difference Result 591 states and 686 transitions. [2021-11-22 20:45:43,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 20:45:43,430 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-22 20:45:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:43,431 INFO L225 Difference]: With dead ends: 591 [2021-11-22 20:45:43,431 INFO L226 Difference]: Without dead ends: 412 [2021-11-22 20:45:43,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-11-22 20:45:43,432 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 389 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:43,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 1169 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:45:43,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-11-22 20:45:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 161. [2021-11-22 20:45:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 157 states have (on average 1.197452229299363) internal successors, (188), 160 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions. [2021-11-22 20:45:43,443 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 64 [2021-11-22 20:45:43,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:43,443 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions. [2021-11-22 20:45:43,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,443 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2021-11-22 20:45:43,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-22 20:45:43,446 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:43,447 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:43,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 20:45:43,447 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:43,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash 253440774, now seen corresponding path program 1 times [2021-11-22 20:45:43,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:43,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243773759] [2021-11-22 20:45:43,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:43,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:43,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:43,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243773759] [2021-11-22 20:45:43,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243773759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:43,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:43,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:45:43,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689368703] [2021-11-22 20:45:43,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:43,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:45:43,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:43,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:45:43,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:43,561 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:43,580 INFO L93 Difference]: Finished difference Result 188 states and 217 transitions. [2021-11-22 20:45:43,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:45:43,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-22 20:45:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:43,581 INFO L225 Difference]: With dead ends: 188 [2021-11-22 20:45:43,581 INFO L226 Difference]: Without dead ends: 161 [2021-11-22 20:45:43,582 INFO L932 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-11-22 20:45:43,582 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:43,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 385 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:43,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-22 20:45:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 121. [2021-11-22 20:45:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 117 states have (on average 1.1794871794871795) internal successors, (138), 120 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2021-11-22 20:45:43,591 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 65 [2021-11-22 20:45:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:43,591 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2021-11-22 20:45:43,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2021-11-22 20:45:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 20:45:43,592 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:43,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:43,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 20:45:43,593 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:43,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1778581901, now seen corresponding path program 1 times [2021-11-22 20:45:43,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:43,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680432657] [2021-11-22 20:45:43,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:43,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:43,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:43,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680432657] [2021-11-22 20:45:43,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680432657] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:43,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:43,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:45:43,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874178044] [2021-11-22 20:45:43,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:43,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:45:43,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:43,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:45:43,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:45:43,738 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:43,819 INFO L93 Difference]: Finished difference Result 234 states and 268 transitions. [2021-11-22 20:45:43,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:45:43,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-22 20:45:43,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:43,821 INFO L225 Difference]: With dead ends: 234 [2021-11-22 20:45:43,821 INFO L226 Difference]: Without dead ends: 195 [2021-11-22 20:45:43,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:45:43,823 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 232 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:43,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 558 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-11-22 20:45:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 132. [2021-11-22 20:45:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 128 states have (on average 1.1796875) internal successors, (151), 131 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 151 transitions. [2021-11-22 20:45:43,831 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 151 transitions. Word has length 71 [2021-11-22 20:45:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:43,831 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 151 transitions. [2021-11-22 20:45:43,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2021-11-22 20:45:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 20:45:43,832 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:43,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:43,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 20:45:43,833 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:43,833 INFO L85 PathProgramCache]: Analyzing trace with hash 144646133, now seen corresponding path program 1 times [2021-11-22 20:45:43,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:43,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382342709] [2021-11-22 20:45:43,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:43,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:43,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:43,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382342709] [2021-11-22 20:45:43,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382342709] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:43,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:43,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:45:43,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195033794] [2021-11-22 20:45:43,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:43,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:45:43,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:43,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:45:43,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:43,953 INFO L87 Difference]: Start difference. First operand 132 states and 151 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:43,975 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2021-11-22 20:45:43,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:45:43,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-22 20:45:43,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:43,977 INFO L225 Difference]: With dead ends: 195 [2021-11-22 20:45:43,977 INFO L226 Difference]: Without dead ends: 121 [2021-11-22 20:45:43,977 INFO L932 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-11-22 20:45:43,978 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 65 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:43,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 409 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:43,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-22 20:45:43,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-11-22 20:45:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 117 states have (on average 1.1623931623931625) internal successors, (136), 120 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2021-11-22 20:45:43,985 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 71 [2021-11-22 20:45:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:43,985 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2021-11-22 20:45:43,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2021-11-22 20:45:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-22 20:45:43,986 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:43,986 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:43,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-22 20:45:43,986 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:43,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1578755209, now seen corresponding path program 1 times [2021-11-22 20:45:43,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:43,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55605292] [2021-11-22 20:45:43,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:43,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:44,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:44,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55605292] [2021-11-22 20:45:44,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55605292] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:44,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:44,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:45:44,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351575605] [2021-11-22 20:45:44,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:44,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:45:44,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:44,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:45:44,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:45:44,130 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:44,177 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2021-11-22 20:45:44,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:45:44,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-11-22 20:45:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:44,178 INFO L225 Difference]: With dead ends: 162 [2021-11-22 20:45:44,178 INFO L226 Difference]: Without dead ends: 121 [2021-11-22 20:45:44,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:45:44,180 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 226 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:44,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 277 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:44,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-22 20:45:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-11-22 20:45:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 117 states have (on average 1.1538461538461537) internal successors, (135), 120 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2021-11-22 20:45:44,186 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 74 [2021-11-22 20:45:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:44,187 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2021-11-22 20:45:44,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2021-11-22 20:45:44,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-22 20:45:44,187 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:44,188 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:44,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-22 20:45:44,188 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:44,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:44,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1434538548, now seen corresponding path program 1 times [2021-11-22 20:45:44,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:44,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431841222] [2021-11-22 20:45:44,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:44,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:44,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:44,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431841222] [2021-11-22 20:45:44,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431841222] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:44,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:44,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:45:44,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949815941] [2021-11-22 20:45:44,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:44,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:45:44,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:44,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:45:44,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:45:44,310 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:44,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:44,337 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2021-11-22 20:45:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:45:44,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-22 20:45:44,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:44,339 INFO L225 Difference]: With dead ends: 149 [2021-11-22 20:45:44,339 INFO L226 Difference]: Without dead ends: 121 [2021-11-22 20:45:44,339 INFO L932 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-11-22 20:45:44,340 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 3 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:44,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 494 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:44,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-22 20:45:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-11-22 20:45:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 117 states have (on average 1.1452991452991452) internal successors, (134), 120 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2021-11-22 20:45:44,349 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 80 [2021-11-22 20:45:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:44,349 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2021-11-22 20:45:44,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2021-11-22 20:45:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-22 20:45:44,353 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:44,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:44,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-22 20:45:44,354 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:44,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1115393557, now seen corresponding path program 1 times [2021-11-22 20:45:44,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:44,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730782133] [2021-11-22 20:45:44,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:44,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:44,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:44,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730782133] [2021-11-22 20:45:44,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730782133] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:44,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:44,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:45:44,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333510832] [2021-11-22 20:45:44,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:44,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:45:44,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:44,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:45:44,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:45:44,605 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:44,647 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2021-11-22 20:45:44,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:45:44,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-22 20:45:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:44,647 INFO L225 Difference]: With dead ends: 121 [2021-11-22 20:45:44,647 INFO L226 Difference]: Without dead ends: 0 [2021-11-22 20:45:44,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:45:44,648 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:44,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-22 20:45:44,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-22 20:45:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-22 20:45:44,649 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2021-11-22 20:45:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:44,649 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-22 20:45:44,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-22 20:45:44,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-22 20:45:44,652 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-22 20:45:44,653 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-22 20:45:44,653 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-22 20:45:44,653 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-22 20:45:44,653 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-22 20:45:44,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-22 20:45:44,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-22 20:47:15,120 WARN L227 SmtUtils]: Spent 1.43m on a formula simplification. DAG size of input: 212 DAG size of output: 208 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-22 20:49:13,964 WARN L227 SmtUtils]: Spent 1.98m on a formula simplification. DAG size of input: 215 DAG size of output: 211 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-22 20:49:17,111 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,111 INFO L858 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2021-11-22 20:49:17,111 INFO L854 garLoopResultBuilder]: At program point L6890(lines 6889 6891) the Hoare annotation is: false [2021-11-22 20:49:17,111 INFO L854 garLoopResultBuilder]: At program point L6890-1(lines 6889 6891) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2021-11-22 20:49:17,111 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-22 20:49:17,111 INFO L858 garLoopResultBuilder]: For program point L6610(lines 6610 6612) no Hoare annotation was computed. [2021-11-22 20:49:17,111 INFO L858 garLoopResultBuilder]: For program point L6610-2(lines 6610 6612) no Hoare annotation was computed. [2021-11-22 20:49:17,111 INFO L858 garLoopResultBuilder]: For program point L6810(lines 6810 6811) no Hoare annotation was computed. [2021-11-22 20:49:17,111 INFO L858 garLoopResultBuilder]: For program point L6810-2(lines 6810 6811) no Hoare annotation was computed. [2021-11-22 20:49:17,112 INFO L854 garLoopResultBuilder]: At program point L7703(lines 7684 7704) the Hoare annotation is: (let ((.cse13 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse11 (select .cse13 16))) (let ((.cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) 8) 0)) (.cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) 8) 0))) (.cse2 (<= .cse11 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse12 (select .cse13 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (+ .cse11 (* (div .cse12 18446744073709551616) 18446744073709551616) (* .cse12 (- 1)))) 18446744073709551616))))) (.cse4 (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0)) (.cse5 (<= .cse11 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse11) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse7 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|)) (.cse10 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_aws_string_eq_byte_buf_~buf#1.base|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res#1.base| 0)) .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_array_eq_#res#1| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_~str#1.base| 0)) (not .cse3) .cse4 .cse5 .cse6 (not (= |ULTIMATE.start_ensure_string_is_allocated_~str~0#1.base| 0)) .cse7 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res#1.base| 0)) .cse8 .cse9 .cse10 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ite1353#1.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|)) (and .cse3 .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))))) [2021-11-22 20:49:17,112 INFO L858 garLoopResultBuilder]: For program point L9388(line 9388) no Hoare annotation was computed. [2021-11-22 20:49:17,112 INFO L858 garLoopResultBuilder]: For program point L9388-2(line 9388) no Hoare annotation was computed. [2021-11-22 20:49:17,112 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:49:17,112 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:49:17,112 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:49:17,112 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:49:17,112 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:49:17,112 INFO L858 garLoopResultBuilder]: For program point L9389(line 9389) no Hoare annotation was computed. [2021-11-22 20:49:17,112 INFO L858 garLoopResultBuilder]: For program point L9389-2(line 9389) no Hoare annotation was computed. [2021-11-22 20:49:17,112 INFO L858 garLoopResultBuilder]: For program point L9538(lines 9538 9557) no Hoare annotation was computed. [2021-11-22 20:49:17,112 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-22 20:49:17,112 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,115 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,115 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,115 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,115 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,115 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,116 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,116 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,116 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,116 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,116 INFO L858 garLoopResultBuilder]: For program point L9390(lines 9390 9398) no Hoare annotation was computed. [2021-11-22 20:49:17,116 INFO L858 garLoopResultBuilder]: For program point L9539(lines 9539 9540) no Hoare annotation was computed. [2021-11-22 20:49:17,116 INFO L858 garLoopResultBuilder]: For program point L9539-2(lines 9539 9540) no Hoare annotation was computed. [2021-11-22 20:49:17,117 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,117 INFO L854 garLoopResultBuilder]: At program point L6600(lines 6598 6601) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2021-11-22 20:49:17,117 INFO L854 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: false [2021-11-22 20:49:17,117 INFO L854 garLoopResultBuilder]: At program point L9408(lines 9386 9409) the Hoare annotation is: (let ((.cse13 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse11 (select .cse13 16))) (let ((.cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) 8) 0)) (.cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) 8) 0))) (.cse2 (<= .cse11 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse12 (select .cse13 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (+ .cse11 (* (div .cse12 18446744073709551616) 18446744073709551616) (* .cse12 (- 1)))) 18446744073709551616))))) (.cse4 (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0)) (.cse5 (<= .cse11 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse11) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse7 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|)) (.cse10 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0))) (or (and (not (= |ULTIMATE.start_ensure_string_is_allocated_#res#1.base| 0)) .cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_#res#1| 0) .cse1 .cse2 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_~str#1.base| 0)) (not .cse3) .cse4 .cse5 .cse6 (not (= |ULTIMATE.start_ensure_string_is_allocated_~str~0#1.base| 0)) .cse7 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res#1.base| 0)) .cse8 .cse9 .cse10) (and .cse3 .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))))) [2021-11-22 20:49:17,118 INFO L858 garLoopResultBuilder]: For program point L7691(lines 7691 7695) no Hoare annotation was computed. [2021-11-22 20:49:17,119 INFO L858 garLoopResultBuilder]: For program point L7361-3(line 7361) no Hoare annotation was computed. [2021-11-22 20:49:17,119 INFO L858 garLoopResultBuilder]: For program point L7361-1(line 7361) no Hoare annotation was computed. [2021-11-22 20:49:17,119 INFO L858 garLoopResultBuilder]: For program point L7361(lines 7361 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,119 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,119 INFO L858 garLoopResultBuilder]: For program point L7361-7(lines 7361 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,120 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-22 20:49:17,120 INFO L858 garLoopResultBuilder]: For program point L7361-6(lines 7361 7362) no Hoare annotation was computed. [2021-11-22 20:49:17,120 INFO L858 garLoopResultBuilder]: For program point L7361-4(lines 7361 7362) no Hoare annotation was computed. [2021-11-22 20:49:17,120 INFO L858 garLoopResultBuilder]: For program point L7361-11(lines 7361 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,120 INFO L858 garLoopResultBuilder]: For program point L7361-9(lines 7361 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,120 INFO L858 garLoopResultBuilder]: For program point L7361-14(line 7361) no Hoare annotation was computed. [2021-11-22 20:49:17,120 INFO L858 garLoopResultBuilder]: For program point L7361-13(lines 7361 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,120 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:49:17,121 INFO L854 garLoopResultBuilder]: At program point L7361-12(lines 7359 7365) the Hoare annotation is: (let ((.cse15 (+ 8 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (let ((.cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) 8) 0))) (.cse3 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|)) (.cse11 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 0)) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse5 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse15) 0))) (.cse7 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0)) (.cse8 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|)) (.cse10 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (not (= |ULTIMATE.start_ensure_string_is_allocated_#res#1.base| 0)) .cse1 (not .cse0) .cse3 .cse4 (not (= |ULTIMATE.start_ensure_string_is_allocated_~str~0#1.base| 0)) .cse5 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res#1.base| 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse14 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|))) (let ((.cse12 (select .cse14 (+ 16 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)))) (and .cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse2 (<= .cse12 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse13 (select .cse14 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (+ (* .cse13 (- 1)) .cse12 (* (div .cse13 18446744073709551616) 18446744073709551616))) 18446744073709551616)))) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse15) 0) .cse4 .cse5 .cse6 .cse7 (<= .cse12 (+ (* 18446744073709551616 (div (+ (- 1) .cse12) 18446744073709551616)) 18446744073709551615)) .cse8 .cse9 .cse10)))))) [2021-11-22 20:49:17,121 INFO L861 garLoopResultBuilder]: At program point L9558(line 9558) the Hoare annotation is: true [2021-11-22 20:49:17,121 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:49:17,121 INFO L858 garLoopResultBuilder]: For program point L7361-19(lines 7361 7362) no Hoare annotation was computed. [2021-11-22 20:49:17,121 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:49:17,121 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:49:17,121 INFO L858 garLoopResultBuilder]: For program point L7361-17(lines 7361 7362) no Hoare annotation was computed. [2021-11-22 20:49:17,122 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:49:17,122 INFO L858 garLoopResultBuilder]: For program point L7361-16(line 7361) no Hoare annotation was computed. [2021-11-22 20:49:17,123 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:49:17,123 INFO L858 garLoopResultBuilder]: For program point L7361-22(lines 7361 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,123 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:49:17,123 INFO L858 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:49:17,124 INFO L858 garLoopResultBuilder]: For program point L7361-20(lines 7361 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,124 INFO L858 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:49:17,124 INFO L858 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:49:17,124 INFO L858 garLoopResultBuilder]: For program point L7361-27(line 7361) no Hoare annotation was computed. [2021-11-22 20:49:17,124 INFO L858 garLoopResultBuilder]: For program point L7361-26(lines 7361 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,125 INFO L854 garLoopResultBuilder]: At program point L7361-25(lines 7359 7365) the Hoare annotation is: (let ((.cse13 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse11 (select .cse13 16))) (let ((.cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) 8) 0)) (.cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) 8) 0))) (.cse2 (<= .cse11 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse12 (select .cse13 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (+ .cse11 (* (div .cse12 18446744073709551616) 18446744073709551616) (* .cse12 (- 1)))) 18446744073709551616))))) (.cse4 (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0)) (.cse5 (<= .cse11 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse11) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse7 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|)) (.cse10 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0))) (or (and (not (= |ULTIMATE.start_ensure_string_is_allocated_#res#1.base| 0)) .cse0 (not |ULTIMATE.start_aws_string_eq_byte_buf_#t~short1308#1|) .cse1 .cse2 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_~str#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_~buf#1.offset| 0) (not .cse3) .cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_~buf#1.base| 0) .cse5 .cse6 (not (= |ULTIMATE.start_ensure_string_is_allocated_~str~0#1.base| 0)) .cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ite1353#1.base| 0) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ite1353#1.offset| 0) .cse8 .cse9 .cse10) (and .cse3 .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))))) [2021-11-22 20:49:17,125 INFO L858 garLoopResultBuilder]: For program point L7361-24(lines 7361 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,125 INFO L858 garLoopResultBuilder]: For program point L7361-30(lines 7361 7362) no Hoare annotation was computed. [2021-11-22 20:49:17,125 INFO L858 garLoopResultBuilder]: For program point L7361-29(line 7361) no Hoare annotation was computed. [2021-11-22 20:49:17,125 INFO L858 garLoopResultBuilder]: For program point L7361-35(lines 7361 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,125 INFO L858 garLoopResultBuilder]: For program point L7361-33(lines 7361 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,125 INFO L858 garLoopResultBuilder]: For program point L7361-32(lines 7361 7362) no Hoare annotation was computed. [2021-11-22 20:49:17,125 INFO L854 garLoopResultBuilder]: At program point L7361-38(lines 7359 7365) the Hoare annotation is: (and (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1) (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) [2021-11-22 20:49:17,125 INFO L858 garLoopResultBuilder]: For program point L7361-37(lines 7361 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,125 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,125 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-22 20:49:17,125 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-22 20:49:17,125 INFO L858 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2021-11-22 20:49:17,126 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-22 20:49:17,126 INFO L858 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2021-11-22 20:49:17,126 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-22 20:49:17,126 INFO L858 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2021-11-22 20:49:17,126 INFO L854 garLoopResultBuilder]: At program point L6256-6(lines 6252 6257) the Hoare annotation is: (let ((.cse16 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|))) (let ((.cse14 (+ 8 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) (.cse13 (select .cse16 (+ 16 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)))) (let ((.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse1 (<= .cse13 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse15 (select .cse16 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (+ (* .cse15 (- 1)) .cse13 (* (div .cse15 18446744073709551616) 18446744073709551616))) 18446744073709551616))))) (.cse3 (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0)) (.cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse14) 0)) (.cse5 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (not |ULTIMATE.start_aws_string_eq_byte_buf_#t~short1306#1|)) (.cse8 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse14) 0))) (.cse9 (<= .cse13 (+ (* 18446744073709551616 (div (+ (- 1) .cse13) 18446744073709551616)) 18446744073709551615))) (.cse10 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) (.cse11 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|)) (.cse12 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0))) (or (and (not (= |ULTIMATE.start_ensure_string_is_allocated_#res#1.base| 0)) .cse0 .cse1 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_~str#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_~buf#1.offset| 0) (not .cse2) .cse3 .cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_~buf#1.base| 0) .cse5 (not (= |ULTIMATE.start_ensure_string_is_allocated_~str~0#1.base| 0)) .cse6 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ite1353#1.base| 0) .cse7 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res#1.base| 0)) .cse8 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ite1353#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|) .cse9 .cse10 .cse11 .cse12) (and .cse2 .cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) .cse9 .cse10 .cse11 .cse12))))) [2021-11-22 20:49:17,126 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-22 20:49:17,126 INFO L858 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2021-11-22 20:49:17,126 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-22 20:49:17,126 INFO L858 garLoopResultBuilder]: For program point L6256-9(line 6256) no Hoare annotation was computed. [2021-11-22 20:49:17,126 INFO L858 garLoopResultBuilder]: For program point L6256-10(line 6256) no Hoare annotation was computed. [2021-11-22 20:49:17,126 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-22 20:49:17,126 INFO L858 garLoopResultBuilder]: For program point L6256-7(line 6256) no Hoare annotation was computed. [2021-11-22 20:49:17,127 INFO L861 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: true [2021-11-22 20:49:17,127 INFO L858 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-22 20:49:17,127 INFO L854 garLoopResultBuilder]: At program point L6256-13(lines 6252 6257) the Hoare annotation is: false [2021-11-22 20:49:17,127 INFO L854 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-11-22 20:49:17,127 INFO L854 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2021-11-22 20:49:17,127 INFO L858 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-22 20:49:17,127 INFO L854 garLoopResultBuilder]: At program point L261-3(line 261) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|))) (let ((.cse3 (+ 8 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) (.cse0 (select .cse2 (+ 16 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (+ (* .cse1 (- 1)) .cse0 (* (div .cse1 18446744073709551616) 18446744073709551616))) 18446744073709551616)))) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse3) 0) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse3) 0)) (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 18446744073709551615)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2021-11-22 20:49:17,127 INFO L858 garLoopResultBuilder]: For program point L6256-12(line 6256) no Hoare annotation was computed. [2021-11-22 20:49:17,127 INFO L858 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7364-2(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7364(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7364-6(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7364-4(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7364-3(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7364-9(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7364-8(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7364-13(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7364-12(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7364-11(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7364-18(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L854 garLoopResultBuilder]: At program point L6803(lines 6800 6804) the Hoare annotation is: false [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7364-17(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7364-15(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,128 INFO L858 garLoopResultBuilder]: For program point L7364-22(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,129 INFO L858 garLoopResultBuilder]: For program point L7364-21(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,129 INFO L858 garLoopResultBuilder]: For program point L7364-20(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,129 INFO L858 garLoopResultBuilder]: For program point L7364-26(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,129 INFO L858 garLoopResultBuilder]: For program point L7364-24(line 7364) no Hoare annotation was computed. [2021-11-22 20:49:17,129 INFO L854 garLoopResultBuilder]: At program point L6886(lines 6882 6887) the Hoare annotation is: false [2021-11-22 20:49:17,129 INFO L854 garLoopResultBuilder]: At program point L6886-1(lines 6882 6887) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2021-11-22 20:49:17,129 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-22 20:49:17,129 INFO L858 garLoopResultBuilder]: For program point L7101(lines 7101 7111) no Hoare annotation was computed. [2021-11-22 20:49:17,129 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:49:17,129 INFO L858 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2021-11-22 20:49:17,129 INFO L858 garLoopResultBuilder]: For program point L9399(lines 9399 9407) no Hoare annotation was computed. [2021-11-22 20:49:17,129 INFO L858 garLoopResultBuilder]: For program point L9548(lines 9548 9549) no Hoare annotation was computed. [2021-11-22 20:49:17,129 INFO L858 garLoopResultBuilder]: For program point L9548-2(lines 9548 9549) no Hoare annotation was computed. [2021-11-22 20:49:17,129 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (= 16 |ULTIMATE.start_ensure_string_is_allocated_bounded_length_~max_size#1|) [2021-11-22 20:49:17,129 INFO L854 garLoopResultBuilder]: At program point L266-1(line 266) the Hoare annotation is: false [2021-11-22 20:49:17,129 INFO L858 garLoopResultBuilder]: For program point L9548-3(lines 9548 9554) no Hoare annotation was computed. [2021-11-22 20:49:17,129 INFO L858 garLoopResultBuilder]: For program point L9548-5(lines 9548 9554) no Hoare annotation was computed. [2021-11-22 20:49:17,132 INFO L732 BasicCegarLoop]: Path program 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-11-22 20:49:17,133 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 20:49:17,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,165 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,167 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,167 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,168 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,168 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,169 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,173 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,174 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,175 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,180 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,182 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,183 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,183 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,184 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,186 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,187 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,190 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,191 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,191 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,191 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,191 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,196 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,196 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,197 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,197 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,197 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,198 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,198 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,198 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,203 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,203 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,204 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,207 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,207 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,207 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 08:49:17 BoogieIcfgContainer [2021-11-22 20:49:17,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 20:49:17,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 20:49:17,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 20:49:17,209 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 20:49:17,210 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:45:31" (3/4) ... [2021-11-22 20:49:17,212 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-22 20:49:17,237 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 160 nodes and edges [2021-11-22 20:49:17,238 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2021-11-22 20:49:17,240 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-11-22 20:49:17,242 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-22 20:49:17,243 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-11-22 20:49:17,244 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-22 20:49:17,245 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-22 20:49:17,247 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-22 20:49:17,276 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((str == 0 && #memory_$Pointer$[buf][8] == 0) && str == 0) && \result == 0) && !(\result == 0)) && !(buf == 0)) && buf == 0) && buf == buf) && buf == 0 [2021-11-22 20:49:17,277 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((str == 0 && !(#memory_$Pointer$[buf][8] == 0)) && str == 0) && 0 <= \result) && !(\result == 0)) && !(buf == 0)) && !(#memory_$Pointer$[buf][8 + buf] == 0)) && buf == 0) && buf == 0) && buf == buf) && buf == 0) && \result <= 0) || (((((((((((((!(\result == 0) && !(#memory_$Pointer$[buf][8] == 0)) && !(str == 0)) && 0 <= \result) && !(\result == 0)) && !(str == 0)) && !(buf == 0)) && !(\result == 0)) && !(#memory_$Pointer$[buf][8 + buf] == 0)) && buf == 0) && buf == 0) && buf == buf) && buf == 0) && \result <= 0)) || (((((((((((((str == 0 && buf == buf) && str == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][buf] * -1 + unknown-#memory_int-unknown[buf][16 + buf] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616) / 18446744073709551616)) && \result == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && !(\result == 0)) && !(buf == 0)) && !(#memory_$Pointer$[buf][8 + buf] == 0)) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 18446744073709551615) && buf == 0) && buf == buf) && buf == 0) [2021-11-22 20:49:17,277 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((str == 0 && buf == buf) && str == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][buf] * -1 + unknown-#memory_int-unknown[buf][16 + buf] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616) / 18446744073709551616)) && \result == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && !(\result == 0)) && !(buf == 0)) && !(#memory_$Pointer$[buf][8 + buf] == 0)) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 18446744073709551615) && buf == 0) && buf == buf) && buf == 0 [2021-11-22 20:49:17,278 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(\result == 0) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][buf] * -1 + unknown-#memory_int-unknown[buf][16 + buf] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616) / 18446744073709551616)) && !(str == 0)) && buf == 0) && !(str == 0)) && \result == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && buf == 0) && !(\result == 0)) && !(str == 0)) && !(buf == 0)) && nondet_bool() ? &buf : ((void *)0) == 0) && !aux-!str || aws_string_is_valid(str)-aux) && !(\result == 0)) && !(#memory_$Pointer$[buf][8 + buf] == 0)) && nondet_bool() ? &buf : ((void *)0) == 0) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 18446744073709551615) && buf == 0) && buf == buf) && buf == 0) || ((((((((((((((str == 0 && buf == buf) && str == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][buf] * -1 + unknown-#memory_int-unknown[buf][16 + buf] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616) / 18446744073709551616)) && \result == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && !(\result == 0)) && !(buf == 0)) && !aux-!str || aws_string_is_valid(str)-aux) && !(#memory_$Pointer$[buf][8 + buf] == 0)) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 18446744073709551615) && buf == 0) && buf == buf) && buf == 0) [2021-11-22 20:49:17,278 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(\result == 0) && #memory_$Pointer$[buf][8] == 0) && \result == 0) && !(#memory_$Pointer$[buf][8] == 0)) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][16] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][buf] * -1) / 18446744073709551616)) && !(str == 0)) && !(str == 0)) && \result == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(\result == 0)) && !(str == 0)) && !(buf == 0)) && !(\result == 0)) && buf == 0) && buf == buf) && buf == 0) || (((((((((((str == 0 && #memory_$Pointer$[buf][8] == 0) && !(#memory_$Pointer$[buf][8] == 0)) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][16] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][buf] * -1) / 18446744073709551616)) && str == 0) && \result == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(\result == 0)) && !(buf == 0)) && buf == 0) && buf == buf) && buf == 0) [2021-11-22 20:49:17,278 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(\result == 0) && #memory_$Pointer$[buf][8] == 0) && !aux-!buf || aws_byte_buf_is_valid(buf)-aux) && !(#memory_$Pointer$[buf][8] == 0)) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][16] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][buf] * -1) / 18446744073709551616)) && !(str == 0)) && buf == 0) && !(str == 0)) && \result == 0) && buf == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(\result == 0)) && !(str == 0)) && !(buf == 0)) && nondet_bool() ? &buf : ((void *)0) == 0) && !(\result == 0)) && nondet_bool() ? &buf : ((void *)0) == 0) && buf == 0) && buf == buf) && buf == 0) || (((((((((((str == 0 && #memory_$Pointer$[buf][8] == 0) && !(#memory_$Pointer$[buf][8] == 0)) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][16] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][buf] * -1) / 18446744073709551616)) && str == 0) && \result == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(\result == 0)) && !(buf == 0)) && buf == 0) && buf == buf) && buf == 0) [2021-11-22 20:49:17,278 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((buf == buf && !(\result == 0)) && #memory_$Pointer$[buf][8] == 0) && !(#memory_$Pointer$[buf][8] == 0)) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][16] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][buf] * -1) / 18446744073709551616)) && \result == 0) && !(str == 0)) && !(str == 0)) && \result == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(\result == 0)) && !(str == 0)) && !(buf == 0)) && !(\result == 0)) && buf == 0) && buf == buf) && buf == 0) && nondet_bool() ? &buf : ((void *)0) == buf) || (((((((((((str == 0 && #memory_$Pointer$[buf][8] == 0) && !(#memory_$Pointer$[buf][8] == 0)) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][16] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][buf] * -1) / 18446744073709551616)) && str == 0) && \result == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(\result == 0)) && !(buf == 0)) && buf == 0) && buf == buf) && buf == 0) [2021-11-22 20:49:17,279 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result <= 1 && 1 <= \result) && !(buf == 0) [2021-11-22 20:49:17,918 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-22 20:49:17,919 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 20:49:17,919 INFO L158 Benchmark]: Toolchain (without parser) took 229999.91ms. Allocated memory was 102.8MB in the beginning and 503.3MB in the end (delta: 400.6MB). Free memory was 63.6MB in the beginning and 401.9MB in the end (delta: -338.2MB). Peak memory consumption was 339.0MB. Max. memory is 16.1GB. [2021-11-22 20:49:17,920 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 102.8MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 20:49:17,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2030.47ms. Allocated memory was 102.8MB in the beginning and 182.5MB in the end (delta: 79.7MB). Free memory was 63.2MB in the beginning and 94.3MB in the end (delta: -31.1MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2021-11-22 20:49:17,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 188.51ms. Allocated memory is still 182.5MB. Free memory was 94.0MB in the beginning and 127.3MB in the end (delta: -33.3MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2021-11-22 20:49:17,920 INFO L158 Benchmark]: Boogie Preprocessor took 101.87ms. Allocated memory is still 182.5MB. Free memory was 127.3MB in the beginning and 120.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-22 20:49:17,921 INFO L158 Benchmark]: RCFGBuilder took 1313.27ms. Allocated memory is still 182.5MB. Free memory was 120.0MB in the beginning and 85.8MB in the end (delta: 34.2MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2021-11-22 20:49:17,921 INFO L158 Benchmark]: TraceAbstraction took 225648.65ms. Allocated memory was 182.5MB in the beginning and 503.3MB in the end (delta: 320.9MB). Free memory was 85.8MB in the beginning and 336.2MB in the end (delta: -250.3MB). Peak memory consumption was 273.9MB. Max. memory is 16.1GB. [2021-11-22 20:49:17,921 INFO L158 Benchmark]: Witness Printer took 709.60ms. Allocated memory is still 503.3MB. Free memory was 336.2MB in the beginning and 401.9MB in the end (delta: -65.7MB). Peak memory consumption was 211.1MB. Max. memory is 16.1GB. [2021-11-22 20:49:17,922 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 102.8MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2030.47ms. Allocated memory was 102.8MB in the beginning and 182.5MB in the end (delta: 79.7MB). Free memory was 63.2MB in the beginning and 94.3MB in the end (delta: -31.1MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 188.51ms. Allocated memory is still 182.5MB. Free memory was 94.0MB in the beginning and 127.3MB in the end (delta: -33.3MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.87ms. Allocated memory is still 182.5MB. Free memory was 127.3MB in the beginning and 120.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1313.27ms. Allocated memory is still 182.5MB. Free memory was 120.0MB in the beginning and 85.8MB in the end (delta: 34.2MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * TraceAbstraction took 225648.65ms. Allocated memory was 182.5MB in the beginning and 503.3MB in the end (delta: 320.9MB). Free memory was 85.8MB in the beginning and 336.2MB in the end (delta: -250.3MB). Peak memory consumption was 273.9MB. Max. memory is 16.1GB. * Witness Printer took 709.60ms. Allocated memory is still 503.3MB. Free memory was 336.2MB in the beginning and 401.9MB in the end (delta: -65.7MB). Peak memory consumption was 211.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 225.5s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 212.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9090 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9090 mSDsluCounter, 18871 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14521 mSDsCounter, 410 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3065 IncrementalHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 410 mSolverCounterUnsat, 4350 mSDtfsCounter, 3065 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=525occurred in iteration=14, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 2540 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 60 NumberOfFragments, 1369 HoareAnnotationTreeSize, 21 FomulaSimplifications, 3079549 FormulaSimplificationTreeSizeReduction, 209.3s HoareSimplificationTime, 21 FomulaSimplificationsInter, 5005102 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1547 NumberOfCodeBlocks, 1547 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1521 ConstructedInterpolants, 0 QuantifiedInterpolants, 7353 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 7359]: Loop Invariant [2021-11-22 20:49:17,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((str == 0 && !(#memory_$Pointer$[buf][8] == 0)) && str == 0) && 0 <= \result) && !(\result == 0)) && !(buf == 0)) && !(#memory_$Pointer$[buf][8 + buf] == 0)) && buf == 0) && buf == 0) && buf == buf) && buf == 0) && \result <= 0) || (((((((((((((!(\result == 0) && !(#memory_$Pointer$[buf][8] == 0)) && !(str == 0)) && 0 <= \result) && !(\result == 0)) && !(str == 0)) && !(buf == 0)) && !(\result == 0)) && !(#memory_$Pointer$[buf][8 + buf] == 0)) && buf == 0) && buf == 0) && buf == buf) && buf == 0) && \result <= 0)) || (((((((((((((str == 0 && buf == buf) && str == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][buf] * -1 + unknown-#memory_int-unknown[buf][16 + buf] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616) / 18446744073709551616)) && \result == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && !(\result == 0)) && !(buf == 0)) && !(#memory_$Pointer$[buf][8 + buf] == 0)) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 18446744073709551615) && buf == 0) && buf == buf) && buf == 0) - InvariantResult [Line: 9558]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7359]: Loop Invariant [2021-11-22 20:49:17,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,957 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,957 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((!(\result == 0) && #memory_$Pointer$[buf][8] == 0) && !aux-!buf || aws_byte_buf_is_valid(buf)-aux) && !(#memory_$Pointer$[buf][8] == 0)) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][16] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][buf] * -1) / 18446744073709551616)) && !(str == 0)) && buf == 0) && !(str == 0)) && \result == 0) && buf == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(\result == 0)) && !(str == 0)) && !(buf == 0)) && nondet_bool() ? &buf : ((void *)0) == 0) && !(\result == 0)) && nondet_bool() ? &buf : ((void *)0) == 0) && buf == 0) && buf == buf) && buf == 0) || (((((((((((str == 0 && #memory_$Pointer$[buf][8] == 0) && !(#memory_$Pointer$[buf][8] == 0)) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][16] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][buf] * -1) / 18446744073709551616)) && str == 0) && \result == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(\result == 0)) && !(buf == 0)) && buf == 0) && buf == buf) && buf == 0) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6252]: Loop Invariant [2021-11-22 20:49:17,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,961 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,962 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((!(\result == 0) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][buf] * -1 + unknown-#memory_int-unknown[buf][16 + buf] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616) / 18446744073709551616)) && !(str == 0)) && buf == 0) && !(str == 0)) && \result == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && buf == 0) && !(\result == 0)) && !(str == 0)) && !(buf == 0)) && nondet_bool() ? &buf : ((void *)0) == 0) && !aux-!str || aws_string_is_valid(str)-aux) && !(\result == 0)) && !(#memory_$Pointer$[buf][8 + buf] == 0)) && nondet_bool() ? &buf : ((void *)0) == 0) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 18446744073709551615) && buf == 0) && buf == buf) && buf == 0) || ((((((((((((((str == 0 && buf == buf) && str == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][buf] * -1 + unknown-#memory_int-unknown[buf][16 + buf] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616) / 18446744073709551616)) && \result == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && !(\result == 0)) && !(buf == 0)) && !aux-!str || aws_string_is_valid(str)-aux) && !(#memory_$Pointer$[buf][8 + buf] == 0)) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 18446744073709551615) && buf == 0) && buf == buf) && buf == 0) - InvariantResult [Line: 6252]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6800]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6882]: Loop Invariant [2021-11-22 20:49:17,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((str == 0 && #memory_$Pointer$[buf][8] == 0) && str == 0) && \result == 0) && !(\result == 0)) && !(buf == 0)) && buf == 0) && buf == buf) && buf == 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6598]: Loop Invariant [2021-11-22 20:49:17,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((str == 0 && #memory_$Pointer$[buf][8] == 0) && str == 0) && !(buf == 0)) && buf == 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 16 == max_size - InvariantResult [Line: 7684]: Loop Invariant [2021-11-22 20:49:17,968 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,968 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,968 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,969 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((buf == buf && !(\result == 0)) && #memory_$Pointer$[buf][8] == 0) && !(#memory_$Pointer$[buf][8] == 0)) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][16] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][buf] * -1) / 18446744073709551616)) && \result == 0) && !(str == 0)) && !(str == 0)) && \result == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(\result == 0)) && !(str == 0)) && !(buf == 0)) && !(\result == 0)) && buf == 0) && buf == buf) && buf == 0) && nondet_bool() ? &buf : ((void *)0) == buf) || (((((((((((str == 0 && #memory_$Pointer$[buf][8] == 0) && !(#memory_$Pointer$[buf][8] == 0)) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][16] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][buf] * -1) / 18446744073709551616)) && str == 0) && \result == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(\result == 0)) && !(buf == 0)) && buf == 0) && buf == buf) && buf == 0) - InvariantResult [Line: 6889]: Loop Invariant [2021-11-22 20:49:17,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((str == 0 && #memory_$Pointer$[buf][8] == 0) && str == 0) && !(buf == 0)) && buf == 0) && buf == buf) && buf == 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6889]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant [2021-11-22 20:49:17,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((str == 0 && buf == buf) && str == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][buf] * -1 + unknown-#memory_int-unknown[buf][16 + buf] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616) / 18446744073709551616)) && \result == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && !(\result == 0)) && !(buf == 0)) && !(#memory_$Pointer$[buf][8 + buf] == 0)) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 18446744073709551615) && buf == 0) && buf == buf) && buf == 0 - InvariantResult [Line: 7359]: Loop Invariant Derived loop invariant: (\result <= 1 && 1 <= \result) && !(buf == 0) - InvariantResult [Line: 261]: Loop Invariant [2021-11-22 20:49:17,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((str == 0 && #memory_$Pointer$[buf][8] == 0) && str == 0) && !(buf == 0)) && buf == 0) && buf == buf) && buf == 0 - InvariantResult [Line: 9386]: Loop Invariant [2021-11-22 20:49:17,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,978 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:49:17,978 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:49:17,978 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((!(\result == 0) && #memory_$Pointer$[buf][8] == 0) && \result == 0) && !(#memory_$Pointer$[buf][8] == 0)) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][16] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][buf] * -1) / 18446744073709551616)) && !(str == 0)) && !(str == 0)) && \result == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(\result == 0)) && !(str == 0)) && !(buf == 0)) && !(\result == 0)) && buf == 0) && buf == buf) && buf == 0) || (((((((((((str == 0 && #memory_$Pointer$[buf][8] == 0) && !(#memory_$Pointer$[buf][8] == 0)) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][16] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][buf] * -1) / 18446744073709551616)) && str == 0) && \result == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(\result == 0)) && !(buf == 0)) && buf == 0) && buf == buf) && buf == 0) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-11-22 20:49:17,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE