./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 ff03de63 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.2-dev-ff03de6 [2021-12-21 15:37:53,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 15:37:53,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 15:37:53,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 15:37:53,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 15:37:53,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 15:37:53,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 15:37:53,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 15:37:53,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 15:37:53,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 15:37:53,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 15:37:53,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 15:37:53,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 15:37:53,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 15:37:53,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 15:37:53,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 15:37:53,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 15:37:53,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 15:37:53,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 15:37:53,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 15:37:53,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 15:37:53,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 15:37:53,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 15:37:53,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 15:37:53,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 15:37:53,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 15:37:53,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 15:37:53,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 15:37:53,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 15:37:53,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 15:37:53,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 15:37:53,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 15:37:53,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 15:37:53,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 15:37:53,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 15:37:53,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 15:37:53,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 15:37:53,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 15:37:53,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 15:37:53,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 15:37:53,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 15:37:53,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-21 15:37:53,594 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 15:37:53,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 15:37:53,595 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 15:37:53,595 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 15:37:53,596 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 15:37:53,596 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 15:37:53,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 15:37:53,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 15:37:53,597 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 15:37:53,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 15:37:53,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 15:37:53,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 15:37:53,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 15:37:53,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 15:37:53,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 15:37:53,599 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 15:37:53,599 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 15:37:53,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 15:37:53,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 15:37:53,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 15:37:53,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 15:37:53,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:37:53,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 15:37:53,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 15:37:53,600 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 15:37:53,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 15:37:53,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 15:37:53,602 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 15:37:53,602 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 15:37:53,602 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 15:37:53,602 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 15:37:53,602 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-12-21 15:37:53,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 15:37:53,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 15:37:53,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 15:37:53,793 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 15:37:53,793 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 15:37:53,794 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-12-21 15:37:53,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/261e1d17c/0043e2ed173a43f7b45d5d86f7440dfc/FLAGe52bff733 [2021-12-21 15:37:54,501 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 15:37:54,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2021-12-21 15:37:54,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/261e1d17c/0043e2ed173a43f7b45d5d86f7440dfc/FLAGe52bff733 [2021-12-21 15:37:54,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/261e1d17c/0043e2ed173a43f7b45d5d86f7440dfc [2021-12-21 15:37:54,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 15:37:54,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 15:37:54,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 15:37:54,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 15:37:54,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 15:37:54,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:37:54" (1/1) ... [2021-12-21 15:37:54,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@744c8ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:37:54, skipping insertion in model container [2021-12-21 15:37:54,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:37:54" (1/1) ... [2021-12-21 15:37:54,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 15:37:54,971 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 15:37:55,151 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-12-21 15:37:55,156 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-12-21 15:37:55,698 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:55,699 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:55,699 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:55,700 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:55,700 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:55,709 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:55,711 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:55,712 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:55,712 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:55,940 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-21 15:37:55,941 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-21 15:37:55,942 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-21 15:37:55,943 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-21 15:37:55,944 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-21 15:37:55,946 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-21 15:37:55,946 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-21 15:37:55,947 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-21 15:37:55,947 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-21 15:37:55,948 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-21 15:37:56,049 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-21 15:37:56,119 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:56,119 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:56,262 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:37:56,309 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 15:37:56,328 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-12-21 15:37:56,329 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-12-21 15:37:56,364 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:56,366 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:56,367 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:56,367 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:56,368 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:56,370 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:56,372 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:56,372 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:56,372 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:56,402 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-21 15:37:56,403 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-21 15:37:56,403 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-21 15:37:56,403 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-21 15:37:56,404 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-21 15:37:56,405 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-21 15:37:56,405 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-21 15:37:56,405 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-21 15:37:56,406 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-21 15:37:56,406 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-21 15:37:56,422 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-21 15:37:56,502 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:56,503 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-21 15:37:56,534 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:37:56,692 INFO L208 MainTranslator]: Completed translation [2021-12-21 15:37:56,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:37:56 WrapperNode [2021-12-21 15:37:56,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 15:37:56,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 15:37:56,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 15:37:56,694 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 15:37:56,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:37:56" (1/1) ... [2021-12-21 15:37:56,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:37:56" (1/1) ... [2021-12-21 15:37:56,869 INFO L137 Inliner]: procedures = 693, calls = 2792, calls flagged for inlining = 61, calls inlined = 8, statements flattened = 879 [2021-12-21 15:37:56,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 15:37:56,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 15:37:56,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 15:37:56,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 15:37:56,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:37:56" (1/1) ... [2021-12-21 15:37:56,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:37:56" (1/1) ... [2021-12-21 15:37:56,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:37:56" (1/1) ... [2021-12-21 15:37:56,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:37:56" (1/1) ... [2021-12-21 15:37:56,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:37:56" (1/1) ... [2021-12-21 15:37:56,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:37:56" (1/1) ... [2021-12-21 15:37:56,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:37:56" (1/1) ... [2021-12-21 15:37:56,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 15:37:56,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 15:37:56,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 15:37:56,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 15:37:56,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:37:56" (1/1) ... [2021-12-21 15:37:56,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:37:56,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:37:56,976 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-12-21 15:37:57,005 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-12-21 15:37:57,019 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2021-12-21 15:37:57,019 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2021-12-21 15:37:57,020 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-12-21 15:37:57,020 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-12-21 15:37:57,020 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2021-12-21 15:37:57,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2021-12-21 15:37:57,020 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-21 15:37:57,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 15:37:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-21 15:37:57,021 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-21 15:37:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 15:37:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-21 15:37:57,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-21 15:37:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 15:37:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 15:37:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 15:37:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 15:37:57,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 15:37:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-21 15:37:57,023 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-21 15:37:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-21 15:37:57,024 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-21 15:37:57,024 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-21 15:37:57,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 15:37:57,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 15:37:57,024 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2021-12-21 15:37:57,025 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2021-12-21 15:37:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 15:37:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-21 15:37:57,025 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-21 15:37:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-21 15:37:57,025 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-21 15:37:57,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 15:37:57,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 15:37:57,279 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 15:37:57,281 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 15:37:58,067 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 15:37:58,072 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 15:37:58,072 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 15:37:58,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:37:58 BoogieIcfgContainer [2021-12-21 15:37:58,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 15:37:58,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 15:37:58,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 15:37:58,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 15:37:58,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:37:54" (1/3) ... [2021-12-21 15:37:58,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5759d63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:37:58, skipping insertion in model container [2021-12-21 15:37:58,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:37:56" (2/3) ... [2021-12-21 15:37:58,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5759d63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:37:58, skipping insertion in model container [2021-12-21 15:37:58,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:37:58" (3/3) ... [2021-12-21 15:37:58,078 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_buf_harness.i [2021-12-21 15:37:58,081 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 15:37:58,082 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 15:37:58,108 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 15:37:58,111 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-12-21 15:37:58,112 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 15:37:58,122 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-12-21 15:37:58,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-21 15:37:58,128 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:37:58,128 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-12-21 15:37:58,129 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:37:58,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:37:58,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1812998439, now seen corresponding path program 1 times [2021-12-21 15:37:58,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:37:58,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028206932] [2021-12-21 15:37:58,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:37:58,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:37:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:58,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:37:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:58,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:37:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:58,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:37:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:58,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:37:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:58,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:37:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:58,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:37:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:58,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-21 15:37:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:58,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-21 15:37:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:58,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-21 15:37:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:58,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-21 15:37:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:58,618 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-21 15:37:58,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:37:58,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028206932] [2021-12-21 15:37:58,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028206932] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:37:58,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:37:58,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 15:37:58,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8768287] [2021-12-21 15:37:58,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:37:58,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 15:37:58,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:37:58,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 15:37:58,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 15:37:58,649 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-12-21 15:37:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:37:58,795 INFO L93 Difference]: Finished difference Result 253 states and 352 transitions. [2021-12-21 15:37:58,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 15:37:58,797 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-12-21 15:37:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:37:58,803 INFO L225 Difference]: With dead ends: 253 [2021-12-21 15:37:58,803 INFO L226 Difference]: Without dead ends: 126 [2021-12-21 15:37:58,805 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-12-21 15:37:58,807 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 55 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:37:58,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 219 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 15:37:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-21 15:37:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-21 15:37:58,836 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-12-21 15:37:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2021-12-21 15:37:58,838 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 72 [2021-12-21 15:37:58,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:37:58,839 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2021-12-21 15:37:58,839 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-12-21 15:37:58,839 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2021-12-21 15:37:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-21 15:37:58,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:37:58,842 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-12-21 15:37:58,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 15:37:58,842 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:37:58,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:37:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash -795992417, now seen corresponding path program 1 times [2021-12-21 15:37:58,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:37:58,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156303163] [2021-12-21 15:37:58,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:37:58,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:37:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:37:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:37:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:37:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:37:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:37:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:37:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-21 15:37:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-21 15:37:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-21 15:37:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-21 15:37:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-21 15:37:59,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:37:59,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156303163] [2021-12-21 15:37:59,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156303163] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:37:59,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:37:59,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:37:59,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979694875] [2021-12-21 15:37:59,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:37:59,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:37:59,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:37:59,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:37:59,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:37:59,104 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-12-21 15:37:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:37:59,332 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2021-12-21 15:37:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 15:37:59,333 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-12-21 15:37:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:37:59,335 INFO L225 Difference]: With dead ends: 213 [2021-12-21 15:37:59,335 INFO L226 Difference]: Without dead ends: 129 [2021-12-21 15:37:59,336 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-12-21 15:37:59,337 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 108 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:37:59,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 456 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:37:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-21 15:37:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-21 15:37:59,345 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-12-21 15:37:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 170 transitions. [2021-12-21 15:37:59,346 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 170 transitions. Word has length 72 [2021-12-21 15:37:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:37:59,346 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 170 transitions. [2021-12-21 15:37:59,346 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-12-21 15:37:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 170 transitions. [2021-12-21 15:37:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-21 15:37:59,348 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:37:59,349 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-12-21 15:37:59,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 15:37:59,349 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:37:59,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:37:59,349 INFO L85 PathProgramCache]: Analyzing trace with hash -565003148, now seen corresponding path program 1 times [2021-12-21 15:37:59,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:37:59,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700579218] [2021-12-21 15:37:59,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:37:59,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:37:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:37:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:37:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:37:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:37:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:37:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:37:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-21 15:37:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:37:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-21 15:37:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 15:37:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:37:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-21 15:37:59,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:37:59,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700579218] [2021-12-21 15:37:59,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700579218] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:37:59,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:37:59,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 15:37:59,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890905282] [2021-12-21 15:37:59,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:37:59,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:37:59,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:37:59,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:37:59,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-21 15:37:59,587 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-12-21 15:37:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:37:59,948 INFO L93 Difference]: Finished difference Result 225 states and 299 transitions. [2021-12-21 15:37:59,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:37:59,949 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-12-21 15:37:59,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:37:59,950 INFO L225 Difference]: With dead ends: 225 [2021-12-21 15:37:59,950 INFO L226 Difference]: Without dead ends: 167 [2021-12-21 15:37:59,951 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-12-21 15:37:59,951 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 226 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 15:37:59,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 665 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 15:37:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-21 15:37:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 146. [2021-12-21 15:37:59,964 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-12-21 15:37:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 194 transitions. [2021-12-21 15:37:59,965 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 194 transitions. Word has length 78 [2021-12-21 15:37:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:37:59,966 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 194 transitions. [2021-12-21 15:37:59,966 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-12-21 15:37:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 194 transitions. [2021-12-21 15:37:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-21 15:37:59,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:37:59,971 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-12-21 15:37:59,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 15:37:59,972 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:37:59,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:37:59,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1924525814, now seen corresponding path program 1 times [2021-12-21 15:37:59,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:37:59,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668770007] [2021-12-21 15:37:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:37:59,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:38:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-21 15:38:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-21 15:38:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 15:38:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-21 15:38:00,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:00,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668770007] [2021-12-21 15:38:00,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668770007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:00,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:00,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 15:38:00,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895985292] [2021-12-21 15:38:00,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:00,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 15:38:00,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:00,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 15:38:00,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 15:38:00,246 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-12-21 15:38:00,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:00,545 INFO L93 Difference]: Finished difference Result 250 states and 338 transitions. [2021-12-21 15:38:00,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 15:38:00,546 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-12-21 15:38:00,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:00,547 INFO L225 Difference]: With dead ends: 250 [2021-12-21 15:38:00,548 INFO L226 Difference]: Without dead ends: 194 [2021-12-21 15:38:00,548 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-12-21 15:38:00,549 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 67 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:00,549 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.3s Time] [2021-12-21 15:38:00,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-21 15:38:00,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2021-12-21 15:38:00,566 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-12-21 15:38:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 266 transitions. [2021-12-21 15:38:00,568 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 266 transitions. Word has length 78 [2021-12-21 15:38:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:00,569 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 266 transitions. [2021-12-21 15:38:00,569 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-12-21 15:38:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 266 transitions. [2021-12-21 15:38:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-21 15:38:00,575 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:00,575 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-12-21 15:38:00,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 15:38:00,576 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:00,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:00,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2071762423, now seen corresponding path program 1 times [2021-12-21 15:38:00,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:00,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305503093] [2021-12-21 15:38:00,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:00,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:38:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-21 15:38:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-21 15:38:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 15:38:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-21 15:38:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-21 15:38:00,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:00,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305503093] [2021-12-21 15:38:00,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305503093] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:00,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:00,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 15:38:00,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761606655] [2021-12-21 15:38:00,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:00,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:38:00,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:00,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:38:00,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-21 15:38:00,810 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-12-21 15:38:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:01,185 INFO L93 Difference]: Finished difference Result 203 states and 282 transitions. [2021-12-21 15:38:01,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:38:01,186 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-12-21 15:38:01,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:01,188 INFO L225 Difference]: With dead ends: 203 [2021-12-21 15:38:01,188 INFO L226 Difference]: Without dead ends: 196 [2021-12-21 15:38:01,189 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-12-21 15:38:01,189 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 80 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:01,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 870 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 15:38:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-21 15:38:01,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-12-21 15:38:01,200 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-12-21 15:38:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 275 transitions. [2021-12-21 15:38:01,201 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 275 transitions. Word has length 90 [2021-12-21 15:38:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:01,201 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 275 transitions. [2021-12-21 15:38:01,202 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-12-21 15:38:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 275 transitions. [2021-12-21 15:38:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-21 15:38:01,203 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:01,203 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-12-21 15:38:01,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 15:38:01,203 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:01,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:01,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1055189439, now seen corresponding path program 1 times [2021-12-21 15:38:01,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:01,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800063007] [2021-12-21 15:38:01,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:01,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:01,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:01,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:38:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:01,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:01,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:01,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:01,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-21 15:38:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:01,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:01,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-21 15:38:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:01,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 15:38:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:01,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-21 15:38:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-21 15:38:01,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:01,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800063007] [2021-12-21 15:38:01,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800063007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:01,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:01,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:38:01,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541144818] [2021-12-21 15:38:01,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:01,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:38:01,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:38:01,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:38:01,531 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-12-21 15:38:01,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:01,895 INFO L93 Difference]: Finished difference Result 362 states and 524 transitions. [2021-12-21 15:38:01,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:38:01,896 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-12-21 15:38:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:01,898 INFO L225 Difference]: With dead ends: 362 [2021-12-21 15:38:01,898 INFO L226 Difference]: Without dead ends: 221 [2021-12-21 15:38:01,899 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-12-21 15:38:01,899 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 120 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:01,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 516 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 15:38:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-21 15:38:01,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2021-12-21 15:38:01,910 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-12-21 15:38:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 282 transitions. [2021-12-21 15:38:01,912 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 282 transitions. Word has length 94 [2021-12-21 15:38:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:01,912 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 282 transitions. [2021-12-21 15:38:01,912 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-12-21 15:38:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 282 transitions. [2021-12-21 15:38:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-21 15:38:01,913 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:01,914 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-12-21 15:38:01,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 15:38:01,914 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:01,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:01,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1313354877, now seen corresponding path program 1 times [2021-12-21 15:38:01,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:01,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106872362] [2021-12-21 15:38:01,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:01,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:02,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:02,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:38:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:02,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:02,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:02,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:02,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-21 15:38:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:02,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:02,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-21 15:38:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:02,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 15:38:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:02,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-21 15:38:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-21 15:38:02,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:02,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106872362] [2021-12-21 15:38:02,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106872362] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:02,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083367801] [2021-12-21 15:38:02,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:02,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:02,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:02,336 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-12-21 15:38:02,337 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-12-21 15:38:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:02,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 2607 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-21 15:38:02,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:02,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 15:38:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-21 15:38:03,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:38:03,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083367801] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:03,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:38:03,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2021-12-21 15:38:03,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460320874] [2021-12-21 15:38:03,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:03,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:38:03,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:03,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:38:03,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-12-21 15:38:03,095 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-12-21 15:38:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:03,124 INFO L93 Difference]: Finished difference Result 373 states and 521 transitions. [2021-12-21 15:38:03,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:38:03,125 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-12-21 15:38:03,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:03,126 INFO L225 Difference]: With dead ends: 373 [2021-12-21 15:38:03,126 INFO L226 Difference]: Without dead ends: 220 [2021-12-21 15:38:03,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-12-21 15:38:03,127 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-12-21 15:38:03,127 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-12-21 15:38:03,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-21 15:38:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-12-21 15:38:03,134 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-12-21 15:38:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 305 transitions. [2021-12-21 15:38:03,136 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 305 transitions. Word has length 94 [2021-12-21 15:38:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:03,136 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 305 transitions. [2021-12-21 15:38:03,136 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-12-21 15:38:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 305 transitions. [2021-12-21 15:38:03,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-21 15:38:03,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:03,137 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-12-21 15:38:03,160 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-12-21 15:38:03,357 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-12-21 15:38:03,357 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:03,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:03,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1354029627, now seen corresponding path program 1 times [2021-12-21 15:38:03,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:03,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097393194] [2021-12-21 15:38:03,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:03,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:03,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:03,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:38:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:03,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:03,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:03,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-21 15:38:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:03,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:03,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-21 15:38:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:03,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 15:38:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:03,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-21 15:38:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-21 15:38:03,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:03,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097393194] [2021-12-21 15:38:03,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097393194] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:03,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727467140] [2021-12-21 15:38:03,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:03,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:03,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:03,494 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-12-21 15:38:03,495 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-12-21 15:38:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:03,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 15:38:03,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-21 15:38:03,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:38:03,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727467140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:03,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:38:03,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-21 15:38:03,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738037114] [2021-12-21 15:38:03,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:03,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 15:38:03,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:03,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 15:38:03,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 15:38:03,994 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-12-21 15:38:04,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:04,015 INFO L93 Difference]: Finished difference Result 379 states and 533 transitions. [2021-12-21 15:38:04,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 15:38:04,016 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-12-21 15:38:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:04,029 INFO L225 Difference]: With dead ends: 379 [2021-12-21 15:38:04,030 INFO L226 Difference]: Without dead ends: 229 [2021-12-21 15:38:04,030 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-12-21 15:38:04,031 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-12-21 15:38:04,032 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-12-21 15:38:04,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-21 15:38:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2021-12-21 15:38:04,040 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-12-21 15:38:04,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2021-12-21 15:38:04,041 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 94 [2021-12-21 15:38:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:04,041 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2021-12-21 15:38:04,042 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-12-21 15:38:04,042 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2021-12-21 15:38:04,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-21 15:38:04,043 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:04,043 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-12-21 15:38:04,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 15:38:04,263 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-12-21 15:38:04,263 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:04,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:04,264 INFO L85 PathProgramCache]: Analyzing trace with hash -805510601, now seen corresponding path program 1 times [2021-12-21 15:38:04,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:04,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688011842] [2021-12-21 15:38:04,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:04,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:04,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:04,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:38:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:04,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:04,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:04,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:04,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:04,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-21 15:38:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:04,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-21 15:38:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:04,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-21 15:38:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:04,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-21 15:38:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:04,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 15:38:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-21 15:38:04,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:04,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688011842] [2021-12-21 15:38:04,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688011842] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:04,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817013978] [2021-12-21 15:38:04,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:04,608 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:04,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:04,624 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-12-21 15:38:04,672 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-12-21 15:38:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:05,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-21 15:38:05,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-21 15:38:05,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:38:05,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817013978] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:05,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:38:05,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2021-12-21 15:38:05,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335905505] [2021-12-21 15:38:05,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:05,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:38:05,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:05,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:38:05,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-21 15:38:05,245 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-12-21 15:38:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:05,369 INFO L93 Difference]: Finished difference Result 367 states and 515 transitions. [2021-12-21 15:38:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:38:05,370 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-12-21 15:38:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:05,372 INFO L225 Difference]: With dead ends: 367 [2021-12-21 15:38:05,372 INFO L226 Difference]: Without dead ends: 217 [2021-12-21 15:38:05,373 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-12-21 15:38:05,374 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-12-21 15:38:05,375 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-12-21 15:38:05,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-21 15:38:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-12-21 15:38:05,389 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-12-21 15:38:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 303 transitions. [2021-12-21 15:38:05,391 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 303 transitions. Word has length 98 [2021-12-21 15:38:05,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:05,391 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 303 transitions. [2021-12-21 15:38:05,391 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-12-21 15:38:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 303 transitions. [2021-12-21 15:38:05,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-21 15:38:05,393 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:05,393 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-12-21 15:38:05,414 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-12-21 15:38:05,603 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-12-21 15:38:05,604 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:05,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:05,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1170955310, now seen corresponding path program 1 times [2021-12-21 15:38:05,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:05,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283991287] [2021-12-21 15:38:05,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:05,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:05,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:05,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:38:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:05,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:05,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:05,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:05,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:05,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:05,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:05,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:38:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:05,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:05,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 15:38:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-21 15:38:05,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:05,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283991287] [2021-12-21 15:38:05,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283991287] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:05,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585321201] [2021-12-21 15:38:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:05,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:05,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:05,908 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-12-21 15:38:05,923 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-12-21 15:38:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:06,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 2619 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 15:38:06,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-21 15:38:06,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:38:06,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585321201] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:06,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:38:06,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-21 15:38:06,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125706262] [2021-12-21 15:38:06,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:06,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 15:38:06,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:06,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 15:38:06,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 15:38:06,490 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-12-21 15:38:06,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:06,523 INFO L93 Difference]: Finished difference Result 377 states and 535 transitions. [2021-12-21 15:38:06,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 15:38:06,524 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-12-21 15:38:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:06,525 INFO L225 Difference]: With dead ends: 377 [2021-12-21 15:38:06,525 INFO L226 Difference]: Without dead ends: 220 [2021-12-21 15:38:06,525 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-12-21 15:38:06,526 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-12-21 15:38: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-12-21 15:38:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-21 15:38:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2021-12-21 15:38: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-12-21 15:38:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 301 transitions. [2021-12-21 15:38:06,533 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 301 transitions. Word has length 100 [2021-12-21 15:38:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:06,533 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 301 transitions. [2021-12-21 15:38:06,533 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-12-21 15:38:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 301 transitions. [2021-12-21 15:38:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-21 15:38:06,534 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:06,534 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-12-21 15:38:06,571 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-12-21 15:38: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-12-21 15:38:06,752 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:06,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1786047986, now seen corresponding path program 1 times [2021-12-21 15:38:06,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:06,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252132023] [2021-12-21 15:38:06,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:06,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:06,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:06,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:38:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:06,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:06,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:06,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:06,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:06,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:06,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:06,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:38:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:06,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:06,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 15:38:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-21 15:38:06,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:06,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252132023] [2021-12-21 15:38:06,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252132023] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:06,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975865639] [2021-12-21 15:38:06,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:06,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:06,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:06,973 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-12-21 15:38:06,974 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-12-21 15:38:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:07,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 2621 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 15:38:07,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-21 15:38:07,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 15:38:07,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975865639] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:07,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:38:07,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-21 15:38:07,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82883804] [2021-12-21 15:38:07,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:07,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 15:38:07,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:07,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 15:38:07,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 15:38:07,460 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-12-21 15:38:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:07,477 INFO L93 Difference]: Finished difference Result 383 states and 546 transitions. [2021-12-21 15:38:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 15:38:07,478 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-12-21 15:38:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:07,479 INFO L225 Difference]: With dead ends: 383 [2021-12-21 15:38:07,479 INFO L226 Difference]: Without dead ends: 226 [2021-12-21 15:38:07,480 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-12-21 15:38:07,480 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-12-21 15:38:07,480 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-12-21 15:38:07,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-12-21 15:38:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 213. [2021-12-21 15:38:07,486 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-12-21 15:38:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 294 transitions. [2021-12-21 15:38:07,487 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 294 transitions. Word has length 100 [2021-12-21 15:38:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:07,487 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 294 transitions. [2021-12-21 15:38:07,487 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-12-21 15:38:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 294 transitions. [2021-12-21 15:38:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-21 15:38:07,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:07,489 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-12-21 15:38:07,520 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-12-21 15:38:07,709 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-12-21 15:38:07,709 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:07,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:07,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1106775732, now seen corresponding path program 1 times [2021-12-21 15:38:07,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:07,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944818661] [2021-12-21 15:38:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:07,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:07,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:07,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:38:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:38:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 15:38:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-21 15:38:08,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:08,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944818661] [2021-12-21 15:38:08,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944818661] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:08,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176416742] [2021-12-21 15:38:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:08,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:08,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:08,357 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-12-21 15:38:08,358 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-12-21 15:38:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:08,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 2616 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-21 15:38:08,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-21 15:38:09,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:38:09,749 INFO L353 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-21 15:38:09,749 INFO L387 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-12-21 15:38:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-21 15:38:09,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176416742] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 15:38:09,794 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 15:38:09,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 24 [2021-12-21 15:38:09,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930350662] [2021-12-21 15:38:09,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 15:38:09,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-21 15:38:09,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:09,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-21 15:38:09,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2021-12-21 15:38:09,796 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-12-21 15:38:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:10,819 INFO L93 Difference]: Finished difference Result 259 states and 342 transitions. [2021-12-21 15:38:10,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 15:38:10,819 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-12-21 15:38:10,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:10,821 INFO L225 Difference]: With dead ends: 259 [2021-12-21 15:38:10,821 INFO L226 Difference]: Without dead ends: 231 [2021-12-21 15:38:10,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 203 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2021-12-21 15:38:10,822 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 350 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 325 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:10,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 903 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 926 Invalid, 0 Unknown, 325 Unchecked, 0.7s Time] [2021-12-21 15:38:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-21 15:38:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 223. [2021-12-21 15:38:10,830 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-12-21 15:38:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 302 transitions. [2021-12-21 15:38:10,832 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 302 transitions. Word has length 100 [2021-12-21 15:38:10,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:10,832 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 302 transitions. [2021-12-21 15:38:10,832 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-12-21 15:38:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 302 transitions. [2021-12-21 15:38:10,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-21 15:38:10,833 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:10,833 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-12-21 15:38:10,857 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-12-21 15:38:11,047 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-12-21 15:38:11,048 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash 61814546, now seen corresponding path program 1 times [2021-12-21 15:38:11,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:11,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231035294] [2021-12-21 15:38:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:11,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:38:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:38:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 15:38:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-21 15:38:11,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:11,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231035294] [2021-12-21 15:38:11,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231035294] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:11,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740298417] [2021-12-21 15:38:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:11,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:11,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:11,427 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-12-21 15:38:11,451 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-12-21 15:38:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:11,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 2613 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-21 15:38:11,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-21 15:38:12,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:38:13,283 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-21 15:38:13,283 INFO L387 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-12-21 15:38:13,442 INFO L353 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2021-12-21 15:38:13,442 INFO L387 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-12-21 15:38:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-21 15:38:13,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740298417] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 15:38:13,567 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 15:38:13,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 33 [2021-12-21 15:38:13,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88647821] [2021-12-21 15:38:13,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 15:38:13,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-21 15:38:13,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:13,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-21 15:38:13,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2021-12-21 15:38:13,569 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-12-21 15:38:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:15,802 INFO L93 Difference]: Finished difference Result 353 states and 508 transitions. [2021-12-21 15:38:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-21 15:38:15,803 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-12-21 15:38:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:15,805 INFO L225 Difference]: With dead ends: 353 [2021-12-21 15:38:15,805 INFO L226 Difference]: Without dead ends: 341 [2021-12-21 15:38:15,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 193 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=618, Invalid=2804, Unknown=0, NotChecked=0, Total=3422 [2021-12-21 15:38:15,806 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 313 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 574 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:15,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 1823 Invalid, 2396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1747 Invalid, 0 Unknown, 574 Unchecked, 1.1s Time] [2021-12-21 15:38:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-21 15:38:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 334. [2021-12-21 15:38:15,822 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-12-21 15:38:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 480 transitions. [2021-12-21 15:38:15,823 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 480 transitions. Word has length 100 [2021-12-21 15:38:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:15,824 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 480 transitions. [2021-12-21 15:38:15,824 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-12-21 15:38:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 480 transitions. [2021-12-21 15:38:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-21 15:38:15,825 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:15,825 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-12-21 15:38:15,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-21 15:38:16,036 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-12-21 15:38:16,037 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:16,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:16,037 INFO L85 PathProgramCache]: Analyzing trace with hash 319979984, now seen corresponding path program 1 times [2021-12-21 15:38:16,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:16,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489685038] [2021-12-21 15:38:16,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:16,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:38:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:38:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 15:38:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-21 15:38:16,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:16,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489685038] [2021-12-21 15:38:16,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489685038] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:16,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:16,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:38:16,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898284692] [2021-12-21 15:38:16,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:16,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:38:16,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:16,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:38:16,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:38:16,233 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-12-21 15:38:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:16,497 INFO L93 Difference]: Finished difference Result 490 states and 688 transitions. [2021-12-21 15:38:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 15:38:16,498 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-12-21 15:38:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:16,499 INFO L225 Difference]: With dead ends: 490 [2021-12-21 15:38:16,499 INFO L226 Difference]: Without dead ends: 325 [2021-12-21 15:38:16,500 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-12-21 15:38:16,500 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 78 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:16,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 515 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:38:16,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-12-21 15:38:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-12-21 15:38:16,514 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-12-21 15:38:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 469 transitions. [2021-12-21 15:38:16,516 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 469 transitions. Word has length 100 [2021-12-21 15:38:16,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:16,516 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 469 transitions. [2021-12-21 15:38:16,516 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-12-21 15:38:16,516 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 469 transitions. [2021-12-21 15:38:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-21 15:38:16,517 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:16,518 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-12-21 15:38:16,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 15:38:16,518 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:16,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash 102489296, now seen corresponding path program 1 times [2021-12-21 15:38:16,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:16,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364402661] [2021-12-21 15:38:16,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:16,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:38:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:16,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:38:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:17,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 15:38:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-21 15:38:17,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:17,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364402661] [2021-12-21 15:38:17,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364402661] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:17,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417705596] [2021-12-21 15:38:17,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:17,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:17,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:17,121 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-12-21 15:38:17,122 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-12-21 15:38:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:17,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 2618 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-21 15:38:17,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:18,468 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-21 15:38:18,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:38:19,045 INFO L353 Elim1Store]: treesize reduction 39, result has 46.6 percent of original size [2021-12-21 15:38:19,045 INFO L387 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-12-21 15:38:19,262 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-21 15:38:19,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417705596] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 15:38:19,263 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 15:38:19,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 30 [2021-12-21 15:38:19,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110307531] [2021-12-21 15:38:19,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 15:38:19,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-21 15:38:19,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:19,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-21 15:38:19,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2021-12-21 15:38:19,265 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-12-21 15:38:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:20,999 INFO L93 Difference]: Finished difference Result 349 states and 492 transitions. [2021-12-21 15:38:21,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-21 15:38:21,000 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-12-21 15:38:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:21,002 INFO L225 Difference]: With dead ends: 349 [2021-12-21 15:38:21,002 INFO L226 Difference]: Without dead ends: 337 [2021-12-21 15:38:21,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 198 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=382, Invalid=1780, Unknown=0, NotChecked=0, Total=2162 [2021-12-21 15:38:21,003 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 240 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:21,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 994 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1090 Invalid, 0 Unknown, 195 Unchecked, 0.8s Time] [2021-12-21 15:38:21,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-12-21 15:38:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 320. [2021-12-21 15:38:21,075 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-12-21 15:38:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 456 transitions. [2021-12-21 15:38:21,078 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 456 transitions. Word has length 100 [2021-12-21 15:38:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:21,078 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 456 transitions. [2021-12-21 15:38:21,079 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-12-21 15:38:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 456 transitions. [2021-12-21 15:38:21,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-21 15:38:21,080 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:21,080 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-12-21 15:38:21,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-21 15:38:21,300 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-12-21 15:38:21,300 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:21,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:21,300 INFO L85 PathProgramCache]: Analyzing trace with hash -430654057, now seen corresponding path program 1 times [2021-12-21 15:38:21,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:21,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565535070] [2021-12-21 15:38:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:21,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:21,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:21,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:38:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:21,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:21,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:21,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:21,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:21,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:21,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:21,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:38:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:21,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 15:38:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-21 15:38:21,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:21,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565535070] [2021-12-21 15:38:21,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565535070] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:21,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:21,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 15:38:21,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101876687] [2021-12-21 15:38:21,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:21,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:38:21,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:21,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:38:21,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-21 15:38:21,546 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-12-21 15:38:21,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:21,905 INFO L93 Difference]: Finished difference Result 331 states and 473 transitions. [2021-12-21 15:38:21,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 15:38:21,906 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-12-21 15:38:21,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:21,908 INFO L225 Difference]: With dead ends: 331 [2021-12-21 15:38:21,908 INFO L226 Difference]: Without dead ends: 289 [2021-12-21 15:38:21,908 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-12-21 15:38:21,909 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 84 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:21,909 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.3s Time] [2021-12-21 15:38:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-12-21 15:38:21,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2021-12-21 15:38:21,923 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-12-21 15:38:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 392 transitions. [2021-12-21 15:38:21,925 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 392 transitions. Word has length 102 [2021-12-21 15:38:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:21,925 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 392 transitions. [2021-12-21 15:38:21,925 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-12-21 15:38:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 392 transitions. [2021-12-21 15:38:21,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-21 15:38:21,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:21,926 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-12-21 15:38:21,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 15:38:21,927 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:21,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:21,927 INFO L85 PathProgramCache]: Analyzing trace with hash 704139607, now seen corresponding path program 1 times [2021-12-21 15:38:21,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:21,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642947824] [2021-12-21 15:38:21,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:21,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:22,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:22,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 15:38:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:22,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-21 15:38:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:22,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-21 15:38:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:22,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:22,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 15:38:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 15:38:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 15:38:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:22,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 15:38:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:22,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 15:38:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:22,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 15:38:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-21 15:38:22,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:22,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642947824] [2021-12-21 15:38:22,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642947824] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:38:22,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:38:22,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-21 15:38:22,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373761218] [2021-12-21 15:38:22,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:38:22,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 15:38:22,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:22,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 15:38:22,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-12-21 15:38:22,504 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-12-21 15:38:23,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:23,276 INFO L93 Difference]: Finished difference Result 295 states and 406 transitions. [2021-12-21 15:38:23,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 15:38:23,277 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-12-21 15:38:23,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:23,278 INFO L225 Difference]: With dead ends: 295 [2021-12-21 15:38:23,278 INFO L226 Difference]: Without dead ends: 230 [2021-12-21 15:38:23,279 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-12-21 15:38:23,279 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 177 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:23,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 1095 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 15:38:23,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-21 15:38:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 167. [2021-12-21 15:38:23,290 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-12-21 15:38:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 209 transitions. [2021-12-21 15:38:23,290 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 209 transitions. Word has length 102 [2021-12-21 15:38:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:23,291 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 209 transitions. [2021-12-21 15:38:23,291 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-12-21 15:38:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 209 transitions. [2021-12-21 15:38:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-21 15:38:23,292 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 15:38:23,292 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-12-21 15:38:23,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-21 15:38:23,292 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 15:38:23,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:38:23,293 INFO L85 PathProgramCache]: Analyzing trace with hash 523668838, now seen corresponding path program 1 times [2021-12-21 15:38:23,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:38:23,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626095456] [2021-12-21 15:38:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:23,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:38:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 15:38:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 15:38:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 15:38:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 15:38:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 15:38:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-21 15:38:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-21 15:38:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-21 15:38:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 15:38:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-21 15:38:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-21 15:38:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-21 15:38:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-21 15:38:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 15:38:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-12-21 15:38:23,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:38:23,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626095456] [2021-12-21 15:38:23,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626095456] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:38:23,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19127886] [2021-12-21 15:38:23,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:38:23,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:38:23,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:38:23,795 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-12-21 15:38:23,796 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-12-21 15:38:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:38:24,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 2725 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-21 15:38:24,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:38:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-12-21 15:38:24,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:38:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-12-21 15:38:24,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19127886] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 15:38:24,682 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 15:38:24,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 24 [2021-12-21 15:38:24,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304080290] [2021-12-21 15:38:24,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 15:38:24,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-21 15:38:24,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:38:24,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-21 15:38:24,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2021-12-21 15:38:24,684 INFO L87 Difference]: Start difference. First operand 167 states and 209 transitions. Second operand has 24 states, 21 states have (on average 3.857142857142857) internal successors, (81), 18 states have internal predecessors, (81), 10 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 10 states have call successors, (23) [2021-12-21 15:38:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 15:38:25,122 INFO L93 Difference]: Finished difference Result 185 states and 223 transitions. [2021-12-21 15:38:25,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 15:38:25,122 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.857142857142857) internal successors, (81), 18 states have internal predecessors, (81), 10 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 10 states have call successors, (23) Word has length 118 [2021-12-21 15:38:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 15:38:25,123 INFO L225 Difference]: With dead ends: 185 [2021-12-21 15:38:25,123 INFO L226 Difference]: Without dead ends: 0 [2021-12-21 15:38:25,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2021-12-21 15:38:25,124 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 64 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 15:38:25,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 367 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 15:38:25,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-21 15:38:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-21 15:38:25,124 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-12-21 15:38:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-21 15:38:25,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2021-12-21 15:38:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 15:38:25,125 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-21 15:38:25,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.857142857142857) internal successors, (81), 18 states have internal predecessors, (81), 10 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 10 states have call successors, (23) [2021-12-21 15:38:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-21 15:38:25,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-21 15:38:25,127 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 15:38:25,167 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-12-21 15:38:25,327 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-12-21 15:38:25,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-21 15:38:29,058 INFO L854 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (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|) 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-12-21 15:38:29,058 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2021-12-21 15:38:29,058 INFO L854 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (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|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2021-12-21 15:38:29,058 INFO L858 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2021-12-21 15:38:29,058 INFO L854 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (or (<= |ensure_string_is_allocated_bounded_length_~len~1#1| (+ (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) 15)) .cse0) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (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|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (<= (* 18446744073709551616 (div (+ 18446744073709551615 |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) (<= |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-12-21 15:38:29,058 INFO L858 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2021-12-21 15:38:29,058 INFO L854 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (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|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2021-12-21 15:38:29,058 INFO L858 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2021-12-21 15:38:29,058 INFO L854 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (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|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-12-21 15:38:29,058 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-12-21 15:38:29,058 INFO L858 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2021-12-21 15:38:29,058 INFO L858 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2021-12-21 15:38:29,059 INFO L854 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (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|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-12-21 15:38:29,059 INFO L858 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2021-12-21 15:38:29,059 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2021-12-21 15:38:29,059 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-21 15:38:29,059 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-21 15:38:29,059 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-21 15:38:29,059 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-21 15:38:29,059 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-12-21 15:38:29,059 INFO L861 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2021-12-21 15:38:29,059 INFO L858 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2021-12-21 15:38:29,059 INFO L858 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2021-12-21 15:38:29,059 INFO L861 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2021-12-21 15:38:29,059 INFO L858 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2021-12-21 15:38:29,059 INFO L858 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2021-12-21 15:38:29,059 INFO L861 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2021-12-21 15:38:29,059 INFO L858 garLoopResultBuilder]: For program point L7364-6(line 7364) no Hoare annotation was computed. [2021-12-21 15:38:29,059 INFO L858 garLoopResultBuilder]: For program point L7364-4(line 7364) no Hoare annotation was computed. [2021-12-21 15:38:29,059 INFO L858 garLoopResultBuilder]: For program point L7364-3(line 7364) no Hoare annotation was computed. [2021-12-21 15:38:29,059 INFO L858 garLoopResultBuilder]: For program point L7364-8(line 7364) no Hoare annotation was computed. [2021-12-21 15:38:29,059 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7359 7365) the Hoare annotation is: true [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7359 7365) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point L7361-3(line 7361) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point L7361-1(line 7361) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7359 7365) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point L7361(lines 7361 7364) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point L7361-7(lines 7361 7364) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point L7361-6(lines 7361 7362) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point L7361-4(lines 7361 7362) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point L7361-11(lines 7361 7364) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point L7361-9(lines 7361 7364) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point L7364-2(line 7364) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point L7364(line 7364) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2021-12-21 15:38:29,060 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2021-12-21 15:38:29,061 INFO L861 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2021-12-21 15:38:29,061 INFO L858 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2021-12-21 15:38:29,061 INFO L858 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2021-12-21 15:38:29,061 INFO L858 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2021-12-21 15:38:29,061 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2021-12-21 15:38:29,061 INFO L858 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2021-12-21 15:38:29,061 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2021-12-21 15:38:29,061 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-21 15:38:29,061 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-21 15:38:29,061 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-21 15:38:29,061 INFO L854 garLoopResultBuilder]: At program point L9408(line 9408) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (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 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |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-12-21 15:38:29,061 INFO L858 garLoopResultBuilder]: For program point L9408-1(line 9408) no Hoare annotation was computed. [2021-12-21 15:38:29,061 INFO L854 garLoopResultBuilder]: At program point L9408-2(lines 9386 9409) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (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 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |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-12-21 15:38:29,061 INFO L858 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2021-12-21 15:38:29,061 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-21 15:38:29,061 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-21 15:38:29,061 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-12-21 15:38:29,061 INFO L861 garLoopResultBuilder]: At program point L9558(line 9558) the Hoare annotation is: true [2021-12-21 15:38:29,062 INFO L858 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2021-12-21 15:38:29,062 INFO L858 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2021-12-21 15:38:29,062 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2021-12-21 15:38:29,062 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-21 15:38:29,062 INFO L854 garLoopResultBuilder]: At program point L9551(line 9551) the Hoare annotation is: false [2021-12-21 15:38:29,062 INFO L858 garLoopResultBuilder]: For program point L9551-1(line 9551) no Hoare annotation was computed. [2021-12-21 15:38:29,062 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-21 15:38:29,062 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2021-12-21 15:38:29,062 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-21 15:38:29,062 INFO L858 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2021-12-21 15:38:29,062 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-12-21 15:38:29,062 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-12-21 15:38:29,062 INFO L858 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2021-12-21 15:38:29,062 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-21 15:38:29,062 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2021-12-21 15:38:29,062 INFO L858 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2021-12-21 15:38:29,062 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-12-21 15:38:29,062 INFO L858 garLoopResultBuilder]: For program point L9388(line 9388) no Hoare annotation was computed. [2021-12-21 15:38:29,062 INFO L854 garLoopResultBuilder]: At program point L9388-2(line 9388) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (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 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |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-12-21 15:38:29,063 INFO L854 garLoopResultBuilder]: At program point L9553(line 9553) the Hoare annotation is: false [2021-12-21 15:38:29,063 INFO L854 garLoopResultBuilder]: At program point L9553-1(line 9553) the Hoare annotation is: false [2021-12-21 15:38:29,063 INFO L858 garLoopResultBuilder]: For program point L9553-2(line 9553) no Hoare annotation was computed. [2021-12-21 15:38:29,063 INFO L858 garLoopResultBuilder]: For program point L9388-3(line 9388) no Hoare annotation was computed. [2021-12-21 15:38:29,063 INFO L854 garLoopResultBuilder]: At program point L9388-4(line 9388) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (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 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |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-12-21 15:38:29,063 INFO L858 garLoopResultBuilder]: For program point L9388-5(line 9388) no Hoare annotation was computed. [2021-12-21 15:38:29,063 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-21 15:38:29,063 INFO L858 garLoopResultBuilder]: For program point L9389(line 9389) no Hoare annotation was computed. [2021-12-21 15:38:29,063 INFO L854 garLoopResultBuilder]: At program point L9389-2(line 9389) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (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 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |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-12-21 15:38:29,063 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-12-21 15:38:29,063 INFO L858 garLoopResultBuilder]: For program point L9389-3(line 9389) no Hoare annotation was computed. [2021-12-21 15:38:29,063 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2021-12-21 15:38:29,063 INFO L858 garLoopResultBuilder]: For program point L9538(lines 9538 9557) no Hoare annotation was computed. [2021-12-21 15:38:29,063 INFO L854 garLoopResultBuilder]: At program point L9546-1(line 9546) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1351#1| 0) .cse4 .cse5 (<= 0 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1351#1|)) (and .cse0 .cse2 .cse3 .cse4 (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 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |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-12-21 15:38:29,063 INFO L854 garLoopResultBuilder]: At program point L9389-4(line 9389) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (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 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |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-12-21 15:38:29,063 INFO L858 garLoopResultBuilder]: For program point L9546-2(line 9546) no Hoare annotation was computed. [2021-12-21 15:38:29,063 INFO L858 garLoopResultBuilder]: For program point L9389-5(line 9389) no Hoare annotation was computed. [2021-12-21 15:38:29,064 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-21 15:38:29,064 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-21 15:38:29,064 INFO L858 garLoopResultBuilder]: For program point L9390(lines 9390 9398) no Hoare annotation was computed. [2021-12-21 15:38:29,064 INFO L861 garLoopResultBuilder]: At program point L9539(line 9539) the Hoare annotation is: true [2021-12-21 15:38:29,064 INFO L858 garLoopResultBuilder]: For program point L9539-1(lines 9539 9540) no Hoare annotation was computed. [2021-12-21 15:38:29,064 INFO L861 garLoopResultBuilder]: At program point L9539-2(line 9539) the Hoare annotation is: true [2021-12-21 15:38:29,064 INFO L858 garLoopResultBuilder]: For program point L9539-3(line 9539) no Hoare annotation was computed. [2021-12-21 15:38:29,064 INFO L858 garLoopResultBuilder]: For program point L9539-5(lines 9539 9540) no Hoare annotation was computed. [2021-12-21 15:38:29,064 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-12-21 15:38:29,064 INFO L858 garLoopResultBuilder]: For program point L9556-1(line 9556) no Hoare annotation was computed. [2021-12-21 15:38:29,064 INFO L858 garLoopResultBuilder]: For program point L9399(lines 9399 9407) no Hoare annotation was computed. [2021-12-21 15:38:29,064 INFO L854 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (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 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |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-12-21 15:38:29,064 INFO L858 garLoopResultBuilder]: For program point L9548-1(lines 9548 9549) no Hoare annotation was computed. [2021-12-21 15:38:29,064 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-12-21 15:38:29,064 INFO L858 garLoopResultBuilder]: For program point L9548-3(lines 9548 9549) no Hoare annotation was computed. [2021-12-21 15:38:29,064 INFO L858 garLoopResultBuilder]: For program point L9548-4(lines 9548 9554) no Hoare annotation was computed. [2021-12-21 15:38:29,064 INFO L854 garLoopResultBuilder]: At program point L9548-6(lines 9548 9554) the Hoare annotation is: (let ((.cse5 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse4 (select .cse5 16))) (let ((.cse1 (<= .cse4 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse4) 18446744073709551616))))) (.cse2 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse0 (select .cse5 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)) .cse1 .cse2 .cse3) (and .cse1 .cse2 (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)) (<= .cse0 (+ .cse4 (* 18446744073709551616 (div (+ (* (- 1) .cse4) 18446744073709551615 (* 18446744073709551616 (div .cse0 18446744073709551616))) 18446744073709551616)))) .cse3 (= |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-12-21 15:38:29,064 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-21 15:38:29,064 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-21 15:38:29,065 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-21 15:38:29,065 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-21 15:38:29,065 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-21 15:38:29,065 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-21 15:38:29,068 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-12-21 15:38:29,070 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 15:38:29,080 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:38:29,081 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2021-12-21 15:38:29,082 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:38:29,082 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2021-12-21 15:38:29,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:38:29 BoogieIcfgContainer [2021-12-21 15:38:29,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 15:38:29,085 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 15:38:29,085 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 15:38:29,085 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 15:38:29,085 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:37:58" (3/4) ... [2021-12-21 15:38:29,101 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-21 15:38:29,105 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2021-12-21 15:38:29,105 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-21 15:38:29,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2021-12-21 15:38:29,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-21 15:38:29,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-12-21 15:38:29,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-21 15:38:29,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-21 15:38:29,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-21 15:38:29,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-21 15:38:29,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2021-12-21 15:38:29,115 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2021-12-21 15:38:29,118 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2021-12-21 15:38:29,120 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-12-21 15:38:29,121 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-21 15:38:29,122 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-12-21 15:38:29,122 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-21 15:38:29,123 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-21 15:38:29,124 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-21 15:38:29,147 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && !(\old(max_size) == 16) [2021-12-21 15:38:29,663 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 15:38:29,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 15:38:29,664 INFO L158 Benchmark]: Toolchain (without parser) took 34773.33ms. Allocated memory was 115.3MB in the beginning and 610.3MB in the end (delta: 494.9MB). Free memory was 91.1MB in the beginning and 340.4MB in the end (delta: -249.3MB). Peak memory consumption was 419.7MB. Max. memory is 16.1GB. [2021-12-21 15:38:29,664 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 15:38:29,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1801.90ms. Allocated memory was 115.3MB in the beginning and 182.5MB in the end (delta: 67.1MB). Free memory was 91.1MB in the beginning and 84.6MB in the end (delta: 6.5MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. [2021-12-21 15:38:29,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 175.56ms. Allocated memory is still 182.5MB. Free memory was 84.6MB in the beginning and 120.4MB in the end (delta: -35.8MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2021-12-21 15:38:29,665 INFO L158 Benchmark]: Boogie Preprocessor took 80.03ms. Allocated memory is still 182.5MB. Free memory was 120.4MB in the beginning and 114.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-21 15:38:29,665 INFO L158 Benchmark]: RCFGBuilder took 1123.11ms. Allocated memory is still 182.5MB. Free memory was 114.1MB in the beginning and 84.9MB in the end (delta: 29.2MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2021-12-21 15:38:29,665 INFO L158 Benchmark]: TraceAbstraction took 31010.00ms. Allocated memory was 182.5MB in the beginning and 610.3MB in the end (delta: 427.8MB). Free memory was 84.9MB in the beginning and 445.9MB in the end (delta: -361.0MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2021-12-21 15:38:29,665 INFO L158 Benchmark]: Witness Printer took 578.30ms. Allocated memory is still 610.3MB. Free memory was 445.9MB in the beginning and 340.4MB in the end (delta: 105.5MB). Peak memory consumption was 280.6MB. Max. memory is 16.1GB. [2021-12-21 15:38:29,666 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.14ms. Allocated memory is still 83.9MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1801.90ms. Allocated memory was 115.3MB in the beginning and 182.5MB in the end (delta: 67.1MB). Free memory was 91.1MB in the beginning and 84.6MB in the end (delta: 6.5MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 175.56ms. Allocated memory is still 182.5MB. Free memory was 84.6MB in the beginning and 120.4MB in the end (delta: -35.8MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.03ms. Allocated memory is still 182.5MB. Free memory was 120.4MB in the beginning and 114.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1123.11ms. Allocated memory is still 182.5MB. Free memory was 114.1MB in the beginning and 84.9MB in the end (delta: 29.2MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. * TraceAbstraction took 31010.00ms. Allocated memory was 182.5MB in the beginning and 610.3MB in the end (delta: 427.8MB). Free memory was 84.9MB in the beginning and 445.9MB in the end (delta: -361.0MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. * Witness Printer took 578.30ms. Allocated memory is still 610.3MB. Free memory was 445.9MB in the beginning and 340.4MB in the end (delta: 105.5MB). Peak memory consumption was 280.6MB. 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: 31.0s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2204 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2057 mSDsluCounter, 13551 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1151 IncrementalHoareTripleChecker+Unchecked, 10767 mSDsCounter, 686 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7413 IncrementalHoareTripleChecker+Invalid, 9250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 686 mSolverCounterUnsat, 2784 mSDtfsCounter, 7413 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1993 GetRequests, 1658 SyntacticMatches, 30 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2118 ImplicationChecksByTransitivity, 5.9s 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.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 175 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 440 PreInvPairs, 484 NumberOfFragments, 1577 HoareAnnotationTreeSize, 440 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 2961 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 2596 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2983 ConstructedInterpolants, 101 QuantifiedInterpolants, 16106 SizeOfPredicates, 75 NumberOfNonLiveVariables, 23635 ConjunctsInSsa, 195 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-12-21 15:38:29,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:38:29,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2021-12-21 15:38:29,673 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 15:38:29,673 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 && 0 <= 18446744073709551616 * (-1 * unknown-#memory_int-unknown[buf][buf] / 18446744073709551616) + unknown-#memory_int-unknown[buf][buf]) && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(buf == 0)) && buf == 0) || ((((((((str == 0 && 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)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16] + 18446744073709551616 * ((-1 * unknown-#memory_int-unknown[buf][16] + 18446744073709551615 + 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) / 18446744073709551616)) && buf == 0) && buf == buf) && buf == 0) - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: ((!(str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && !(\old(max_size) == 16) RESULT: Ultimate proved your program to be correct! [2021-12-21 15:38:29,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE