./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_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 caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 20:45:31,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 20:45:31,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 20:45:31,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 20:45:31,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 20:45:31,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 20:45:31,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 20:45:31,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 20:45:31,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 20:45:31,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 20:45:31,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 20:45:31,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 20:45:31,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 20:45:31,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 20:45:31,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 20:45:31,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 20:45:31,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 20:45:31,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 20:45:31,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 20:45:31,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 20:45:31,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 20:45:31,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 20:45:31,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 20:45:31,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 20:45:31,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 20:45:31,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 20:45:31,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 20:45:31,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 20:45:31,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 20:45:31,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 20:45:31,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 20:45:31,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 20:45:31,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 20:45:31,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 20:45:31,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 20:45:31,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 20:45:31,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 20:45:31,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 20:45:31,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 20:45:31,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 20:45:31,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 20:45:31,759 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 20:45:31,786 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 20:45:31,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 20:45:31,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 20:45:31,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 20:45:31,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 20:45:31,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 20:45:31,789 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 20:45:31,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 20:45:31,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 20:45:31,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 20:45:31,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 20:45:31,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 20:45:31,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 20:45:31,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 20:45:31,790 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 20:45:31,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 20:45:31,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 20:45:31,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 20:45:31,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 20:45:31,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:45:31,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 20:45:31,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 20:45:31,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 20:45:31,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 20:45:31,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 20:45:31,792 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 20:45:31,792 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 20:45:31,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 20:45:31,793 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 20:45:31,793 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 -> caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a [2021-11-22 20:45:31,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 20:45:31,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 20:45:31,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 20:45:32,000 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 20:45:32,000 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 20:45:32,001 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_cursor_harness.i [2021-11-22 20:45:32,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca6bcd240/d23abd384ac0476ca9acf78efb331c20/FLAG43e80b8bb [2021-11-22 20:45:32,702 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 20:45:32,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2021-11-22 20:45:32,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca6bcd240/d23abd384ac0476ca9acf78efb331c20/FLAG43e80b8bb [2021-11-22 20:45:32,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca6bcd240/d23abd384ac0476ca9acf78efb331c20 [2021-11-22 20:45:32,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 20:45:32,856 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 20:45:32,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 20:45:32,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 20:45:32,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 20:45:32,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:45:32" (1/1) ... [2021-11-22 20:45:32,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24e5c341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:32, skipping insertion in model container [2021-11-22 20:45:32,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:45:32" (1/1) ... [2021-11-22 20:45:32,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 20:45:32,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:45:33,153 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_cursor_harness.i[4499,4512] [2021-11-22 20:45:33,159 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_cursor_harness.i[4559,4572] [2021-11-22 20:45:33,711 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:33,711 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:33,711 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:33,712 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:33,712 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:33,719 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:33,720 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:33,721 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:33,722 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:33,935 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:45:33,936 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:45:33,937 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:45:33,938 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:45:33,939 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:45:33,941 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:45:33,942 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:45:33,942 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:45:33,943 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:45:33,944 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:45:34,049 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:45:34,159 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:34,160 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:34,247 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:45:34,353 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 20:45:34,400 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_cursor_harness.i[4499,4512] [2021-11-22 20:45:34,402 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_cursor_harness.i[4559,4572] [2021-11-22 20:45:34,424 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:34,426 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:34,426 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:34,426 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:34,427 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:34,434 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:34,434 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:34,435 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:34,436 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:34,466 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:45:34,467 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:45:34,467 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:45:34,468 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:45:34,468 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:45:34,469 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:45:34,469 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:45:34,469 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:45:34,469 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:45:34,470 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:45:34,482 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:45:34,530 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:34,531 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:45:34,564 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:45:34,749 INFO L208 MainTranslator]: Completed translation [2021-11-22 20:45:34,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:34 WrapperNode [2021-11-22 20:45:34,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 20:45:34,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 20:45:34,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 20:45:34,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 20:45:34,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:34" (1/1) ... [2021-11-22 20:45:34,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:34" (1/1) ... [2021-11-22 20:45:34,907 INFO L137 Inliner]: procedures = 693, calls = 2789, calls flagged for inlining = 1057, calls inlined = 37, statements flattened = 1098 [2021-11-22 20:45:34,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 20:45:34,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 20:45:34,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 20:45:34,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 20:45:34,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:34" (1/1) ... [2021-11-22 20:45:34,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:34" (1/1) ... [2021-11-22 20:45:34,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:34" (1/1) ... [2021-11-22 20:45:34,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:34" (1/1) ... [2021-11-22 20:45:34,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:34" (1/1) ... [2021-11-22 20:45:34,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:34" (1/1) ... [2021-11-22 20:45:34,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:34" (1/1) ... [2021-11-22 20:45:34,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 20:45:34,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 20:45:34,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 20:45:34,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 20:45:34,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:34" (1/1) ... [2021-11-22 20:45:34,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:45:35,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:45:35,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 20:45:35,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 20:45:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-22 20:45:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 20:45:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 20:45:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 20:45:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 20:45:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 20:45:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 20:45:35,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 20:45:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-22 20:45:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 20:45:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 20:45:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 20:45:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 20:45:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 20:45:35,311 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 20:45:35,312 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 20:45:36,214 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 20:45:36,221 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 20:45:36,221 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-22 20:45:36,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:45:36 BoogieIcfgContainer [2021-11-22 20:45:36,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 20:45:36,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 20:45:36,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 20:45:36,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 20:45:36,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:45:32" (1/3) ... [2021-11-22 20:45:36,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24443030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:45:36, skipping insertion in model container [2021-11-22 20:45:36,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:45:34" (2/3) ... [2021-11-22 20:45:36,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24443030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:45:36, skipping insertion in model container [2021-11-22 20:45:36,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:45:36" (3/3) ... [2021-11-22 20:45:36,231 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_cursor_harness.i [2021-11-22 20:45:36,235 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 20:45:36,235 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-22 20:45:36,281 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 20:45:36,285 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 20:45:36,285 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-22 20:45:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 122 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 20:45:36,318 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:36,318 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:36,331 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:36,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1642117300, now seen corresponding path program 1 times [2021-11-22 20:45:36,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:36,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066813789] [2021-11-22 20:45:36,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:36,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:36,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:36,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066813789] [2021-11-22 20:45:36,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066813789] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:36,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:36,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 20:45:36,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009798195] [2021-11-22 20:45:36,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:36,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 20:45:36,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:36,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 20:45:36,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:45:36,782 INFO L87 Difference]: Start difference. First operand has 123 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 122 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:36,799 INFO L93 Difference]: Finished difference Result 240 states and 330 transitions. [2021-11-22 20:45:36,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 20:45:36,801 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-22 20:45:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:36,807 INFO L225 Difference]: With dead ends: 240 [2021-11-22 20:45:36,808 INFO L226 Difference]: Without dead ends: 118 [2021-11-22 20:45:36,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:45:36,812 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:36,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-22 20:45:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-22 20:45:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 117 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 150 transitions. [2021-11-22 20:45:36,839 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 150 transitions. Word has length 34 [2021-11-22 20:45:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:36,839 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 150 transitions. [2021-11-22 20:45:36,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 150 transitions. [2021-11-22 20:45:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 20:45:36,841 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:36,841 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:36,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 20:45:36,841 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:36,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash -722198004, now seen corresponding path program 1 times [2021-11-22 20:45:36,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:36,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985035382] [2021-11-22 20:45:36,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:36,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:36,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:36,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985035382] [2021-11-22 20:45:36,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985035382] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:36,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:36,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:45:36,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252718282] [2021-11-22 20:45:36,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:36,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:45:36,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:36,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:45:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:36,982 INFO L87 Difference]: Start difference. First operand 118 states and 150 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:37,018 INFO L93 Difference]: Finished difference Result 203 states and 259 transitions. [2021-11-22 20:45:37,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:45:37,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-22 20:45:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:37,019 INFO L225 Difference]: With dead ends: 203 [2021-11-22 20:45:37,019 INFO L226 Difference]: Without dead ends: 118 [2021-11-22 20:45:37,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:37,021 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 124 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:37,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 255 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:37,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-22 20:45:37,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-22 20:45:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 117 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 148 transitions. [2021-11-22 20:45:37,028 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 148 transitions. Word has length 34 [2021-11-22 20:45:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:37,028 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 148 transitions. [2021-11-22 20:45:37,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 148 transitions. [2021-11-22 20:45:37,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 20:45:37,029 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:37,030 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:37,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 20:45:37,030 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:37,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1268815961, now seen corresponding path program 1 times [2021-11-22 20:45:37,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:37,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153936448] [2021-11-22 20:45:37,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:37,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:37,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:37,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153936448] [2021-11-22 20:45:37,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153936448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:37,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:37,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:45:37,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412517941] [2021-11-22 20:45:37,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:37,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:45:37,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:37,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:45:37,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:45:37,188 INFO L87 Difference]: Start difference. First operand 118 states and 148 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:37,275 INFO L93 Difference]: Finished difference Result 242 states and 303 transitions. [2021-11-22 20:45:37,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:45:37,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-22 20:45:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:37,279 INFO L225 Difference]: With dead ends: 242 [2021-11-22 20:45:37,279 INFO L226 Difference]: Without dead ends: 197 [2021-11-22 20:45:37,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:45:37,284 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 651 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:37,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [651 Valid, 544 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-22 20:45:37,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 144. [2021-11-22 20:45:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.316546762589928) internal successors, (183), 143 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 183 transitions. [2021-11-22 20:45:37,293 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 183 transitions. Word has length 37 [2021-11-22 20:45:37,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:37,294 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 183 transitions. [2021-11-22 20:45:37,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,294 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 183 transitions. [2021-11-22 20:45:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 20:45:37,295 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:37,295 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:37,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 20:45:37,295 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:37,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2086464411, now seen corresponding path program 1 times [2021-11-22 20:45:37,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:37,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570708421] [2021-11-22 20:45:37,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:37,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:37,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:37,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570708421] [2021-11-22 20:45:37,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570708421] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:37,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:37,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:45:37,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996613944] [2021-11-22 20:45:37,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:37,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:45:37,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:37,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:45:37,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:37,439 INFO L87 Difference]: Start difference. First operand 144 states and 183 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:37,458 INFO L93 Difference]: Finished difference Result 287 states and 366 transitions. [2021-11-22 20:45:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:45:37,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-22 20:45:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:37,459 INFO L225 Difference]: With dead ends: 287 [2021-11-22 20:45:37,459 INFO L226 Difference]: Without dead ends: 244 [2021-11-22 20:45:37,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:37,460 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 71 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:37,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 427 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-22 20:45:37,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 229. [2021-11-22 20:45:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.3214285714285714) internal successors, (296), 228 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 296 transitions. [2021-11-22 20:45:37,485 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 296 transitions. Word has length 37 [2021-11-22 20:45:37,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:37,485 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 296 transitions. [2021-11-22 20:45:37,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2021-11-22 20:45:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-22 20:45:37,493 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:37,493 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:37,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 20:45:37,494 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:37,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:37,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1663046692, now seen corresponding path program 1 times [2021-11-22 20:45:37,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:37,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131121761] [2021-11-22 20:45:37,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:37,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:37,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:37,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131121761] [2021-11-22 20:45:37,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131121761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:37,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:37,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:45:37,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384487692] [2021-11-22 20:45:37,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:37,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:45:37,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:37,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:45:37,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:45:37,643 INFO L87 Difference]: Start difference. First operand 229 states and 296 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:37,724 INFO L93 Difference]: Finished difference Result 370 states and 468 transitions. [2021-11-22 20:45:37,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:45:37,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-22 20:45:37,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:37,726 INFO L225 Difference]: With dead ends: 370 [2021-11-22 20:45:37,726 INFO L226 Difference]: Without dead ends: 364 [2021-11-22 20:45:37,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:45:37,727 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 107 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:37,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 630 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:45:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-11-22 20:45:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 229. [2021-11-22 20:45:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.3169642857142858) internal successors, (295), 228 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 295 transitions. [2021-11-22 20:45:37,733 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 295 transitions. Word has length 38 [2021-11-22 20:45:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:37,733 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 295 transitions. [2021-11-22 20:45:37,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 295 transitions. [2021-11-22 20:45:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 20:45:37,734 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:37,735 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:37,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 20:45:37,735 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:37,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:37,735 INFO L85 PathProgramCache]: Analyzing trace with hash 695507998, now seen corresponding path program 1 times [2021-11-22 20:45:37,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:37,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308369367] [2021-11-22 20:45:37,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:37,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:37,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:37,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308369367] [2021-11-22 20:45:37,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308369367] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:37,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:37,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:45:37,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747967122] [2021-11-22 20:45:37,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:37,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:45:37,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:37,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:45:37,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:37,856 INFO L87 Difference]: Start difference. First operand 229 states and 295 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:37,960 INFO L93 Difference]: Finished difference Result 432 states and 556 transitions. [2021-11-22 20:45:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:45:37,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-22 20:45:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:37,962 INFO L225 Difference]: With dead ends: 432 [2021-11-22 20:45:37,962 INFO L226 Difference]: Without dead ends: 241 [2021-11-22 20:45:37,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:45:37,962 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 25 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:37,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 337 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:45:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-22 20:45:37,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 229. [2021-11-22 20:45:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.2857142857142858) internal successors, (288), 228 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 288 transitions. [2021-11-22 20:45:37,967 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 288 transitions. Word has length 42 [2021-11-22 20:45:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:37,968 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 288 transitions. [2021-11-22 20:45:37,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 288 transitions. [2021-11-22 20:45:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 20:45:37,968 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:37,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:37,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 20:45:37,969 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:37,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:37,969 INFO L85 PathProgramCache]: Analyzing trace with hash 15449628, now seen corresponding path program 1 times [2021-11-22 20:45:37,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:37,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395663819] [2021-11-22 20:45:37,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:37,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:38,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:38,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395663819] [2021-11-22 20:45:38,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395663819] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:38,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:38,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:45:38,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572372356] [2021-11-22 20:45:38,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:38,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:45:38,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:38,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:45:38,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:45:38,178 INFO L87 Difference]: Start difference. First operand 229 states and 288 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:38,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:38,409 INFO L93 Difference]: Finished difference Result 556 states and 692 transitions. [2021-11-22 20:45:38,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 20:45:38,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-22 20:45:38,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:38,411 INFO L225 Difference]: With dead ends: 556 [2021-11-22 20:45:38,411 INFO L226 Difference]: Without dead ends: 445 [2021-11-22 20:45:38,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:45:38,411 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 421 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:38,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 658 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:45:38,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-22 20:45:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 316. [2021-11-22 20:45:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 311 states have (on average 1.2861736334405145) internal successors, (400), 315 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 400 transitions. [2021-11-22 20:45:38,418 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 400 transitions. Word has length 42 [2021-11-22 20:45:38,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:38,418 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 400 transitions. [2021-11-22 20:45:38,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 400 transitions. [2021-11-22 20:45:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-22 20:45:38,422 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:38,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:38,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 20:45:38,423 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:38,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:38,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1667971028, now seen corresponding path program 1 times [2021-11-22 20:45:38,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:38,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089135457] [2021-11-22 20:45:38,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:38,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:38,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:38,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089135457] [2021-11-22 20:45:38,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089135457] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:38,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:38,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:45:38,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736718421] [2021-11-22 20:45:38,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:38,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:45:38,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:38,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:45:38,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:45:38,567 INFO L87 Difference]: Start difference. First operand 316 states and 400 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:38,669 INFO L93 Difference]: Finished difference Result 637 states and 792 transitions. [2021-11-22 20:45:38,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:45:38,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-22 20:45:38,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:38,671 INFO L225 Difference]: With dead ends: 637 [2021-11-22 20:45:38,671 INFO L226 Difference]: Without dead ends: 454 [2021-11-22 20:45:38,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:45:38,672 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 84 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:38,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 978 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:45:38,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-11-22 20:45:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 316. [2021-11-22 20:45:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 311 states have (on average 1.279742765273312) internal successors, (398), 315 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 398 transitions. [2021-11-22 20:45:38,679 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 398 transitions. Word has length 46 [2021-11-22 20:45:38,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:38,680 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 398 transitions. [2021-11-22 20:45:38,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:38,680 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 398 transitions. [2021-11-22 20:45:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-22 20:45:38,680 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:38,681 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:38,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 20:45:38,681 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:38,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:38,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2077928575, now seen corresponding path program 1 times [2021-11-22 20:45:38,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:38,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601575243] [2021-11-22 20:45:38,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:38,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:38,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:38,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601575243] [2021-11-22 20:45:38,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601575243] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:38,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:38,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 20:45:38,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866345850] [2021-11-22 20:45:38,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:38,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:45:38,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:38,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:45:38,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:45:38,827 INFO L87 Difference]: Start difference. First operand 316 states and 398 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:38,961 INFO L93 Difference]: Finished difference Result 582 states and 728 transitions. [2021-11-22 20:45:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 20:45:38,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-22 20:45:38,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:38,963 INFO L225 Difference]: With dead ends: 582 [2021-11-22 20:45:38,963 INFO L226 Difference]: Without dead ends: 425 [2021-11-22 20:45:38,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-11-22 20:45:38,964 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 622 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:38,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [622 Valid, 1694 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:45:38,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-11-22 20:45:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 316. [2021-11-22 20:45:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 311 states have (on average 1.2668810289389068) internal successors, (394), 315 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 394 transitions. [2021-11-22 20:45:38,971 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 394 transitions. Word has length 48 [2021-11-22 20:45:38,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:38,972 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 394 transitions. [2021-11-22 20:45:38,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 394 transitions. [2021-11-22 20:45:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-22 20:45:38,973 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:38,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:38,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 20:45:38,973 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:38,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:38,974 INFO L85 PathProgramCache]: Analyzing trace with hash 11459119, now seen corresponding path program 1 times [2021-11-22 20:45:38,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:38,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091956825] [2021-11-22 20:45:38,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:38,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:39,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:39,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091956825] [2021-11-22 20:45:39,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091956825] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:39,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:39,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:45:39,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648884895] [2021-11-22 20:45:39,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:39,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:45:39,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:39,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:45:39,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:45:39,103 INFO L87 Difference]: Start difference. First operand 316 states and 394 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:39,216 INFO L93 Difference]: Finished difference Result 672 states and 829 transitions. [2021-11-22 20:45:39,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:45:39,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-22 20:45:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:39,218 INFO L225 Difference]: With dead ends: 672 [2021-11-22 20:45:39,218 INFO L226 Difference]: Without dead ends: 441 [2021-11-22 20:45:39,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:45:39,219 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 202 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:39,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 370 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:45:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-11-22 20:45:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 316. [2021-11-22 20:45:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 311 states have (on average 1.2379421221864952) internal successors, (385), 315 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 385 transitions. [2021-11-22 20:45:39,231 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 385 transitions. Word has length 48 [2021-11-22 20:45:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:39,231 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 385 transitions. [2021-11-22 20:45:39,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 385 transitions. [2021-11-22 20:45:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-22 20:45:39,232 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:39,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:39,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 20:45:39,233 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:39,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:39,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2062443117, now seen corresponding path program 1 times [2021-11-22 20:45:39,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:39,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165247526] [2021-11-22 20:45:39,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:39,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:39,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:39,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165247526] [2021-11-22 20:45:39,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165247526] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:39,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:39,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:45:39,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011896223] [2021-11-22 20:45:39,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:39,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:45:39,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:39,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:45:39,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:45:39,535 INFO L87 Difference]: Start difference. First operand 316 states and 385 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:39,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:39,798 INFO L93 Difference]: Finished difference Result 656 states and 791 transitions. [2021-11-22 20:45:39,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:45:39,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-22 20:45:39,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:39,801 INFO L225 Difference]: With dead ends: 656 [2021-11-22 20:45:39,801 INFO L226 Difference]: Without dead ends: 459 [2021-11-22 20:45:39,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-11-22 20:45:39,802 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 389 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:39,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 919 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:45:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-11-22 20:45:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 320. [2021-11-22 20:45:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 315 states have (on average 1.2317460317460318) internal successors, (388), 319 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 388 transitions. [2021-11-22 20:45:39,813 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 388 transitions. Word has length 48 [2021-11-22 20:45:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:39,813 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 388 transitions. [2021-11-22 20:45:39,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 388 transitions. [2021-11-22 20:45:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-22 20:45:39,814 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:39,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:39,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 20:45:39,814 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:39,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1556310209, now seen corresponding path program 1 times [2021-11-22 20:45:39,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:39,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675462999] [2021-11-22 20:45:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:39,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:40,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:40,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675462999] [2021-11-22 20:45:40,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675462999] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:40,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:40,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 20:45:40,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744871279] [2021-11-22 20:45:40,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:40,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 20:45:40,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:40,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 20:45:40,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-22 20:45:40,245 INFO L87 Difference]: Start difference. First operand 320 states and 388 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:40,805 INFO L93 Difference]: Finished difference Result 583 states and 688 transitions. [2021-11-22 20:45:40,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 20:45:40,805 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-22 20:45:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:40,807 INFO L225 Difference]: With dead ends: 583 [2021-11-22 20:45:40,807 INFO L226 Difference]: Without dead ends: 576 [2021-11-22 20:45:40,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=652, Unknown=0, NotChecked=0, Total=870 [2021-11-22 20:45:40,808 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 1015 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:40,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1015 Valid, 1849 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:45:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-11-22 20:45:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 320. [2021-11-22 20:45:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 315 states have (on average 1.2285714285714286) internal successors, (387), 319 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 387 transitions. [2021-11-22 20:45:40,818 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 387 transitions. Word has length 51 [2021-11-22 20:45:40,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:40,819 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 387 transitions. [2021-11-22 20:45:40,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 387 transitions. [2021-11-22 20:45:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-22 20:45:40,820 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:40,820 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:40,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 20:45:40,820 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:40,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:40,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2130283351, now seen corresponding path program 1 times [2021-11-22 20:45:40,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:40,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854420753] [2021-11-22 20:45:40,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:40,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:40,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:40,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854420753] [2021-11-22 20:45:40,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854420753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:40,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:40,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 20:45:40,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020400125] [2021-11-22 20:45:40,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:40,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:45:40,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:40,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:45:40,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:45:40,953 INFO L87 Difference]: Start difference. First operand 320 states and 387 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:41,065 INFO L93 Difference]: Finished difference Result 400 states and 476 transitions. [2021-11-22 20:45:41,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 20:45:41,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-22 20:45:41,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:41,066 INFO L225 Difference]: With dead ends: 400 [2021-11-22 20:45:41,067 INFO L226 Difference]: Without dead ends: 335 [2021-11-22 20:45:41,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-11-22 20:45:41,067 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 671 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:41,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [671 Valid, 916 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:41,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-11-22 20:45:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 268. [2021-11-22 20:45:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.220532319391635) internal successors, (321), 267 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 321 transitions. [2021-11-22 20:45:41,077 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 321 transitions. Word has length 53 [2021-11-22 20:45:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:41,077 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 321 transitions. [2021-11-22 20:45:41,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 321 transitions. [2021-11-22 20:45:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-22 20:45:41,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:41,078 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:41,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 20:45:41,078 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:41,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:41,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1273240698, now seen corresponding path program 1 times [2021-11-22 20:45:41,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:41,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023119087] [2021-11-22 20:45:41,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:41,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:41,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:41,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023119087] [2021-11-22 20:45:41,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023119087] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:41,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:41,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 20:45:41,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260557122] [2021-11-22 20:45:41,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:41,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 20:45:41,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:41,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 20:45:41,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:45:41,251 INFO L87 Difference]: Start difference. First operand 268 states and 321 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:41,564 INFO L93 Difference]: Finished difference Result 486 states and 581 transitions. [2021-11-22 20:45:41,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 20:45:41,565 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-22 20:45:41,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:41,566 INFO L225 Difference]: With dead ends: 486 [2021-11-22 20:45:41,566 INFO L226 Difference]: Without dead ends: 326 [2021-11-22 20:45:41,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2021-11-22 20:45:41,567 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 400 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:41,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 1114 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:45:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-11-22 20:45:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 105. [2021-11-22 20:45:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:41,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2021-11-22 20:45:41,573 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 53 [2021-11-22 20:45:41,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:41,573 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2021-11-22 20:45:41,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:41,573 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2021-11-22 20:45:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-22 20:45:41,573 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:41,574 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:41,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 20:45:41,574 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:41,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:41,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1474429559, now seen corresponding path program 1 times [2021-11-22 20:45:41,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:41,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967251987] [2021-11-22 20:45:41,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:41,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:41,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:41,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967251987] [2021-11-22 20:45:41,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967251987] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:41,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:41,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 20:45:41,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027683549] [2021-11-22 20:45:41,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:41,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 20:45:41,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:41,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 20:45:41,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-11-22 20:45:41,758 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:41,948 INFO L93 Difference]: Finished difference Result 195 states and 220 transitions. [2021-11-22 20:45:41,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 20:45:41,949 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-22 20:45:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:41,949 INFO L225 Difference]: With dead ends: 195 [2021-11-22 20:45:41,949 INFO L226 Difference]: Without dead ends: 167 [2021-11-22 20:45:41,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2021-11-22 20:45:41,952 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 1072 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:41,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1072 Valid, 527 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:45:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-11-22 20:45:41,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 132. [2021-11-22 20:45:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 128 states have (on average 1.1875) internal successors, (152), 131 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2021-11-22 20:45:41,958 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 54 [2021-11-22 20:45:41,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:41,958 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2021-11-22 20:45:41,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2021-11-22 20:45:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-22 20:45:41,960 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:41,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:41,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 20:45:41,961 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:41,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:41,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1536469173, now seen corresponding path program 1 times [2021-11-22 20:45:41,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:41,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557835680] [2021-11-22 20:45:41,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:41,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:42,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:42,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557835680] [2021-11-22 20:45:42,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557835680] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:42,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:42,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:45:42,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684057989] [2021-11-22 20:45:42,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:42,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:45:42,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:42,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:45:42,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:42,084 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:42,099 INFO L93 Difference]: Finished difference Result 160 states and 181 transitions. [2021-11-22 20:45:42,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:45:42,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-22 20:45:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:42,100 INFO L225 Difference]: With dead ends: 160 [2021-11-22 20:45:42,100 INFO L226 Difference]: Without dead ends: 132 [2021-11-22 20:45:42,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:45:42,101 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:42,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-22 20:45:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 105. [2021-11-22 20:45:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 104 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2021-11-22 20:45:42,106 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 54 [2021-11-22 20:45:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:42,107 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2021-11-22 20:45:42,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,107 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2021-11-22 20:45:42,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-22 20:45:42,109 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:42,109 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:42,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 20:45:42,110 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:42,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:42,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1989247624, now seen corresponding path program 1 times [2021-11-22 20:45:42,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:42,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675328070] [2021-11-22 20:45:42,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:42,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:42,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:42,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675328070] [2021-11-22 20:45:42,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675328070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:42,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:42,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:45:42,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756121593] [2021-11-22 20:45:42,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:42,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:45:42,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:45:42,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:45:42,238 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:42,306 INFO L93 Difference]: Finished difference Result 207 states and 232 transitions. [2021-11-22 20:45:42,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:45:42,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-22 20:45:42,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:42,307 INFO L225 Difference]: With dead ends: 207 [2021-11-22 20:45:42,307 INFO L226 Difference]: Without dead ends: 167 [2021-11-22 20:45:42,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-22 20:45:42,308 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 487 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:42,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [487 Valid, 541 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-11-22 20:45:42,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2021-11-22 20:45:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.1696428571428572) internal successors, (131), 115 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2021-11-22 20:45:42,313 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 60 [2021-11-22 20:45:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:42,313 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2021-11-22 20:45:42,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2021-11-22 20:45:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-22 20:45:42,314 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:42,314 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:42,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 20:45:42,315 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:42,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:42,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2030960058, now seen corresponding path program 1 times [2021-11-22 20:45:42,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:42,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851495070] [2021-11-22 20:45:42,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:42,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:42,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:42,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851495070] [2021-11-22 20:45:42,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851495070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:42,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:42,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:45:42,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811949538] [2021-11-22 20:45:42,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:42,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:45:42,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:42,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:45:42,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:45:42,414 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:42,433 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2021-11-22 20:45:42,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:45:42,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-22 20:45:42,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:42,434 INFO L225 Difference]: With dead ends: 167 [2021-11-22 20:45:42,434 INFO L226 Difference]: Without dead ends: 105 [2021-11-22 20:45:42,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:45:42,434 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 49 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:42,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 353 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:42,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-22 20:45:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-11-22 20:45:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.1485148514851484) internal successors, (116), 104 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2021-11-22 20:45:42,440 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 60 [2021-11-22 20:45:42,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:42,440 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2021-11-22 20:45:42,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2021-11-22 20:45:42,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-22 20:45:42,441 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:42,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:42,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 20:45:42,441 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:42,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:42,442 INFO L85 PathProgramCache]: Analyzing trace with hash 918123285, now seen corresponding path program 1 times [2021-11-22 20:45:42,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:42,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034986860] [2021-11-22 20:45:42,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:42,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:42,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:42,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034986860] [2021-11-22 20:45:42,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034986860] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:42,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:42,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:45:42,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349321320] [2021-11-22 20:45:42,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:42,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:45:42,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:42,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:45:42,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:45:42,576 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:42,630 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2021-11-22 20:45:42,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:45:42,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-22 20:45:42,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:42,632 INFO L225 Difference]: With dead ends: 147 [2021-11-22 20:45:42,632 INFO L226 Difference]: Without dead ends: 105 [2021-11-22 20:45:42,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-22 20:45:42,632 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 384 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:42,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 313 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:42,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-22 20:45:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-11-22 20:45:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.1386138613861385) internal successors, (115), 104 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2021-11-22 20:45:42,639 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 63 [2021-11-22 20:45:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:42,639 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2021-11-22 20:45:42,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2021-11-22 20:45:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-22 20:45:42,640 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:42,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:42,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 20:45:42,640 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:42,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:42,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1628559408, now seen corresponding path program 1 times [2021-11-22 20:45:42,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:42,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975322891] [2021-11-22 20:45:42,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:42,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:42,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:42,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975322891] [2021-11-22 20:45:42,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975322891] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:42,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:42,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:45:42,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692764764] [2021-11-22 20:45:42,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:42,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:45:42,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:42,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:45:42,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:45:42,740 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:42,766 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2021-11-22 20:45:42,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:45:42,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-22 20:45:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:42,767 INFO L225 Difference]: With dead ends: 134 [2021-11-22 20:45:42,767 INFO L226 Difference]: Without dead ends: 105 [2021-11-22 20:45:42,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:45:42,768 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 3 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:42,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 430 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:42,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-22 20:45:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-11-22 20:45:42,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.1287128712871286) internal successors, (114), 104 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2021-11-22 20:45:42,776 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 65 [2021-11-22 20:45:42,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:42,776 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2021-11-22 20:45:42,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:42,776 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2021-11-22 20:45:42,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-22 20:45:42,777 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:45:42,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:42,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 20:45:42,777 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:45:42,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:45:42,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1152570378, now seen corresponding path program 1 times [2021-11-22 20:45:42,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:45:42,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41332390] [2021-11-22 20:45:42,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:45:42,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:45:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:45:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:45:43,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:45:43,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41332390] [2021-11-22 20:45:43,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41332390] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:45:43,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:45:43,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:45:43,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585666320] [2021-11-22 20:45:43,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:45:43,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:45:43,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:45:43,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:45:43,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:45:43,014 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:45:43,056 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-11-22 20:45:43,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:45:43,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-11-22 20:45:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:45:43,056 INFO L225 Difference]: With dead ends: 105 [2021-11-22 20:45:43,057 INFO L226 Difference]: Without dead ends: 0 [2021-11-22 20:45:43,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:45:43,057 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:45:43,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 13 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:45:43,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-22 20:45:43,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-22 20:45:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-22 20:45:43,058 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2021-11-22 20:45:43,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:45:43,059 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-22 20:45:43,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:45:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-22 20:45:43,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-22 20:45:43,061 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-22 20:45:43,061 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-22 20:45:43,061 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-22 20:45:43,062 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-22 20:45:43,062 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-22 20:45:43,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 20:45:43,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-22 20:45:46,458 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,458 INFO L858 garLoopResultBuilder]: For program point L9549(lines 9549 9550) no Hoare annotation was computed. [2021-11-22 20:45:46,458 INFO L858 garLoopResultBuilder]: For program point L9549-2(lines 9549 9550) no Hoare annotation was computed. [2021-11-22 20:45:46,458 INFO L858 garLoopResultBuilder]: For program point L9549-3(lines 9549 9559) no Hoare annotation was computed. [2021-11-22 20:45:46,459 INFO L854 garLoopResultBuilder]: At program point L6890(lines 6889 6891) the Hoare annotation is: false [2021-11-22 20:45:46,459 INFO L858 garLoopResultBuilder]: For program point L9549-4(lines 9549 9559) no Hoare annotation was computed. [2021-11-22 20:45:46,459 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-22 20:45:46,459 INFO L858 garLoopResultBuilder]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,459 INFO L858 garLoopResultBuilder]: For program point L7370-4(lines 7370 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,459 INFO L854 garLoopResultBuilder]: At program point L7370-3(lines 7368 7372) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse6 (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (or (let ((.cse3 (+ |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 8))) (and .cse0 .cse1 .cse2 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) .cse3) 0)) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1| 1) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0) .cse4 .cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) .cse3) 0) (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1|))) (and .cse0 .cse1 .cse2 .cse6 (<= 0 |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1|) (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1| 0)) (and .cse0 .cse1 .cse2 .cse6 (let ((.cse7 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse7 (* 18446744073709551616 (div .cse7 18446744073709551616)))) .cse4 .cse5))) [2021-11-22 20:45:46,459 INFO L858 garLoopResultBuilder]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,460 INFO L858 garLoopResultBuilder]: For program point L7370-8(lines 7370 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,460 INFO L854 garLoopResultBuilder]: At program point L7370-7(lines 7368 7372) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse2 (let ((.cse14 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse14 (* 18446744073709551616 (div .cse14 18446744073709551616))))) (.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse7 (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0)) (.cse8 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse10 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse4) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0) (let ((.cse11 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res#1.base| 0))) (.cse12 (not .cse4)) (.cse13 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)))) (or (and .cse0 .cse11 .cse1 .cse5 .cse12 .cse13 .cse6 .cse2 .cse8) (and .cse0 .cse11 .cse1 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse10))) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0) .cse9 (not (= |ULTIMATE.start_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res#1.base| 0)) (not |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1|)))) [2021-11-22 20:45:46,460 INFO L858 garLoopResultBuilder]: For program point L7370-6(lines 7370 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,460 INFO L854 garLoopResultBuilder]: At program point L7370-11(lines 7368 7372) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1| 1) (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1|)) [2021-11-22 20:45:46,460 INFO L858 garLoopResultBuilder]: For program point L7370-10(lines 7370 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,460 INFO L858 garLoopResultBuilder]: For program point L7371(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,460 INFO L858 garLoopResultBuilder]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,460 INFO L858 garLoopResultBuilder]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,460 INFO L858 garLoopResultBuilder]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,461 INFO L858 garLoopResultBuilder]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,461 INFO L858 garLoopResultBuilder]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,461 INFO L858 garLoopResultBuilder]: For program point L7371-12(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,461 INFO L858 garLoopResultBuilder]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,461 INFO L858 garLoopResultBuilder]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,461 INFO L858 garLoopResultBuilder]: For program point L6810(lines 6810 6811) no Hoare annotation was computed. [2021-11-22 20:45:46,461 INFO L858 garLoopResultBuilder]: For program point L7371-17(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,461 INFO L858 garLoopResultBuilder]: For program point L7371-16(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,461 INFO L858 garLoopResultBuilder]: For program point L7371-14(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,462 INFO L858 garLoopResultBuilder]: For program point L7371-20(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,462 INFO L858 garLoopResultBuilder]: For program point L6810-2(lines 6810 6811) no Hoare annotation was computed. [2021-11-22 20:45:46,462 INFO L858 garLoopResultBuilder]: For program point L7371-18(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,462 INFO L858 garLoopResultBuilder]: For program point L7371-24(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,462 INFO L858 garLoopResultBuilder]: For program point L7371-23(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,462 INFO L858 garLoopResultBuilder]: For program point L7371-22(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,462 INFO L858 garLoopResultBuilder]: For program point L7371-29(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,462 INFO L858 garLoopResultBuilder]: For program point L7371-28(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,462 INFO L858 garLoopResultBuilder]: For program point L7371-26(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,463 INFO L858 garLoopResultBuilder]: For program point L7371-32(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,463 INFO L858 garLoopResultBuilder]: For program point L7371-30(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,463 INFO L858 garLoopResultBuilder]: For program point L7371-35(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,463 INFO L858 garLoopResultBuilder]: For program point L7371-34(line 7371) no Hoare annotation was computed. [2021-11-22 20:45:46,463 INFO L854 garLoopResultBuilder]: At program point L7703(lines 7684 7704) the Hoare annotation is: (let ((.cse2 (let ((.cse16 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse16 (* 18446744073709551616 (div .cse16 18446744073709551616))))) (.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse6 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse10 (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0)) (.cse11 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse12 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse13 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0)) (let ((.cse5 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res#1.base| 0))) (.cse7 (not .cse4)) (.cse8 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse14 (not (= |ULTIMATE.start_ensure_string_is_allocated_~str~0#1.base| 0))) (.cse15 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res#1.base| 0)))) (or (and .cse0 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse2 .cse11 .cse12 .cse14 .cse15))) (= |ULTIMATE.start_aws_array_eq_#res#1| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0))) (and .cse0 .cse1 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse3 .cse4))) [2021-11-22 20:45:46,463 INFO L858 garLoopResultBuilder]: For program point L9553(lines 9553 9558) no Hoare annotation was computed. [2021-11-22 20:45:46,463 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:45:46,464 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:45:46,464 INFO L858 garLoopResultBuilder]: For program point L9537(lines 9537 9561) no Hoare annotation was computed. [2021-11-22 20:45:46,464 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:45:46,464 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:45:46,464 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:45:46,464 INFO L858 garLoopResultBuilder]: For program point L9538(lines 9538 9539) no Hoare annotation was computed. [2021-11-22 20:45:46,464 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-22 20:45:46,464 INFO L858 garLoopResultBuilder]: For program point L9340(lines 9340 9348) no Hoare annotation was computed. [2021-11-22 20:45:46,464 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,464 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,465 INFO L858 garLoopResultBuilder]: For program point L9538-2(lines 9538 9539) no Hoare annotation was computed. [2021-11-22 20:45:46,465 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,465 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,465 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,465 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,465 INFO L858 garLoopResultBuilder]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2021-11-22 20:45:46,465 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,465 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,465 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,466 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,466 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,466 INFO L854 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: false [2021-11-22 20:45:46,466 INFO L858 garLoopResultBuilder]: For program point L7691(lines 7691 7695) no Hoare annotation was computed. [2021-11-22 20:45:46,466 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,466 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-22 20:45:46,466 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:45:46,466 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:45:46,467 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:45:46,467 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:45:46,467 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:45:46,467 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:45:46,467 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:45:46,467 INFO L858 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:45:46,467 INFO L858 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:45:46,467 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,467 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-22 20:45:46,468 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-22 20:45:46,468 INFO L858 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2021-11-22 20:45:46,468 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-22 20:45:46,468 INFO L858 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2021-11-22 20:45:46,468 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-22 20:45:46,468 INFO L858 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2021-11-22 20:45:46,468 INFO L854 garLoopResultBuilder]: At program point L6256-6(lines 6252 6257) the Hoare annotation is: (let ((.cse21 (+ |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 8))) (let ((.cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) .cse21) 0))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse5 (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0)) (.cse6 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1| 1)) (.cse7 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse9 (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0)) (.cse11 (not |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1|)) (.cse13 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) .cse21) 0)) (.cse14 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1|)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse16 (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse19 (let ((.cse20 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse20 (* 18446744073709551616 (div .cse20 18446744073709551616))))) (.cse10 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse12 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0) (let ((.cse15 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res#1.base| 0))) (.cse17 (not .cse12)) (.cse18 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)))) (or (and .cse0 .cse15 .cse1 .cse2 .cse16 .cse17 .cse18 .cse4 .cse6 .cse19 .cse7 .cse11 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse13 .cse14))) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0) .cse8 (not (= |ULTIMATE.start_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res#1.base| 0))) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse10 .cse12)))) [2021-11-22 20:45:46,468 INFO L858 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2021-11-22 20:45:46,469 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-22 20:45:46,469 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-22 20:45:46,469 INFO L858 garLoopResultBuilder]: For program point L6256-9(line 6256) no Hoare annotation was computed. [2021-11-22 20:45:46,469 INFO L858 garLoopResultBuilder]: For program point L6256-10(line 6256) no Hoare annotation was computed. [2021-11-22 20:45:46,469 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-22 20:45:46,469 INFO L858 garLoopResultBuilder]: For program point L6256-7(line 6256) no Hoare annotation was computed. [2021-11-22 20:45:46,469 INFO L861 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: true [2021-11-22 20:45:46,469 INFO L858 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-22 20:45:46,469 INFO L854 garLoopResultBuilder]: At program point L6256-13(lines 6252 6257) the Hoare annotation is: false [2021-11-22 20:45:46,470 INFO L854 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-11-22 20:45:46,470 INFO L854 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) [2021-11-22 20:45:46,470 INFO L858 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-22 20:45:46,470 INFO L854 garLoopResultBuilder]: At program point L261-3(line 261) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (or (let ((.cse3 (+ |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 8))) (and .cse0 .cse1 .cse2 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) .cse3) 0)) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1| 1) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0) .cse4 .cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) .cse3) 0) (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res#1|))) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (let ((.cse6 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse6 (* 18446744073709551616 (div .cse6 18446744073709551616)))) .cse4 .cse5))) [2021-11-22 20:45:46,470 INFO L858 garLoopResultBuilder]: For program point L6256-12(line 6256) no Hoare annotation was computed. [2021-11-22 20:45:46,470 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-22 20:45:46,470 INFO L858 garLoopResultBuilder]: For program point L9329(line 9329) no Hoare annotation was computed. [2021-11-22 20:45:46,471 INFO L858 garLoopResultBuilder]: For program point L9329-2(line 9329) no Hoare annotation was computed. [2021-11-22 20:45:46,471 INFO L858 garLoopResultBuilder]: For program point L9330(line 9330) no Hoare annotation was computed. [2021-11-22 20:45:46,471 INFO L854 garLoopResultBuilder]: At program point L6803(lines 6800 6804) the Hoare annotation is: false [2021-11-22 20:45:46,471 INFO L858 garLoopResultBuilder]: For program point L9330-2(line 9330) no Hoare annotation was computed. [2021-11-22 20:45:46,471 INFO L854 garLoopResultBuilder]: At program point L6886(lines 6882 6887) the Hoare annotation is: false [2021-11-22 20:45:46,471 INFO L854 garLoopResultBuilder]: At program point L6886-1(lines 6882 6887) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) [2021-11-22 20:45:46,471 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-22 20:45:46,471 INFO L861 garLoopResultBuilder]: At program point L9562(line 9562) the Hoare annotation is: true [2021-11-22 20:45:46,471 INFO L858 garLoopResultBuilder]: For program point L7101(lines 7101 7111) no Hoare annotation was computed. [2021-11-22 20:45:46,472 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:45:46,472 INFO L858 garLoopResultBuilder]: For program point L9331(lines 9331 9339) no Hoare annotation was computed. [2021-11-22 20:45:46,472 INFO L858 garLoopResultBuilder]: For program point L6672(lines 6672 6676) no Hoare annotation was computed. [2021-11-22 20:45:46,472 INFO L858 garLoopResultBuilder]: For program point L6673-2(lines 6673 6675) no Hoare annotation was computed. [2021-11-22 20:45:46,472 INFO L858 garLoopResultBuilder]: For program point L6673(lines 6673 6675) no Hoare annotation was computed. [2021-11-22 20:45:46,472 INFO L858 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2021-11-22 20:45:46,472 INFO L854 garLoopResultBuilder]: At program point L9349(lines 9327 9350) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse7 (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0)) (.cse10 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (let ((.cse16 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse16 (* 18446744073709551616 (div .cse16 18446744073709551616))))) (.cse8 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse4) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_#res#1| 0) (let ((.cse11 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res#1.base| 0))) (.cse12 (not .cse4)) (.cse13 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse14 (not (= |ULTIMATE.start_ensure_string_is_allocated_~str~0#1.base| 0))) (.cse15 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res#1.base| 0)))) (or (and .cse0 .cse11 .cse1 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse15) (and .cse0 .cse11 .cse1 .cse5 .cse12 .cse13 .cse6 .cse2 .cse8 .cse9 .cse14 .cse15)))))) [2021-11-22 20:45:46,473 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (= 16 |ULTIMATE.start_ensure_string_is_allocated_bounded_length_~max_size#1|) [2021-11-22 20:45:46,473 INFO L854 garLoopResultBuilder]: At program point L266-1(line 266) the Hoare annotation is: false [2021-11-22 20:45:46,475 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:45:46,476 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 20:45:46,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,492 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,505 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,507 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,507 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,508 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,508 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,509 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,514 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,527 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,527 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,527 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,527 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,528 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,528 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,528 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,528 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:46,529 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:46,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 08:45:46 BoogieIcfgContainer [2021-11-22 20:45:46,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 20:45:46,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 20:45:46,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 20:45:46,530 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 20:45:46,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:45:36" (3/4) ... [2021-11-22 20:45:46,533 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-22 20:45:46,552 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 156 nodes and edges [2021-11-22 20:45:46,553 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2021-11-22 20:45:46,554 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-11-22 20:45:46,555 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-22 20:45:46,556 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-11-22 20:45:46,557 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-22 20:45:46,558 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-22 20:45:46,559 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-22 20:45:46,579 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(cursor == 0) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && cursor == cursor) && \result == 0) && cursor == 0) && !(\result == 0)) && str == 0) && str == 0) && #memory_$Pointer$[cursor][8] == 0 [2021-11-22 20:45:46,579 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(cursor == 0) && cursor == 0) && cursor == cursor) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == cursor) && \result == 0) && \result <= 1) && cursor == 0) && !(\result == 0)) && cursor == 0) && str == 0) && str == 0) && #memory_$Pointer$[cursor][cursor + 8] == 0) && 1 <= \result) || (((((!(cursor == 0) && cursor == 0) && cursor == cursor) && cursor == cursor) && 0 <= \result) && \result <= 0)) || ((((((!(cursor == 0) && cursor == 0) && cursor == cursor) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && str == 0) && str == 0) [2021-11-22 20:45:46,580 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(cursor == 0) && cursor == 0) && cursor == cursor) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == cursor) && \result == 0) && \result <= 1) && cursor == 0) && !(\result == 0)) && cursor == 0) && str == 0) && str == 0) && #memory_$Pointer$[cursor][cursor + 8] == 0) && 1 <= \result) || ((((((!(cursor == 0) && cursor == 0) && cursor == cursor) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && str == 0) && str == 0) [2021-11-22 20:45:46,580 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(cursor == 0) && cursor == 0) && cursor == cursor) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == cursor) && \result == 0) && \result <= 1) && cursor == 0) && !(\result == 0)) && cursor == 0) && str == 0) && !aux-!str || aws_string_is_valid(str)-aux) && str == 0) && #memory_$Pointer$[cursor][cursor + 8] == 0) && 1 <= \result) || (((((((nondet_parameter ? &cursor : ((void *)0) == 0 && cur == 0) && ((((((((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && cursor == cursor) && cursor == cursor) && !(str == 0)) && !(str == 0)) && cursor == cursor) && \result <= 1) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && cursor == 0) && !aux-!str || aws_string_is_valid(str)-aux) && #memory_$Pointer$[cursor][cursor + 8] == 0) && 1 <= \result) || ((((((((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && cursor == cursor) && !(str == 0)) && !(str == 0)) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == cursor) && \result == 0) && \result <= 1) && cursor == 0) && cursor == 0) && !aux-!str || aws_string_is_valid(str)-aux) && #memory_$Pointer$[cursor][cursor + 8] == 0) && 1 <= \result))) && nondet_parameter ? &cursor : ((void *)0) == 0) && cur == 0) && !(\result == 0)) && !(str == 0)) && !(\result == 0))) || ((((((!(cursor == 0) && cursor == 0) && cursor == cursor) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && str == 0) && str == 0) [2021-11-22 20:45:46,580 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(cursor == 0) && cursor == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && str == 0) && str == 0) || (((((((((!(cursor == 0) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && cursor == cursor) && \result == 0) && cursor == 0) && !(\result == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && str == 0)) || (\result == 0 && (((((((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && !(str == 0)) && !(str == 0)) && cursor == cursor) && \result == 0) && cursor == 0) && !(\result == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && !(str == 0)) && !(\result == 0)) || (((((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && !(str == 0)) && !(str == 0)) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && cursor == 0) && !(\result == 0)) && !(str == 0)) && !(\result == 0)))) [2021-11-22 20:45:46,581 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(cursor == 0) && cursor == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && str == 0) && str == 0) || (((((((((!(cursor == 0) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && cursor == cursor) && \result == 0) && cursor == 0) && !(\result == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && str == 0)) || ((((((((nondet_parameter ? &cursor : ((void *)0) == 0 && cur == 0) && (((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && !(str == 0)) && !(str == 0)) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && cursor == 0) || (((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && !(str == 0)) && !(str == 0)) && cursor == cursor) && \result == 0) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)))) && nondet_parameter ? &cursor : ((void *)0) == 0) && cur == 0) && !(\result == 0)) && !(str == 0)) && !(\result == 0)) && !aux-!cur || aws_byte_cursor_is_valid(cur)-aux) [2021-11-22 20:45:46,581 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(cursor == 0) && cursor == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && str == 0) && str == 0) || (((!(nondet_parameter ? &cursor : ((void *)0) == 0) && (((((((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && !(str == 0)) && !(str == 0)) && cursor == cursor) && \result == 0) && cursor == 0) && !(\result == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && !(str == 0)) && !(\result == 0)) || (((((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && !(str == 0)) && !(str == 0)) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && cursor == 0) && !(\result == 0)) && !(str == 0)) && !(\result == 0)))) && \result == 0) && !(cur == 0))) || (((((((((!(cursor == 0) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && cursor == cursor) && \result == 0) && cursor == 0) && !(\result == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && str == 0) [2021-11-22 20:45:46,581 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(cursor == 0) && cursor == 0) && \result <= 1) && 1 <= \result [2021-11-22 20:45:47,126 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-22 20:45:47,127 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 20:45:47,127 INFO L158 Benchmark]: Toolchain (without parser) took 14271.40ms. Allocated memory was 136.3MB in the beginning and 562.0MB in the end (delta: 425.7MB). Free memory was 94.8MB in the beginning and 296.0MB in the end (delta: -201.2MB). Peak memory consumption was 310.0MB. Max. memory is 16.1GB. [2021-11-22 20:45:47,128 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory was 40.3MB in the beginning and 40.3MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 20:45:47,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1892.44ms. Allocated memory was 136.3MB in the beginning and 190.8MB in the end (delta: 54.5MB). Free memory was 94.5MB in the beginning and 139.2MB in the end (delta: -44.7MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2021-11-22 20:45:47,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 156.35ms. Allocated memory is still 190.8MB. Free memory was 139.2MB in the beginning and 125.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-22 20:45:47,128 INFO L158 Benchmark]: Boogie Preprocessor took 80.09ms. Allocated memory is still 190.8MB. Free memory was 125.6MB in the beginning and 119.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-22 20:45:47,129 INFO L158 Benchmark]: RCFGBuilder took 1233.80ms. Allocated memory is still 190.8MB. Free memory was 119.3MB in the beginning and 106.3MB in the end (delta: 13.0MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2021-11-22 20:45:47,129 INFO L158 Benchmark]: TraceAbstraction took 10304.51ms. Allocated memory was 190.8MB in the beginning and 467.7MB in the end (delta: 276.8MB). Free memory was 106.3MB in the beginning and 207.8MB in the end (delta: -101.5MB). Peak memory consumption was 255.0MB. Max. memory is 16.1GB. [2021-11-22 20:45:47,129 INFO L158 Benchmark]: Witness Printer took 596.83ms. Allocated memory was 467.7MB in the beginning and 562.0MB in the end (delta: 94.4MB). Free memory was 207.8MB in the beginning and 296.0MB in the end (delta: -88.2MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2021-11-22 20:45:47,130 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.18ms. Allocated memory is still 81.8MB. Free memory was 40.3MB in the beginning and 40.3MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1892.44ms. Allocated memory was 136.3MB in the beginning and 190.8MB in the end (delta: 54.5MB). Free memory was 94.5MB in the beginning and 139.2MB in the end (delta: -44.7MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 156.35ms. Allocated memory is still 190.8MB. Free memory was 139.2MB in the beginning and 125.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.09ms. Allocated memory is still 190.8MB. Free memory was 125.6MB in the beginning and 119.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1233.80ms. Allocated memory is still 190.8MB. Free memory was 119.3MB in the beginning and 106.3MB in the end (delta: 13.0MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10304.51ms. Allocated memory was 190.8MB in the beginning and 467.7MB in the end (delta: 276.8MB). Free memory was 106.3MB in the beginning and 207.8MB in the end (delta: -101.5MB). Peak memory consumption was 255.0MB. Max. memory is 16.1GB. * Witness Printer took 596.83ms. Allocated memory was 467.7MB in the beginning and 562.0MB in the end (delta: 94.4MB). Free memory was 207.8MB in the beginning and 296.0MB in the end (delta: -88.2MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 123 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6783 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6783 mSDsluCounter, 13360 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10282 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1728 IncrementalHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 3078 mSDtfsCounter, 1728 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=320occurred in iteration=11, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 1512 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 57 NumberOfFragments, 1143 HoareAnnotationTreeSize, 19 FomulaSimplifications, 84 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 19 FomulaSimplificationsInter, 355457 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1033 NumberOfCodeBlocks, 1033 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1012 ConstructedInterpolants, 0 QuantifiedInterpolants, 3104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7368]: Loop Invariant [2021-11-22 20:45:47,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((!(cursor == 0) && cursor == 0) && cursor == cursor) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == cursor) && \result == 0) && \result <= 1) && cursor == 0) && !(\result == 0)) && cursor == 0) && str == 0) && str == 0) && #memory_$Pointer$[cursor][cursor + 8] == 0) && 1 <= \result) || (((((!(cursor == 0) && cursor == 0) && cursor == cursor) && cursor == cursor) && 0 <= \result) && \result <= 0)) || ((((((!(cursor == 0) && cursor == 0) && cursor == cursor) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && str == 0) && str == 0) - InvariantResult [Line: 6252]: Loop Invariant [2021-11-22 20:45:47,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((!(cursor == 0) && cursor == 0) && cursor == cursor) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == cursor) && \result == 0) && \result <= 1) && cursor == 0) && !(\result == 0)) && cursor == 0) && str == 0) && !aux-!str || aws_string_is_valid(str)-aux) && str == 0) && #memory_$Pointer$[cursor][cursor + 8] == 0) && 1 <= \result) || (((((((nondet_parameter ? &cursor : ((void *)0) == 0 && cur == 0) && ((((((((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && cursor == cursor) && cursor == cursor) && !(str == 0)) && !(str == 0)) && cursor == cursor) && \result <= 1) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && cursor == 0) && !aux-!str || aws_string_is_valid(str)-aux) && #memory_$Pointer$[cursor][cursor + 8] == 0) && 1 <= \result) || ((((((((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && cursor == cursor) && !(str == 0)) && !(str == 0)) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == cursor) && \result == 0) && \result <= 1) && cursor == 0) && cursor == 0) && !aux-!str || aws_string_is_valid(str)-aux) && #memory_$Pointer$[cursor][cursor + 8] == 0) && 1 <= \result))) && nondet_parameter ? &cursor : ((void *)0) == 0) && cur == 0) && !(\result == 0)) && !(str == 0)) && !(\result == 0))) || ((((((!(cursor == 0) && cursor == 0) && cursor == cursor) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && str == 0) && str == 0) - InvariantResult [Line: 6252]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6800]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6882]: Loop Invariant [2021-11-22 20:45:47,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((!(cursor == 0) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && cursor == cursor) && \result == 0) && cursor == 0) && !(\result == 0)) && str == 0) && str == 0) && #memory_$Pointer$[cursor][8] == 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 16 == max_size - InvariantResult [Line: 7684]: Loop Invariant [2021-11-22 20:45:47,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((!(cursor == 0) && cursor == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && str == 0) && str == 0) || (((!(nondet_parameter ? &cursor : ((void *)0) == 0) && (((((((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && !(str == 0)) && !(str == 0)) && cursor == cursor) && \result == 0) && cursor == 0) && !(\result == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && !(str == 0)) && !(\result == 0)) || (((((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && !(str == 0)) && !(str == 0)) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && cursor == 0) && !(\result == 0)) && !(str == 0)) && !(\result == 0)))) && \result == 0) && !(cur == 0))) || (((((((((!(cursor == 0) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && cursor == cursor) && \result == 0) && cursor == 0) && !(\result == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && str == 0) - InvariantResult [Line: 9327]: Loop Invariant [2021-11-22 20:45:47,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((!(cursor == 0) && cursor == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && str == 0) && str == 0) || (((((((((!(cursor == 0) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && cursor == cursor) && \result == 0) && cursor == 0) && !(\result == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && str == 0)) || (\result == 0 && (((((((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && !(str == 0)) && !(str == 0)) && cursor == cursor) && \result == 0) && cursor == 0) && !(\result == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && !(str == 0)) && !(\result == 0)) || (((((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && !(str == 0)) && !(str == 0)) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && cursor == 0) && !(\result == 0)) && !(str == 0)) && !(\result == 0)))) - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6889]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant [2021-11-22 20:45:47,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((!(cursor == 0) && cursor == 0) && cursor == cursor) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == cursor) && \result == 0) && \result <= 1) && cursor == 0) && !(\result == 0)) && cursor == 0) && str == 0) && str == 0) && #memory_$Pointer$[cursor][cursor + 8] == 0) && 1 <= \result) || ((((((!(cursor == 0) && cursor == 0) && cursor == cursor) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && str == 0) && str == 0) - InvariantResult [Line: 7368]: Loop Invariant [2021-11-22 20:45:47,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,151 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,151 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,151 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,151 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((!(cursor == 0) && cursor == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && str == 0) && str == 0) || (((((((((!(cursor == 0) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && cursor == cursor) && \result == 0) && cursor == 0) && !(\result == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && str == 0)) || ((((((((nondet_parameter ? &cursor : ((void *)0) == 0 && cur == 0) && (((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && !(str == 0)) && !(str == 0)) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && cursor == 0) || (((((((((!(cursor == 0) && !(\result == 0)) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && !(str == 0)) && !(str == 0)) && cursor == cursor) && \result == 0) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)))) && nondet_parameter ? &cursor : ((void *)0) == 0) && cur == 0) && !(\result == 0)) && !(str == 0)) && !(\result == 0)) && !aux-!cur || aws_byte_cursor_is_valid(cur)-aux) - InvariantResult [Line: 261]: Loop Invariant [2021-11-22 20:45:47,153 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,153 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:45:47,153 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:45:47,153 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((!(cursor == 0) && cursor == 0) && #memory_$Pointer$[cursor][8] == 0) && cursor == cursor) && cursor == 0) && str == 0) && str == 0) && #memory_$Pointer$[cursor][8] == 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7368]: Loop Invariant Derived loop invariant: ((!(cursor == 0) && cursor == 0) && \result <= 1) && 1 <= \result RESULT: Ultimate proved your program to be correct! [2021-11-22 20:45:47,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE