./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 0f8a17c6 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-0f8a17c [2021-11-16 21:54:41,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 21:54:41,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 21:54:41,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 21:54:41,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 21:54:41,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 21:54:41,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 21:54:41,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 21:54:41,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 21:54:41,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 21:54:41,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 21:54:41,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 21:54:41,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 21:54:41,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 21:54:41,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 21:54:41,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 21:54:41,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 21:54:41,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 21:54:41,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 21:54:41,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 21:54:41,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 21:54:41,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 21:54:41,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 21:54:41,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 21:54:41,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 21:54:41,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 21:54:41,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 21:54:41,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 21:54:41,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 21:54:41,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 21:54:41,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 21:54:41,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 21:54:41,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 21:54:41,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 21:54:41,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 21:54:41,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 21:54:41,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 21:54:41,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 21:54:41,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 21:54:41,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 21:54:41,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 21:54:41,542 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 21:54:41,578 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 21:54:41,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 21:54:41,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 21:54:41,579 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 21:54:41,579 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 21:54:41,579 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 21:54:41,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 21:54:41,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 21:54:41,580 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 21:54:41,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 21:54:41,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 21:54:41,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 21:54:41,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 21:54:41,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 21:54:41,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 21:54:41,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 21:54:41,581 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 21:54:41,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 21:54:41,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 21:54:41,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 21:54:41,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 21:54:41,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:54:41,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 21:54:41,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 21:54:41,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 21:54:41,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 21:54:41,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 21:54:41,587 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 21:54:41,587 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 21:54:41,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 21:54:41,587 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 21:54:41,587 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-16 21:54:41,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 21:54:41,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 21:54:41,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 21:54:41,787 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 21:54:41,787 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 21:54:41,789 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-16 21:54:41,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3eadcb2/82056877821b48a0af429b1ff7c45aeb/FLAG9d99b1956 [2021-11-16 21:54:42,450 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 21:54:42,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2021-11-16 21:54:42,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3eadcb2/82056877821b48a0af429b1ff7c45aeb/FLAG9d99b1956 [2021-11-16 21:54:42,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3eadcb2/82056877821b48a0af429b1ff7c45aeb [2021-11-16 21:54:42,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 21:54:42,882 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 21:54:42,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 21:54:42,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 21:54:42,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 21:54:42,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:54:42" (1/1) ... [2021-11-16 21:54:42,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52115f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:54:42, skipping insertion in model container [2021-11-16 21:54:42,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:54:42" (1/1) ... [2021-11-16 21:54:42,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 21:54:42,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 21:54:43,215 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-16 21:54:43,221 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-16 21:54:43,243 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:54:43,248 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:54:43,963 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:43,965 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:43,966 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:43,967 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:43,967 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:43,976 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:43,979 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:43,981 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:43,981 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:44,173 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:54:44,174 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:54:44,175 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:54:44,176 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:54:44,177 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:54:44,177 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:54:44,177 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:54:44,178 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:54:44,178 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:54:44,179 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:54:44,273 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:54:44,347 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:44,348 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:44,426 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:54:44,462 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 21:54:44,477 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-16 21:54:44,477 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-16 21:54:44,478 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:54:44,479 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:54:44,523 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:44,523 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:44,524 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:44,524 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:44,524 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:44,529 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:44,529 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:44,530 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:44,530 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:44,550 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:54:44,551 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:54:44,551 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:54:44,551 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:54:44,552 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:54:44,552 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:54:44,553 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:54:44,553 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:54:44,553 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:54:44,554 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:54:44,575 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:54:44,642 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:44,643 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:54:44,677 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:54:44,834 INFO L208 MainTranslator]: Completed translation [2021-11-16 21:54:44,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:54:44 WrapperNode [2021-11-16 21:54:44,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 21:54:44,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 21:54:44,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 21:54:44,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 21:54:44,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:54:44" (1/1) ... [2021-11-16 21:54:44,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:54:44" (1/1) ... [2021-11-16 21:54:45,012 INFO L137 Inliner]: procedures = 695, calls = 2794, calls flagged for inlining = 61, calls inlined = 8, statements flattened = 874 [2021-11-16 21:54:45,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 21:54:45,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 21:54:45,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 21:54:45,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 21:54:45,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:54:44" (1/1) ... [2021-11-16 21:54:45,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:54:44" (1/1) ... [2021-11-16 21:54:45,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:54:44" (1/1) ... [2021-11-16 21:54:45,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:54:44" (1/1) ... [2021-11-16 21:54:45,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:54:44" (1/1) ... [2021-11-16 21:54:45,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:54:44" (1/1) ... [2021-11-16 21:54:45,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:54:44" (1/1) ... [2021-11-16 21:54:45,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 21:54:45,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 21:54:45,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 21:54:45,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 21:54:45,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:54:44" (1/1) ... [2021-11-16 21:54:45,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:54:45,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:54:45,125 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-16 21:54:45,131 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-16 21:54:45,152 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2021-11-16 21:54:45,152 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2021-11-16 21:54:45,153 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-11-16 21:54:45,153 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-11-16 21:54:45,153 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2021-11-16 21:54:45,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2021-11-16 21:54:45,154 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-16 21:54:45,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 21:54:45,155 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 21:54:45,155 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 21:54:45,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 21:54:45,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 21:54:45,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 21:54:45,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 21:54:45,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 21:54:45,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 21:54:45,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 21:54:45,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 21:54:45,157 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 21:54:45,157 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 21:54:45,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-16 21:54:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 21:54:45,158 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 21:54:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 21:54:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 21:54:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2021-11-16 21:54:45,159 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2021-11-16 21:54:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 21:54:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-11-16 21:54:45,159 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-11-16 21:54:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-11-16 21:54:45,159 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-11-16 21:54:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 21:54:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 21:54:45,377 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 21:54:45,379 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 21:54:46,272 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 21:54:46,281 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 21:54:46,281 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-16 21:54:46,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:54:46 BoogieIcfgContainer [2021-11-16 21:54:46,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 21:54:46,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 21:54:46,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 21:54:46,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 21:54:46,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:54:42" (1/3) ... [2021-11-16 21:54:46,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cab3338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:54:46, skipping insertion in model container [2021-11-16 21:54:46,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:54:44" (2/3) ... [2021-11-16 21:54:46,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cab3338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:54:46, skipping insertion in model container [2021-11-16 21:54:46,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:54:46" (3/3) ... [2021-11-16 21:54:46,291 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_buf_harness.i [2021-11-16 21:54:46,297 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 21:54:46,297 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 21:54:46,335 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 21:54:46,339 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-16 21:54:46,340 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 21:54:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-16 21:54:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-16 21:54:46,370 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:54:46,371 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:46,372 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:54:46,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:54:46,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1812998439, now seen corresponding path program 1 times [2021-11-16 21:54:46,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:54:46,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712503166] [2021-11-16 21:54:46,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:54:46,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:54:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:46,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:54:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:46,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:54:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:46,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:54:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:46,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:54:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:46,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:54:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:46,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:54:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:46,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-16 21:54:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:46,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:54:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:46,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-16 21:54:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:46,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 21:54:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:46,963 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-16 21:54:46,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:54:46,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712503166] [2021-11-16 21:54:46,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712503166] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:54:46,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:54:46,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-16 21:54:46,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860055101] [2021-11-16 21:54:46,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:54:46,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-16 21:54:46,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:54:46,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-16 21:54:46,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 21:54:46,996 INFO L87 Difference]: Start difference. First operand has 131 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-16 21:54:48,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:54:48,087 INFO L93 Difference]: Finished difference Result 253 states and 352 transitions. [2021-11-16 21:54:48,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-16 21:54:48,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2021-11-16 21:54:48,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:54:48,094 INFO L225 Difference]: With dead ends: 253 [2021-11-16 21:54:48,094 INFO L226 Difference]: Without dead ends: 126 [2021-11-16 21:54:48,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 21:54:48,099 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 55 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:54:48,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 219 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-16 21:54:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-11-16 21:54:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-11-16 21:54:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 85 states have internal predecessors, (106), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2021-11-16 21:54:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2021-11-16 21:54:48,129 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 72 [2021-11-16 21:54:48,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:54:48,130 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2021-11-16 21:54:48,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-16 21:54:48,131 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2021-11-16 21:54:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-16 21:54:48,133 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:54:48,133 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:48,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 21:54:48,133 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:54:48,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:54:48,134 INFO L85 PathProgramCache]: Analyzing trace with hash -795992417, now seen corresponding path program 1 times [2021-11-16 21:54:48,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:54:48,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882200373] [2021-11-16 21:54:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:54:48,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:54:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:48,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:54:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:54:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:48,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:54:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:48,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:54:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:48,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:54:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:48,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:54:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:48,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-16 21:54:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:48,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:54:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-16 21:54:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:48,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 21:54:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-16 21:54:48,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:54:48,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882200373] [2021-11-16 21:54:48,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882200373] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:54:48,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:54:48,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 21:54:48,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706306289] [2021-11-16 21:54:48,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:54:48,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:54:48,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:54:48,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:54:48,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:54:48,428 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-16 21:54:50,087 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:54:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:54:50,395 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2021-11-16 21:54:50,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:54:50,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 72 [2021-11-16 21:54:50,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:54:50,398 INFO L225 Difference]: With dead ends: 213 [2021-11-16 21:54:50,398 INFO L226 Difference]: Without dead ends: 129 [2021-11-16 21:54:50,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:54:50,399 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 108 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-16 21:54:50,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 456 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-16 21:54:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-11-16 21:54:50,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-11-16 21:54:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.255813953488372) internal successors, (108), 88 states have internal predecessors, (108), 31 states have call successors, (31), 10 states have call predecessors, (31), 11 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2021-11-16 21:54:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 170 transitions. [2021-11-16 21:54:50,413 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 170 transitions. Word has length 72 [2021-11-16 21:54:50,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:54:50,414 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 170 transitions. [2021-11-16 21:54:50,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-16 21:54:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 170 transitions. [2021-11-16 21:54:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-16 21:54:50,417 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:54:50,418 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:50,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-16 21:54:50,418 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:54:50,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:54:50,422 INFO L85 PathProgramCache]: Analyzing trace with hash -565003148, now seen corresponding path program 1 times [2021-11-16 21:54:50,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:54:50,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700464275] [2021-11-16 21:54:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:54:50,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:54:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:54:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:50,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:54:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:50,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:54:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:50,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:54:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:50,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:54:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:50,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:54:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:50,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:54:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:50,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:54:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:50,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 21:54:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:50,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 21:54:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-16 21:54:50,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:54:50,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700464275] [2021-11-16 21:54:50,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700464275] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:54:50,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:54:50,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 21:54:50,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159448151] [2021-11-16 21:54:50,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:54:50,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:54:50,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:54:50,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:54:50,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:54:50,711 INFO L87 Difference]: Start difference. First operand 129 states and 170 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-16 21:54:52,740 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:54:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:54:53,339 INFO L93 Difference]: Finished difference Result 225 states and 299 transitions. [2021-11-16 21:54:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:54:53,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 78 [2021-11-16 21:54:53,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:54:53,345 INFO L225 Difference]: With dead ends: 225 [2021-11-16 21:54:53,345 INFO L226 Difference]: Without dead ends: 167 [2021-11-16 21:54:53,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:54:53,348 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 226 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 124 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-16 21:54:53,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 665 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2021-11-16 21:54:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-11-16 21:54:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 146. [2021-11-16 21:54:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 100 states have internal predecessors, (123), 35 states have call successors, (35), 11 states have call predecessors, (35), 12 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) [2021-11-16 21:54:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 194 transitions. [2021-11-16 21:54:53,365 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 194 transitions. Word has length 78 [2021-11-16 21:54:53,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:54:53,366 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 194 transitions. [2021-11-16 21:54:53,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-16 21:54:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 194 transitions. [2021-11-16 21:54:53,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-16 21:54:53,370 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:54:53,370 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:53,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-16 21:54:53,371 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:54:53,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:54:53,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1924525814, now seen corresponding path program 1 times [2021-11-16 21:54:53,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:54:53,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745046092] [2021-11-16 21:54:53,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:54:53,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:54:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:53,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:54:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:53,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:54:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:53,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:54:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:53,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:54:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:53,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:54:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:53,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:54:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:53,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:54:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:53,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:54:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:53,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 21:54:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:53,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 21:54:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-16 21:54:53,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:54:53,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745046092] [2021-11-16 21:54:53,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745046092] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:54:53,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:54:53,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 21:54:53,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618284807] [2021-11-16 21:54:53,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:54:53,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:54:53,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:54:53,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:54:53,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:54:53,661 INFO L87 Difference]: Start difference. First operand 146 states and 194 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-16 21:54:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:54:54,286 INFO L93 Difference]: Finished difference Result 250 states and 338 transitions. [2021-11-16 21:54:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:54:54,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 78 [2021-11-16 21:54:54,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:54:54,289 INFO L225 Difference]: With dead ends: 250 [2021-11-16 21:54:54,289 INFO L226 Difference]: Without dead ends: 194 [2021-11-16 21:54:54,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:54:54,290 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 67 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-16 21:54:54,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 441 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-16 21:54:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-11-16 21:54:54,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2021-11-16 21:54:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 128 states have (on average 1.2578125) internal successors, (161), 130 states have internal predecessors, (161), 51 states have call successors, (51), 11 states have call predecessors, (51), 12 states have return successors, (54), 50 states have call predecessors, (54), 50 states have call successors, (54) [2021-11-16 21:54:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 266 transitions. [2021-11-16 21:54:54,312 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 266 transitions. Word has length 78 [2021-11-16 21:54:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:54:54,313 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 266 transitions. [2021-11-16 21:54:54,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-16 21:54:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 266 transitions. [2021-11-16 21:54:54,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-16 21:54:54,314 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:54:54,314 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:54:54,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-16 21:54:54,314 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:54:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:54:54,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2071762423, now seen corresponding path program 1 times [2021-11-16 21:54:54,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:54:54,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672097094] [2021-11-16 21:54:54,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:54:54,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:54:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:54,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:54:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:54,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:54:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:54,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:54:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:54,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:54:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:54,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:54:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:54,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:54:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:54,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:54:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:54,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:54:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:54,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 21:54:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:54,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 21:54:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:54,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-16 21:54:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-16 21:54:54,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:54:54,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672097094] [2021-11-16 21:54:54,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672097094] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:54:54,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:54:54,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 21:54:54,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90219586] [2021-11-16 21:54:54,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:54:54,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:54:54,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:54:54,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:54:54,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:54:54,618 INFO L87 Difference]: Start difference. First operand 192 states and 266 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-16 21:54:56,649 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:54:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:54:57,097 INFO L93 Difference]: Finished difference Result 203 states and 282 transitions. [2021-11-16 21:54:57,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:54:57,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 90 [2021-11-16 21:54:57,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:54:57,099 INFO L225 Difference]: With dead ends: 203 [2021-11-16 21:54:57,099 INFO L226 Difference]: Without dead ends: 196 [2021-11-16 21:54:57,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:54:57,100 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 80 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-16 21:54:57,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 870 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 375 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2021-11-16 21:54:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-11-16 21:54:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-11-16 21:54:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 131 states have (on average 1.251908396946565) internal successors, (164), 134 states have internal predecessors, (164), 51 states have call successors, (51), 11 states have call predecessors, (51), 13 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2021-11-16 21:54:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 275 transitions. [2021-11-16 21:54:57,114 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 275 transitions. Word has length 90 [2021-11-16 21:54:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:54:57,114 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 275 transitions. [2021-11-16 21:54:57,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-16 21:54:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 275 transitions. [2021-11-16 21:54:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-16 21:54:57,118 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:54:57,119 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:54:57,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-16 21:54:57,119 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:54:57,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:54:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1055189439, now seen corresponding path program 1 times [2021-11-16 21:54:57,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:54:57,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622450930] [2021-11-16 21:54:57,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:54:57,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:54:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:57,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:54:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:57,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:54:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:57,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:54:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:57,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:54:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:57,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:54:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:57,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:54:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:57,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:54:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:57,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:54:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 21:54:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:57,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 21:54:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:57,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-16 21:54:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:54:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-11-16 21:54:57,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:54:57,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622450930] [2021-11-16 21:54:57,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622450930] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:54:57,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:54:57,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 21:54:57,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010459632] [2021-11-16 21:54:57,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:54:57,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:54:57,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:54:57,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:54:57,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:54:57,397 INFO L87 Difference]: Start difference. First operand 196 states and 275 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-16 21:54:59,426 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:01,495 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:55:01,903 INFO L93 Difference]: Finished difference Result 362 states and 524 transitions. [2021-11-16 21:55:01,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:55:01,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2021-11-16 21:55:01,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:55:01,905 INFO L225 Difference]: With dead ends: 362 [2021-11-16 21:55:01,905 INFO L226 Difference]: Without dead ends: 221 [2021-11-16 21:55:01,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:55:01,906 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 120 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-11-16 21:55:01,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 516 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2021-11-16 21:55:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-11-16 21:55:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2021-11-16 21:55:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 139 states have internal predecessors, (171), 51 states have call successors, (51), 11 states have call predecessors, (51), 13 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2021-11-16 21:55:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 282 transitions. [2021-11-16 21:55:01,917 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 282 transitions. Word has length 94 [2021-11-16 21:55:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:55:01,918 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 282 transitions. [2021-11-16 21:55:01,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-16 21:55:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 282 transitions. [2021-11-16 21:55:01,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-16 21:55:01,920 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:55:01,920 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:55:01,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-16 21:55:01,920 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:55:01,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:55:01,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1313354877, now seen corresponding path program 1 times [2021-11-16 21:55:01,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:55:01,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171411078] [2021-11-16 21:55:01,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:01,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:55:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:02,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:55:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:02,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:55:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:02,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:55:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:02,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:55:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:02,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:55:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:02,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:55:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:02,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:55:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:02,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:55:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:02,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 21:55:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:02,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 21:55:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:02,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-16 21:55:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-11-16 21:55:02,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:55:02,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171411078] [2021-11-16 21:55:02,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171411078] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:55:02,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160793841] [2021-11-16 21:55:02,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:02,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:55:02,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:55:02,436 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:55:02,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-16 21:55:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:02,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 2555 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-16 21:55:02,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:55:03,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-16 21:55:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-16 21:55:03,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:55:03,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160793841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:55:03,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:55:03,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2021-11-16 21:55:03,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011248427] [2021-11-16 21:55:03,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:55:03,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 21:55:03,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:55:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 21:55:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-11-16 21:55:03,414 INFO L87 Difference]: Start difference. First operand 201 states and 282 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-16 21:55:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:55:03,470 INFO L93 Difference]: Finished difference Result 373 states and 521 transitions. [2021-11-16 21:55:03,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 21:55:03,470 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 94 [2021-11-16 21:55:03,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:55:03,471 INFO L225 Difference]: With dead ends: 373 [2021-11-16 21:55:03,472 INFO L226 Difference]: Without dead ends: 220 [2021-11-16 21:55:03,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-11-16 21:55:03,473 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 20 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:55:03,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 941 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 57 Unchecked, 0.0s Time] [2021-11-16 21:55:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-11-16 21:55:03,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-11-16 21:55:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 154 states have (on average 1.2597402597402598) internal successors, (194), 157 states have internal predecessors, (194), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2021-11-16 21:55:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 305 transitions. [2021-11-16 21:55:03,481 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 305 transitions. Word has length 94 [2021-11-16 21:55:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:55:03,481 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 305 transitions. [2021-11-16 21:55:03,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-16 21:55:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 305 transitions. [2021-11-16 21:55:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-16 21:55:03,482 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:55:03,493 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:55:03,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-16 21:55:03,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:55:03,694 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:55:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:55:03,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1354029627, now seen corresponding path program 1 times [2021-11-16 21:55:03,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:55:03,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860502327] [2021-11-16 21:55:03,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:03,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:55:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:03,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:55:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:03,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:55:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:03,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:55:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:03,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:55:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:03,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:55:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:55:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:03,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:55:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:03,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:55:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:03,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 21:55:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 21:55:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-16 21:55:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:03,870 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-11-16 21:55:03,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:55:03,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860502327] [2021-11-16 21:55:03,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860502327] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:55:03,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154389821] [2021-11-16 21:55:03,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:03,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:55:03,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:55:03,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:55:03,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-16 21:55:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:04,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 2550 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 21:55:04,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:55:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-16 21:55:04,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:55:04,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154389821] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:55:04,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:55:04,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-11-16 21:55:04,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834611196] [2021-11-16 21:55:04,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:55:04,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:55:04,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:55:04,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:55:04,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:55:04,370 INFO L87 Difference]: Start difference. First operand 220 states and 305 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 21:55:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:55:04,392 INFO L93 Difference]: Finished difference Result 379 states and 533 transitions. [2021-11-16 21:55:04,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:55:04,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2021-11-16 21:55:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:55:04,395 INFO L225 Difference]: With dead ends: 379 [2021-11-16 21:55:04,395 INFO L226 Difference]: Without dead ends: 229 [2021-11-16 21:55:04,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:55:04,396 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 20 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:55:04,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 493 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:55:04,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-16 21:55:04,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2021-11-16 21:55:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 149 states have internal predecessors, (185), 51 states have call successors, (51), 12 states have call predecessors, (51), 13 states have return successors, (58), 50 states have call predecessors, (58), 50 states have call successors, (58) [2021-11-16 21:55:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2021-11-16 21:55:04,406 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 94 [2021-11-16 21:55:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:55:04,407 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2021-11-16 21:55:04,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 21:55:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2021-11-16 21:55:04,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-16 21:55:04,409 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:55:04,409 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:55:04,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-16 21:55:04,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-16 21:55:04,624 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:55:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:55:04,624 INFO L85 PathProgramCache]: Analyzing trace with hash -805510601, now seen corresponding path program 1 times [2021-11-16 21:55:04,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:55:04,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947284403] [2021-11-16 21:55:04,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:04,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:55:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:04,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:55:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:04,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:55:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:04,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:55:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:04,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:55:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:04,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:55:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:04,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:55:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:04,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:55:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:04,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 21:55:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:04,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 21:55:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:04,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-16 21:55:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:04,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-16 21:55:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-16 21:55:04,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:55:04,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947284403] [2021-11-16 21:55:04,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947284403] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:55:04,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092114444] [2021-11-16 21:55:04,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:04,902 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:55:04,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:55:04,903 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:55:04,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-16 21:55:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:05,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 2562 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-16 21:55:05,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:55:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-16 21:55:05,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:55:05,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092114444] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:55:05,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:55:05,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2021-11-16 21:55:05,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399915381] [2021-11-16 21:55:05,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:55:05,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:55:05,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:55:05,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:55:05,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:55:05,475 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-16 21:55:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:55:05,589 INFO L93 Difference]: Finished difference Result 367 states and 515 transitions. [2021-11-16 21:55:05,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 21:55:05,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2021-11-16 21:55:05,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:55:05,592 INFO L225 Difference]: With dead ends: 367 [2021-11-16 21:55:05,592 INFO L226 Difference]: Without dead ends: 217 [2021-11-16 21:55:05,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:55:05,596 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 12 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:55:05,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1191 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:55:05,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-16 21:55:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-11-16 21:55:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 154 states have internal predecessors, (189), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2021-11-16 21:55:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 303 transitions. [2021-11-16 21:55:05,610 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 303 transitions. Word has length 98 [2021-11-16 21:55:05,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:55:05,612 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 303 transitions. [2021-11-16 21:55:05,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-16 21:55:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 303 transitions. [2021-11-16 21:55:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-16 21:55:05,614 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:55:05,614 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:55:05,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-16 21:55:05,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:55:05,828 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:55:05,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:55:05,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1170955310, now seen corresponding path program 1 times [2021-11-16 21:55:05,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:55:05,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563987582] [2021-11-16 21:55:05,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:05,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:55:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:05,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:55:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:05,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:55:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:05,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:55:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:05,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:55:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:05,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:55:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:05,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:55:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:05,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:55:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:05,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 21:55:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:05,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 21:55:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:05,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 21:55:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:05,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 21:55:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-16 21:55:05,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:55:05,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563987582] [2021-11-16 21:55:05,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563987582] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:55:05,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720317985] [2021-11-16 21:55:05,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:05,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:55:05,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:55:05,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:55:06,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-16 21:55:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:06,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 2567 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 21:55:06,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:55:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-16 21:55:06,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:55:06,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720317985] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:55:06,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:55:06,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-11-16 21:55:06,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91230387] [2021-11-16 21:55:06,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:55:06,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:55:06,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:55:06,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:55:06,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:55:06,500 INFO L87 Difference]: Start difference. First operand 217 states and 303 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 21:55:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:55:06,522 INFO L93 Difference]: Finished difference Result 377 states and 535 transitions. [2021-11-16 21:55:06,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:55:06,522 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), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2021-11-16 21:55:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:55:06,523 INFO L225 Difference]: With dead ends: 377 [2021-11-16 21:55:06,523 INFO L226 Difference]: Without dead ends: 220 [2021-11-16 21:55:06,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:55:06,525 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 9 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:55:06,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 486 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:55:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-11-16 21:55:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2021-11-16 21:55:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 151 states have (on average 1.2384105960264902) internal successors, (187), 154 states have internal predecessors, (187), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2021-11-16 21:55:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 301 transitions. [2021-11-16 21:55:06,535 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 301 transitions. Word has length 100 [2021-11-16 21:55:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:55:06,536 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 301 transitions. [2021-11-16 21:55:06,536 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), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 21:55:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 301 transitions. [2021-11-16 21:55:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-16 21:55:06,537 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:55:06,537 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:55:06,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-16 21:55:06,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:55:06,752 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:55:06,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:55:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1786047986, now seen corresponding path program 1 times [2021-11-16 21:55:06,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:55:06,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65030744] [2021-11-16 21:55:06,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:06,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:55:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:06,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:55:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:06,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:55:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:06,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:55:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:06,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:55:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:06,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:55:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:06,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:55:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:06,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:55:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:06,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 21:55:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:06,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 21:55:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:06,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 21:55:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:06,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 21:55:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-16 21:55:06,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:55:06,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65030744] [2021-11-16 21:55:06,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65030744] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:55:06,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324642757] [2021-11-16 21:55:06,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:06,903 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:55:06,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:55:06,916 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:55:06,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-16 21:55:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:07,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 2569 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 21:55:07,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:55:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-16 21:55:07,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:55:07,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324642757] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:55:07,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:55:07,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-11-16 21:55:07,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414736704] [2021-11-16 21:55:07,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:55:07,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:55:07,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:55:07,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:55:07,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:55:07,452 INFO L87 Difference]: Start difference. First operand 217 states and 301 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 21:55:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:55:07,469 INFO L93 Difference]: Finished difference Result 383 states and 546 transitions. [2021-11-16 21:55:07,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:55:07,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2021-11-16 21:55:07,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:55:07,471 INFO L225 Difference]: With dead ends: 383 [2021-11-16 21:55:07,471 INFO L226 Difference]: Without dead ends: 226 [2021-11-16 21:55:07,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:55:07,472 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 34 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:55:07,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 484 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:55:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-16 21:55:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 213. [2021-11-16 21:55:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 150 states have internal predecessors, (180), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2021-11-16 21:55:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 294 transitions. [2021-11-16 21:55:07,479 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 294 transitions. Word has length 100 [2021-11-16 21:55:07,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:55:07,479 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 294 transitions. [2021-11-16 21:55:07,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 21:55:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 294 transitions. [2021-11-16 21:55:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-16 21:55:07,481 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:55:07,481 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:55:07,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-16 21:55:07,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-16 21:55:07,702 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:55:07,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:55:07,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1106775732, now seen corresponding path program 1 times [2021-11-16 21:55:07,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:55:07,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743551193] [2021-11-16 21:55:07,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:07,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:55:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:08,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:55:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:55:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:08,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:55:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:55:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:08,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:55:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:08,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:55:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:08,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:55:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:08,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 21:55:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:08,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 21:55:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:08,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 21:55:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:08,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 21:55:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-11-16 21:55:08,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:55:08,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743551193] [2021-11-16 21:55:08,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743551193] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:55:08,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857306880] [2021-11-16 21:55:08,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:08,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:55:08,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:55:08,564 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:55:08,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-16 21:55:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:08,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 2564 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-16 21:55:08,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:55:09,630 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-16 21:55:09,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:55:09,959 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-11-16 21:55:09,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2021-11-16 21:55:10,028 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-11-16 21:55:10,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857306880] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 21:55:10,028 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 21:55:10,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 24 [2021-11-16 21:55:10,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653630338] [2021-11-16 21:55:10,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 21:55:10,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-16 21:55:10,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:55:10,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-16 21:55:10,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2021-11-16 21:55:10,030 INFO L87 Difference]: Start difference. First operand 213 states and 294 transitions. Second operand has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2021-11-16 21:55:12,058 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:14,120 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:15,651 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:17,709 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:19,577 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:20,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:55:20,916 INFO L93 Difference]: Finished difference Result 259 states and 342 transitions. [2021-11-16 21:55:20,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 21:55:20,917 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 100 [2021-11-16 21:55:20,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:55:20,918 INFO L225 Difference]: With dead ends: 259 [2021-11-16 21:55:20,918 INFO L226 Difference]: Without dead ends: 231 [2021-11-16 21:55:20,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 203 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2021-11-16 21:55:20,920 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 350 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 52 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2021-11-16 21:55:20,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 837 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 847 Invalid, 3 Unknown, 320 Unchecked, 10.5s Time] [2021-11-16 21:55:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-11-16 21:55:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 223. [2021-11-16 21:55:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 155 states have (on average 1.2129032258064516) internal successors, (188), 158 states have internal predecessors, (188), 51 states have call successors, (51), 14 states have call predecessors, (51), 16 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2021-11-16 21:55:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 302 transitions. [2021-11-16 21:55:20,931 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 302 transitions. Word has length 100 [2021-11-16 21:55:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:55:20,931 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 302 transitions. [2021-11-16 21:55:20,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2021-11-16 21:55:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 302 transitions. [2021-11-16 21:55:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-16 21:55:20,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:55:20,933 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:55:20,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-16 21:55:21,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:55:21,153 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:55:21,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:55:21,154 INFO L85 PathProgramCache]: Analyzing trace with hash 61814546, now seen corresponding path program 1 times [2021-11-16 21:55:21,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:55:21,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630606197] [2021-11-16 21:55:21,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:21,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:55:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:21,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:55:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:21,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:55:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:21,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:55:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:21,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:55:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:21,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:55:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:21,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:55:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:21,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:55:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:21,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 21:55:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:21,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 21:55:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:21,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 21:55:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:21,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 21:55:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-16 21:55:21,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:55:21,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630606197] [2021-11-16 21:55:21,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630606197] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:55:21,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997090402] [2021-11-16 21:55:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:21,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:55:21,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:55:21,577 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:55:21,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-16 21:55:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:21,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 2561 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-16 21:55:21,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:55:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-16 21:55:22,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:55:23,489 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-16 21:55:23,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 1 [2021-11-16 21:55:23,670 INFO L354 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2021-11-16 21:55:23,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2021-11-16 21:55:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-11-16 21:55:23,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997090402] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 21:55:23,833 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 21:55:23,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 33 [2021-11-16 21:55:23,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67514116] [2021-11-16 21:55:23,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 21:55:23,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-16 21:55:23,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:55:23,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-16 21:55:23,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2021-11-16 21:55:23,835 INFO L87 Difference]: Start difference. First operand 223 states and 302 transitions. Second operand has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2021-11-16 21:55:26,452 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:27,627 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:29,440 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:31,499 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:33,619 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:36,394 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:38,540 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:40,607 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:42,659 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:55:45,051 INFO L93 Difference]: Finished difference Result 353 states and 508 transitions. [2021-11-16 21:55:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-16 21:55:45,052 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) Word has length 100 [2021-11-16 21:55:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:55:45,053 INFO L225 Difference]: With dead ends: 353 [2021-11-16 21:55:45,054 INFO L226 Difference]: Without dead ends: 341 [2021-11-16 21:55:45,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 193 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=618, Invalid=2804, Unknown=0, NotChecked=0, Total=3422 [2021-11-16 21:55:45,055 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 313 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 75 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 574 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:55:45,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 1823 Invalid, 2396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1740 Invalid, 7 Unknown, 574 Unchecked, 20.1s Time] [2021-11-16 21:55:45,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-11-16 21:55:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 334. [2021-11-16 21:55:45,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 232 states have (on average 1.2155172413793103) internal successors, (282), 235 states have internal predecessors, (282), 81 states have call successors, (81), 17 states have call predecessors, (81), 20 states have return successors, (117), 81 states have call predecessors, (117), 80 states have call successors, (117) [2021-11-16 21:55:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 480 transitions. [2021-11-16 21:55:45,069 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 480 transitions. Word has length 100 [2021-11-16 21:55:45,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:55:45,069 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 480 transitions. [2021-11-16 21:55:45,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2021-11-16 21:55:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 480 transitions. [2021-11-16 21:55:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-16 21:55:45,071 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:55:45,071 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:55:45,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-16 21:55:45,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:55:45,288 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:55:45,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:55:45,288 INFO L85 PathProgramCache]: Analyzing trace with hash 319979984, now seen corresponding path program 1 times [2021-11-16 21:55:45,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:55:45,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528971161] [2021-11-16 21:55:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:45,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:55:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:45,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:55:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:45,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:55:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:45,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:55:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:45,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:55:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:45,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:55:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:45,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:55:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:45,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:55:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:45,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 21:55:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:45,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 21:55:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:45,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 21:55:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:45,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 21:55:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-11-16 21:55:45,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:55:45,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528971161] [2021-11-16 21:55:45,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528971161] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:55:45,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:55:45,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 21:55:45,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180341501] [2021-11-16 21:55:45,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:55:45,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:55:45,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:55:45,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:55:45,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:55:45,452 INFO L87 Difference]: Start difference. First operand 334 states and 480 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-16 21:55:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:55:47,032 INFO L93 Difference]: Finished difference Result 490 states and 688 transitions. [2021-11-16 21:55:47,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:55:47,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2021-11-16 21:55:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:55:47,034 INFO L225 Difference]: With dead ends: 490 [2021-11-16 21:55:47,034 INFO L226 Difference]: Without dead ends: 325 [2021-11-16 21:55:47,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:55:47,035 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 78 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-16 21:55:47,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 515 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-16 21:55:47,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-11-16 21:55:47,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-11-16 21:55:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 224 states have (on average 1.2142857142857142) internal successors, (272), 226 states have internal predecessors, (272), 81 states have call successors, (81), 17 states have call predecessors, (81), 19 states have return successors, (116), 81 states have call predecessors, (116), 80 states have call successors, (116) [2021-11-16 21:55:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 469 transitions. [2021-11-16 21:55:47,048 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 469 transitions. Word has length 100 [2021-11-16 21:55:47,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:55:47,048 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 469 transitions. [2021-11-16 21:55:47,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-16 21:55:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 469 transitions. [2021-11-16 21:55:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-16 21:55:47,050 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:55:47,050 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:55:47,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-16 21:55:47,050 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:55:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:55:47,050 INFO L85 PathProgramCache]: Analyzing trace with hash 102489296, now seen corresponding path program 1 times [2021-11-16 21:55:47,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:55:47,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354452397] [2021-11-16 21:55:47,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:47,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:55:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:47,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:55:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:47,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:55:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:47,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:55:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:47,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:55:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:47,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:55:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:47,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:55:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:47,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:55:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:47,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 21:55:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:47,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 21:55:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:47,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 21:55:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:47,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 21:55:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-11-16 21:55:47,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:55:47,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354452397] [2021-11-16 21:55:47,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354452397] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:55:47,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254077550] [2021-11-16 21:55:47,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:47,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:55:47,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:55:47,759 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:55:47,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-16 21:55:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:48,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 2566 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-16 21:55:48,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:55:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-16 21:55:49,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:55:49,684 INFO L354 Elim1Store]: treesize reduction 39, result has 46.6 percent of original size [2021-11-16 21:55:49,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 48 [2021-11-16 21:55:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-11-16 21:55:50,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254077550] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 21:55:50,295 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 21:55:50,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 30 [2021-11-16 21:55:50,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333844279] [2021-11-16 21:55:50,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 21:55:50,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-16 21:55:50,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:55:50,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-16 21:55:50,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2021-11-16 21:55:50,296 INFO L87 Difference]: Start difference. First operand 325 states and 469 transitions. Second operand has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2021-11-16 21:55:52,939 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:55:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:55:56,196 INFO L93 Difference]: Finished difference Result 349 states and 492 transitions. [2021-11-16 21:55:56,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-16 21:55:56,196 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 100 [2021-11-16 21:55:56,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:55:56,198 INFO L225 Difference]: With dead ends: 349 [2021-11-16 21:55:56,198 INFO L226 Difference]: Without dead ends: 337 [2021-11-16 21:55:56,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 198 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=382, Invalid=1780, Unknown=0, NotChecked=0, Total=2162 [2021-11-16 21:55:56,199 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 240 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2021-11-16 21:55:56,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 994 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1085 Invalid, 1 Unknown, 195 Unchecked, 4.6s Time] [2021-11-16 21:55:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-11-16 21:55:56,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 320. [2021-11-16 21:55:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 220 states have (on average 1.2181818181818183) internal successors, (268), 221 states have internal predecessors, (268), 81 states have call successors, (81), 17 states have call predecessors, (81), 18 states have return successors, (107), 81 states have call predecessors, (107), 80 states have call successors, (107) [2021-11-16 21:55:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 456 transitions. [2021-11-16 21:55:56,231 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 456 transitions. Word has length 100 [2021-11-16 21:55:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:55:56,231 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 456 transitions. [2021-11-16 21:55:56,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2021-11-16 21:55:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 456 transitions. [2021-11-16 21:55:56,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-16 21:55:56,233 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:55:56,233 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:55:56,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-16 21:55:56,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-16 21:55:56,456 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:55:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:55:56,456 INFO L85 PathProgramCache]: Analyzing trace with hash -430654057, now seen corresponding path program 1 times [2021-11-16 21:55:56,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:55:56,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207863104] [2021-11-16 21:55:56,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:56,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:55:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:56,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:55:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:56,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:55:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:56,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:55:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:56,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:55:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:56,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:55:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:56,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:55:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:56,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:55:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:56,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 21:55:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:56,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 21:55:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:56,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 21:55:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:56,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 21:55:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-16 21:55:56,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:55:56,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207863104] [2021-11-16 21:55:56,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207863104] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:55:56,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:55:56,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 21:55:56,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563326069] [2021-11-16 21:55:56,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:55:56,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 21:55:56,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:55:56,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 21:55:56,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:55:56,638 INFO L87 Difference]: Start difference. First operand 320 states and 456 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-16 21:55:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:55:57,294 INFO L93 Difference]: Finished difference Result 331 states and 473 transitions. [2021-11-16 21:55:57,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 21:55:57,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2021-11-16 21:55:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:55:57,296 INFO L225 Difference]: With dead ends: 331 [2021-11-16 21:55:57,296 INFO L226 Difference]: Without dead ends: 289 [2021-11-16 21:55:57,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-11-16 21:55:57,297 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 84 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-16 21:55:57,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 1092 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-16 21:55:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-11-16 21:55:57,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2021-11-16 21:55:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 197 states have (on average 1.2030456852791878) internal successors, (237), 199 states have internal predecessors, (237), 69 states have call successors, (69), 17 states have call predecessors, (69), 18 states have return successors, (86), 68 states have call predecessors, (86), 67 states have call successors, (86) [2021-11-16 21:55:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 392 transitions. [2021-11-16 21:55:57,308 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 392 transitions. Word has length 102 [2021-11-16 21:55:57,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:55:57,308 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 392 transitions. [2021-11-16 21:55:57,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-16 21:55:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 392 transitions. [2021-11-16 21:55:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-16 21:55:57,309 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:55:57,309 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:55:57,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-16 21:55:57,309 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:55:57,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:55:57,310 INFO L85 PathProgramCache]: Analyzing trace with hash 704139607, now seen corresponding path program 1 times [2021-11-16 21:55:57,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:55:57,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711801801] [2021-11-16 21:55:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:55:57,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:55:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:57,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:55:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:57,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:55:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:57,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:55:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:57,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-16 21:55:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:57,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:55:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:57,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 21:55:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:57,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:55:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:57,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 21:55:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:57,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 21:55:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:57,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 21:55:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:57,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 21:55:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:55:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-11-16 21:55:57,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:55:57,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711801801] [2021-11-16 21:55:57,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711801801] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:55:57,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:55:57,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-16 21:55:57,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126136536] [2021-11-16 21:55:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:55:57,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-16 21:55:57,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:55:57,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-16 21:55:57,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-11-16 21:55:57,728 INFO L87 Difference]: Start difference. First operand 285 states and 392 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-16 21:55:59,215 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:56:02,141 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:56:04,579 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:56:06,641 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:56:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:56:07,489 INFO L93 Difference]: Finished difference Result 295 states and 406 transitions. [2021-11-16 21:56:07,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-16 21:56:07,490 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2021-11-16 21:56:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:56:07,491 INFO L225 Difference]: With dead ends: 295 [2021-11-16 21:56:07,491 INFO L226 Difference]: Without dead ends: 230 [2021-11-16 21:56:07,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2021-11-16 21:56:07,492 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 177 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 90 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2021-11-16 21:56:07,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 1095 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 988 Invalid, 3 Unknown, 0 Unchecked, 9.5s Time] [2021-11-16 21:56:07,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-16 21:56:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 167. [2021-11-16 21:56:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 118 states have (on average 1.1864406779661016) internal successors, (140), 120 states have internal predecessors, (140), 33 states have call successors, (33), 14 states have call predecessors, (33), 15 states have return successors, (36), 32 states have call predecessors, (36), 32 states have call successors, (36) [2021-11-16 21:56:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 209 transitions. [2021-11-16 21:56:07,499 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 209 transitions. Word has length 102 [2021-11-16 21:56:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:56:07,499 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 209 transitions. [2021-11-16 21:56:07,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-16 21:56:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 209 transitions. [2021-11-16 21:56:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-16 21:56:07,501 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:56:07,501 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:56:07,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-16 21:56:07,501 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:56:07,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:56:07,501 INFO L85 PathProgramCache]: Analyzing trace with hash 523668838, now seen corresponding path program 1 times [2021-11-16 21:56:07,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:56:07,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258384366] [2021-11-16 21:56:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:56:07,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:56:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:56:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:56:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:56:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:56:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:56:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:56:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-16 21:56:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-16 21:56:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:56:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 21:56:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:56:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 21:56:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-16 21:56:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-16 21:56:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 21:56:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-16 21:56:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:07,908 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-11-16 21:56:07,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:56:07,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258384366] [2021-11-16 21:56:07,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258384366] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:56:07,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718226285] [2021-11-16 21:56:07,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:56:07,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:56:07,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:56:07,910 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:56:07,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-16 21:56:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:56:08,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 2636 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-16 21:56:08,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:56:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-16 21:56:08,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:56:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-16 21:56:08,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718226285] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 21:56:08,829 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 21:56:08,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 23 [2021-11-16 21:56:08,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674039224] [2021-11-16 21:56:08,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 21:56:08,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-16 21:56:08,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:56:08,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-16 21:56:08,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2021-11-16 21:56:08,833 INFO L87 Difference]: Start difference. First operand 167 states and 209 transitions. Second operand has 23 states, 21 states have (on average 3.857142857142857) internal successors, (81), 17 states have internal predecessors, (81), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2021-11-16 21:56:09,966 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:56:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:56:10,409 INFO L93 Difference]: Finished difference Result 185 states and 223 transitions. [2021-11-16 21:56:10,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-16 21:56:10,410 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.857142857142857) internal successors, (81), 17 states have internal predecessors, (81), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) Word has length 118 [2021-11-16 21:56:10,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:56:10,410 INFO L225 Difference]: With dead ends: 185 [2021-11-16 21:56:10,410 INFO L226 Difference]: Without dead ends: 0 [2021-11-16 21:56:10,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2021-11-16 21:56:10,411 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 58 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-16 21:56:10,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 348 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-16 21:56:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-16 21:56:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-16 21:56:10,412 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-16 21:56:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-16 21:56:10,412 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2021-11-16 21:56:10,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:56:10,412 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-16 21:56:10,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.857142857142857) internal successors, (81), 17 states have internal predecessors, (81), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2021-11-16 21:56:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-16 21:56:10,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-16 21:56:10,414 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-16 21:56:10,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-16 21:56:10,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-16 21:56:10,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-16 21:56:14,317 INFO L854 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2021-11-16 21:56:14,317 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2021-11-16 21:56:14,317 INFO L854 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2021-11-16 21:56:14,318 INFO L858 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2021-11-16 21:56:14,318 INFO L854 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (let ((.cse1 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (let ((.cse0 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (and (<= (+ .cse0 1) |ensure_string_is_allocated_bounded_length_~len~1#1|) (<= |ensure_string_is_allocated_bounded_length_~len~1#1| (+ .cse0 15)))) .cse1) (or .cse1 (<= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| (+ 15 (* 18446744073709551616 (div (+ (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 18446744073709551616))))) (= |old(#valid)| |#valid|))) [2021-11-16 21:56:14,318 INFO L858 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2021-11-16 21:56:14,318 INFO L854 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2021-11-16 21:56:14,318 INFO L858 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2021-11-16 21:56:14,318 INFO L854 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-11-16 21:56:14,318 INFO L854 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-11-16 21:56:14,318 INFO L858 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2021-11-16 21:56:14,319 INFO L858 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2021-11-16 21:56:14,319 INFO L854 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-11-16 21:56:14,319 INFO L858 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2021-11-16 21:56:14,319 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2021-11-16 21:56:14,319 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-11-16 21:56:14,319 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-11-16 21:56:14,319 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-11-16 21:56:14,319 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-11-16 21:56:14,319 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-11-16 21:56:14,320 INFO L861 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2021-11-16 21:56:14,320 INFO L858 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2021-11-16 21:56:14,320 INFO L858 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2021-11-16 21:56:14,320 INFO L861 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2021-11-16 21:56:14,320 INFO L858 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2021-11-16 21:56:14,320 INFO L858 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2021-11-16 21:56:14,320 INFO L861 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2021-11-16 21:56:14,320 INFO L858 garLoopResultBuilder]: For program point L7364-6(line 7364) no Hoare annotation was computed. [2021-11-16 21:56:14,320 INFO L858 garLoopResultBuilder]: For program point L7364-4(line 7364) no Hoare annotation was computed. [2021-11-16 21:56:14,320 INFO L858 garLoopResultBuilder]: For program point L7364-3(line 7364) no Hoare annotation was computed. [2021-11-16 21:56:14,321 INFO L858 garLoopResultBuilder]: For program point L7364-8(line 7364) no Hoare annotation was computed. [2021-11-16 21:56:14,321 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7359 7365) the Hoare annotation is: true [2021-11-16 21:56:14,321 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7359 7365) no Hoare annotation was computed. [2021-11-16 21:56:14,321 INFO L858 garLoopResultBuilder]: For program point L7361-3(line 7361) no Hoare annotation was computed. [2021-11-16 21:56:14,321 INFO L858 garLoopResultBuilder]: For program point L7361-1(line 7361) no Hoare annotation was computed. [2021-11-16 21:56:14,321 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7359 7365) no Hoare annotation was computed. [2021-11-16 21:56:14,321 INFO L858 garLoopResultBuilder]: For program point L7361(lines 7361 7364) no Hoare annotation was computed. [2021-11-16 21:56:14,321 INFO L858 garLoopResultBuilder]: For program point L7361-7(lines 7361 7364) no Hoare annotation was computed. [2021-11-16 21:56:14,321 INFO L858 garLoopResultBuilder]: For program point L7361-6(lines 7361 7362) no Hoare annotation was computed. [2021-11-16 21:56:14,322 INFO L858 garLoopResultBuilder]: For program point L7361-4(lines 7361 7362) no Hoare annotation was computed. [2021-11-16 21:56:14,322 INFO L858 garLoopResultBuilder]: For program point L7361-11(lines 7361 7364) no Hoare annotation was computed. [2021-11-16 21:56:14,322 INFO L858 garLoopResultBuilder]: For program point L7361-9(lines 7361 7364) no Hoare annotation was computed. [2021-11-16 21:56:14,322 INFO L858 garLoopResultBuilder]: For program point L7364-2(line 7364) no Hoare annotation was computed. [2021-11-16 21:56:14,322 INFO L858 garLoopResultBuilder]: For program point L7364(line 7364) no Hoare annotation was computed. [2021-11-16 21:56:14,322 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-11-16 21:56:14,322 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-11-16 21:56:14,322 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-11-16 21:56:14,322 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-11-16 21:56:14,322 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-11-16 21:56:14,323 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-16 21:56:14,323 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-11-16 21:56:14,323 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2021-11-16 21:56:14,323 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2021-11-16 21:56:14,323 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2021-11-16 21:56:14,323 INFO L861 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2021-11-16 21:56:14,323 INFO L858 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2021-11-16 21:56:14,323 INFO L858 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2021-11-16 21:56:14,323 INFO L858 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2021-11-16 21:56:14,323 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2021-11-16 21:56:14,324 INFO L858 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2021-11-16 21:56:14,324 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2021-11-16 21:56:14,324 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-11-16 21:56:14,324 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-11-16 21:56:14,324 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-11-16 21:56:14,324 INFO L854 garLoopResultBuilder]: At program point L9408(line 9408) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse8 16)) (.cse2 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (* .cse2 (- 1))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse5 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (* (div .cse2 18446744073709551616) 18446744073709551616) .cse3) 18446744073709551616)))) .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse7 (= |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)) (and .cse0 (<= 0 (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5 .cse6 .cse7))))) [2021-11-16 21:56:14,324 INFO L858 garLoopResultBuilder]: For program point L9408-1(line 9408) no Hoare annotation was computed. [2021-11-16 21:56:14,324 INFO L854 garLoopResultBuilder]: At program point L9408-2(lines 9386 9409) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse8 16)) (.cse2 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (* .cse2 (- 1))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse5 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (* (div .cse2 18446744073709551616) 18446744073709551616) .cse3) 18446744073709551616)))) .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse7 (= |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)) (and .cse0 (<= 0 (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5 .cse6 .cse7))))) [2021-11-16 21:56:14,325 INFO L858 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2021-11-16 21:56:14,325 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-16 21:56:14,325 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-16 21:56:14,325 INFO L854 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 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-16 21:56:14,325 INFO L861 garLoopResultBuilder]: At program point L9558(line 9558) the Hoare annotation is: true [2021-11-16 21:56:14,325 INFO L858 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2021-11-16 21:56:14,325 INFO L858 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2021-11-16 21:56:14,325 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2021-11-16 21:56:14,326 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-11-16 21:56:14,326 INFO L854 garLoopResultBuilder]: At program point L9551(line 9551) the Hoare annotation is: false [2021-11-16 21:56:14,326 INFO L858 garLoopResultBuilder]: For program point L9551-1(line 9551) no Hoare annotation was computed. [2021-11-16 21:56:14,326 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-11-16 21:56:14,326 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2021-11-16 21:56:14,326 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-16 21:56:14,326 INFO L858 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2021-11-16 21:56:14,326 INFO L854 garLoopResultBuilder]: At program point L6612(line 6612) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 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-16 21:56:14,326 INFO L854 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 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-16 21:56:14,327 INFO L858 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2021-11-16 21:56:14,327 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-11-16 21:56:14,327 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2021-11-16 21:56:14,327 INFO L858 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2021-11-16 21:56:14,327 INFO L854 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 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-16 21:56:14,327 INFO L858 garLoopResultBuilder]: For program point L9388(line 9388) no Hoare annotation was computed. [2021-11-16 21:56:14,327 INFO L854 garLoopResultBuilder]: At program point L9388-2(line 9388) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse8 16)) (.cse2 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (* .cse2 (- 1))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse5 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (* (div .cse2 18446744073709551616) 18446744073709551616) .cse3) 18446744073709551616)))) .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse7 (= |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)) (and .cse0 (<= 0 (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5 .cse6 .cse7))))) [2021-11-16 21:56:14,327 INFO L854 garLoopResultBuilder]: At program point L9553(line 9553) the Hoare annotation is: false [2021-11-16 21:56:14,327 INFO L854 garLoopResultBuilder]: At program point L9553-1(line 9553) the Hoare annotation is: false [2021-11-16 21:56:14,328 INFO L858 garLoopResultBuilder]: For program point L9553-2(line 9553) no Hoare annotation was computed. [2021-11-16 21:56:14,328 INFO L858 garLoopResultBuilder]: For program point L9388-3(line 9388) no Hoare annotation was computed. [2021-11-16 21:56:14,328 INFO L854 garLoopResultBuilder]: At program point L9388-4(line 9388) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse8 16)) (.cse2 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (* .cse2 (- 1))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse5 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (* (div .cse2 18446744073709551616) 18446744073709551616) .cse3) 18446744073709551616)))) .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse7 (= |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)) (and .cse0 (<= 0 (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5 .cse6 .cse7))))) [2021-11-16 21:56:14,328 INFO L858 garLoopResultBuilder]: For program point L9388-5(line 9388) no Hoare annotation was computed. [2021-11-16 21:56:14,328 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-16 21:56:14,328 INFO L858 garLoopResultBuilder]: For program point L9389(line 9389) no Hoare annotation was computed. [2021-11-16 21:56:14,328 INFO L854 garLoopResultBuilder]: At program point L9389-2(line 9389) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse8 16)) (.cse2 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (* .cse2 (- 1))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse5 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (* (div .cse2 18446744073709551616) 18446744073709551616) .cse3) 18446744073709551616)))) .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse7 (= |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)) (and .cse0 (<= 0 (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5 .cse6 .cse7))))) [2021-11-16 21:56:14,328 INFO L854 garLoopResultBuilder]: At program point L9546(line 9546) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 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)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 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-16 21:56:14,329 INFO L858 garLoopResultBuilder]: For program point L9389-3(line 9389) no Hoare annotation was computed. [2021-11-16 21:56:14,329 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2021-11-16 21:56:14,329 INFO L858 garLoopResultBuilder]: For program point L9538(lines 9538 9557) no Hoare annotation was computed. [2021-11-16 21:56:14,329 INFO L854 garLoopResultBuilder]: At program point L9546-1(line 9546) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse3 (select .cse8 16)) (.cse4 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse5 (* .cse4 (- 1))) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse7 (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616))))) (.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1351#1| 0) .cse0 .cse1 (<= 0 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1351#1|)) (and .cse2 (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse3 (* (div .cse4 18446744073709551616) 18446744073709551616) .cse5) 18446744073709551616)))) .cse6 .cse7 .cse0 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse1 (= |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)) (and .cse2 (<= 0 (+ .cse4 (* 18446744073709551616 (div .cse5 18446744073709551616)))) .cse6 .cse7 .cse0 .cse1))))) [2021-11-16 21:56:14,329 INFO L854 garLoopResultBuilder]: At program point L9389-4(line 9389) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse8 16)) (.cse2 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (* .cse2 (- 1))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse5 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (* (div .cse2 18446744073709551616) 18446744073709551616) .cse3) 18446744073709551616)))) .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse7 (= |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)) (and .cse0 (<= 0 (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5 .cse6 .cse7))))) [2021-11-16 21:56:14,329 INFO L858 garLoopResultBuilder]: For program point L9546-2(line 9546) no Hoare annotation was computed. [2021-11-16 21:56:14,329 INFO L858 garLoopResultBuilder]: For program point L9389-5(line 9389) no Hoare annotation was computed. [2021-11-16 21:56:14,329 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-11-16 21:56:14,329 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-16 21:56:14,330 INFO L858 garLoopResultBuilder]: For program point L9390(lines 9390 9398) no Hoare annotation was computed. [2021-11-16 21:56:14,330 INFO L861 garLoopResultBuilder]: At program point L9539(line 9539) the Hoare annotation is: true [2021-11-16 21:56:14,330 INFO L858 garLoopResultBuilder]: For program point L9539-1(lines 9539 9540) no Hoare annotation was computed. [2021-11-16 21:56:14,330 INFO L861 garLoopResultBuilder]: At program point L9539-2(line 9539) the Hoare annotation is: true [2021-11-16 21:56:14,330 INFO L858 garLoopResultBuilder]: For program point L9539-3(line 9539) no Hoare annotation was computed. [2021-11-16 21:56:14,330 INFO L858 garLoopResultBuilder]: For program point L9539-5(lines 9539 9540) no Hoare annotation was computed. [2021-11-16 21:56:14,330 INFO L854 garLoopResultBuilder]: At program point L9556(line 9556) the Hoare annotation is: (and (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1360#1| 1) (<= 1 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1360#1|) (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-16 21:56:14,330 INFO L858 garLoopResultBuilder]: For program point L9556-1(line 9556) no Hoare annotation was computed. [2021-11-16 21:56:14,330 INFO L858 garLoopResultBuilder]: For program point L9399(lines 9399 9407) no Hoare annotation was computed. [2021-11-16 21:56:14,331 INFO L854 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse8 16)) (.cse2 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (* .cse2 (- 1))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse5 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (* (div .cse2 18446744073709551616) 18446744073709551616) .cse3) 18446744073709551616)))) .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse7 (= |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)) (and .cse0 (<= 0 (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5 .cse6 .cse7))))) [2021-11-16 21:56:14,331 INFO L858 garLoopResultBuilder]: For program point L9548-1(lines 9548 9549) no Hoare annotation was computed. [2021-11-16 21:56:14,331 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) (= |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-16 21:56:14,331 INFO L858 garLoopResultBuilder]: For program point L9548-3(lines 9548 9549) no Hoare annotation was computed. [2021-11-16 21:56:14,331 INFO L858 garLoopResultBuilder]: For program point L9548-4(lines 9548 9554) no Hoare annotation was computed. [2021-11-16 21:56:14,331 INFO L854 garLoopResultBuilder]: At program point L9548-6(lines 9548 9554) the Hoare annotation is: (let ((.cse6 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse5 (select .cse6 16)) (.cse0 (select .cse6 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse1 (* .cse0 (- 1))) (.cse2 (<= .cse5 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse5) 18446744073709551616))))) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and (<= 0 (+ .cse0 (* 18446744073709551616 (div .cse1 18446744073709551616)))) .cse2 .cse3 .cse4) (and (<= .cse5 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse5 (* (div .cse0 18446744073709551616) 18446744073709551616) .cse1) 18446744073709551616)))) .cse2 .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse4 (= |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-16 21:56:14,331 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-16 21:56:14,331 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-11-16 21:56:14,332 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-16 21:56:14,332 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-11-16 21:56:14,332 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-11-16 21:56:14,332 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-16 21:56:14,334 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:56:14,335 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 21:56:14,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:56:14,344 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2021-11-16 21:56:14,345 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:56:14,345 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2021-11-16 21:56:14,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 09:56:14 BoogieIcfgContainer [2021-11-16 21:56:14,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 21:56:14,348 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 21:56:14,348 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 21:56:14,348 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 21:56:14,348 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:54:46" (3/4) ... [2021-11-16 21:56:14,350 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-16 21:56:14,354 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2021-11-16 21:56:14,354 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-11-16 21:56:14,354 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2021-11-16 21:56:14,354 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-11-16 21:56:14,354 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-11-16 21:56:14,354 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-11-16 21:56:14,355 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-11-16 21:56:14,355 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-11-16 21:56:14,355 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-11-16 21:56:14,355 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2021-11-16 21:56:14,363 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2021-11-16 21:56:14,364 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2021-11-16 21:56:14,365 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-11-16 21:56:14,365 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-16 21:56:14,366 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-11-16 21:56:14,367 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-16 21:56:14,368 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-16 21:56:14,368 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-16 21:56:14,387 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(\old(max_size) == 16) [2021-11-16 21:56:14,952 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-16 21:56:14,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 21:56:14,953 INFO L158 Benchmark]: Toolchain (without parser) took 92071.27ms. Allocated memory was 88.1MB in the beginning and 331.4MB in the end (delta: 243.3MB). Free memory was 59.4MB in the beginning and 84.1MB in the end (delta: -24.7MB). Peak memory consumption was 247.5MB. Max. memory is 16.1GB. [2021-11-16 21:56:14,953 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 73.4MB. Free memory was 45.9MB in the beginning and 45.8MB in the end (delta: 44.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 21:56:14,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1951.25ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 59.3MB in the beginning and 57.2MB in the end (delta: 2.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2021-11-16 21:56:14,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 175.99ms. Allocated memory was 132.1MB in the beginning and 188.7MB in the end (delta: 56.6MB). Free memory was 56.5MB in the beginning and 134.2MB in the end (delta: -77.6MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2021-11-16 21:56:14,954 INFO L158 Benchmark]: Boogie Preprocessor took 54.90ms. Allocated memory is still 188.7MB. Free memory was 134.2MB in the beginning and 127.9MB in the end (delta: 6.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-16 21:56:14,954 INFO L158 Benchmark]: RCFGBuilder took 1215.37ms. Allocated memory is still 188.7MB. Free memory was 127.9MB in the beginning and 95.0MB in the end (delta: 33.0MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2021-11-16 21:56:14,954 INFO L158 Benchmark]: TraceAbstraction took 88062.16ms. Allocated memory was 188.7MB in the beginning and 331.4MB in the end (delta: 142.6MB). Free memory was 93.9MB in the beginning and 135.2MB in the end (delta: -41.3MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. [2021-11-16 21:56:14,955 INFO L158 Benchmark]: Witness Printer took 605.09ms. Allocated memory is still 331.4MB. Free memory was 135.2MB in the beginning and 84.1MB in the end (delta: 51.1MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2021-11-16 21:56:14,956 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.20ms. Allocated memory is still 73.4MB. Free memory was 45.9MB in the beginning and 45.8MB in the end (delta: 44.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1951.25ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 59.3MB in the beginning and 57.2MB in the end (delta: 2.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 175.99ms. Allocated memory was 132.1MB in the beginning and 188.7MB in the end (delta: 56.6MB). Free memory was 56.5MB in the beginning and 134.2MB in the end (delta: -77.6MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.90ms. Allocated memory is still 188.7MB. Free memory was 134.2MB in the beginning and 127.9MB in the end (delta: 6.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1215.37ms. Allocated memory is still 188.7MB. Free memory was 127.9MB in the beginning and 95.0MB in the end (delta: 33.0MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * TraceAbstraction took 88062.16ms. Allocated memory was 188.7MB in the beginning and 331.4MB in the end (delta: 142.6MB). Free memory was 93.9MB in the beginning and 135.2MB in the end (delta: -41.3MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. * Witness Printer took 605.09ms. Allocated memory is still 331.4MB. Free memory was 135.2MB in the beginning and 84.1MB in the end (delta: 51.1MB). Peak memory consumption was 79.5MB. 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: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR - 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: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR * 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 88.0s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 65.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 2198 SdHoareTripleChecker+Valid, 61.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2051 mSDsluCounter, 13466 SdHoareTripleChecker+Invalid, 58.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1146 IncrementalHoareTripleChecker+Unchecked, 10682 mSDsCounter, 680 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7295 IncrementalHoareTripleChecker+Invalid, 9139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 680 mSolverCounterUnsat, 2784 mSDtfsCounter, 7295 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1992 GetRequests, 1658 SyntacticMatches, 30 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=13, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 175 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 440 PreInvPairs, 484 NumberOfFragments, 1566 HoareAnnotationTreeSize, 440 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 45 FomulaSimplificationsInter, 3189 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 2596 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2983 ConstructedInterpolants, 101 QuantifiedInterpolants, 16029 SizeOfPredicates, 75 NumberOfNonLiveVariables, 23130 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 31 InterpolantComputations, 14 PerfectInterpolantSequences, 1856/2033 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 1 specifications checked. All of them hold - InvariantResult [Line: 6598]: Loop Invariant Derived loop invariant: ((str == 0 && str == 0) && !(buf == 0)) && buf == 0 - InvariantResult [Line: 9558]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9386]: Loop Invariant [2021-11-16 21:56:14,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:56:14,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2021-11-16 21:56:14,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:56:14,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR Derived loop invariant: ((((((((str == 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) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(buf == 0)) && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR] == 0)) && buf == 0) && buf == buf) && buf == 0) || (((((str == 0 && 0 <= unknown-#memory_int-unknown[buf][buf] + 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] * -1 / 18446744073709551616)) && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(buf == 0)) && buf == 0) - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: (((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(\old(max_size) == 16) RESULT: Ultimate proved your program to be correct! [2021-11-16 21:56:14,983 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