./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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_byte_cursor_from_string_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 c3b06783378816ab028e38f9f4609990f4d1028238bbcb0e88638ebb644bb54d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 09:37:58,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:37:58,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:37:58,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:37:58,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:37:58,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:37:58,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:37:58,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:37:58,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:37:58,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:37:58,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:37:58,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:37:58,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:37:58,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:37:58,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:37:58,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:37:58,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:37:58,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:37:58,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:37:58,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:37:58,853 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:37:58,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:37:58,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:37:58,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:37:58,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:37:58,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:37:58,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:37:58,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:37:58,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:37:58,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:37:58,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:37:58,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:37:58,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:37:58,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:37:58,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:37:58,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:37:58,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:37:58,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:37:58,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:37:58,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:37:58,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:37:58,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:37:58,874 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 09:37:58,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:37:58,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:37:58,901 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:37:58,901 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:37:58,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:37:58,902 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:37:58,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:37:58,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:37:58,903 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:37:58,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:37:58,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:37:58,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:37:58,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:37:58,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:37:58,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:37:58,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:37:58,909 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:37:58,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:37:58,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:37:58,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:37:58,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:37:58,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:37:58,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:37:58,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:37:58,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:37:58,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:37:58,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:37:58,911 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:37:58,912 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:37:58,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:37:58,912 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 -> c3b06783378816ab028e38f9f4609990f4d1028238bbcb0e88638ebb644bb54d [2022-07-21 09:37:59,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:37:59,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:37:59,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:37:59,179 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:37:59,180 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:37:59,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i [2022-07-21 09:37:59,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ff4fa34/af6ee2b48ac44571ad27dc6fe3de8440/FLAGb89c9fc1c [2022-07-21 09:37:59,872 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:37:59,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i [2022-07-21 09:37:59,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ff4fa34/af6ee2b48ac44571ad27dc6fe3de8440/FLAGb89c9fc1c [2022-07-21 09:38:00,264 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ff4fa34/af6ee2b48ac44571ad27dc6fe3de8440 [2022-07-21 09:38:00,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:38:00,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:38:00,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:38:00,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:38:00,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:38:00,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:38:00" (1/1) ... [2022-07-21 09:38:00,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24794688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:38:00, skipping insertion in model container [2022-07-21 09:38:00,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:38:00" (1/1) ... [2022-07-21 09:38:00,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:38:00,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:38:00,523 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_byte_cursor_from_string_harness.i[4501,4514] [2022-07-21 09:38:00,527 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_byte_cursor_from_string_harness.i[4561,4574] [2022-07-21 09:38:00,992 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:00,992 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:00,993 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:00,993 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:00,994 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,001 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,002 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,003 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,003 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,211 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-21 09:38:01,213 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-21 09:38:01,214 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-21 09:38:01,215 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-21 09:38:01,216 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-21 09:38:01,219 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-21 09:38:01,220 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-21 09:38:01,220 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-21 09:38:01,220 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-21 09:38:01,221 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-21 09:38:01,347 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-21 09:38:01,436 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,436 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:38:01,571 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:38:01,589 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_byte_cursor_from_string_harness.i[4501,4514] [2022-07-21 09:38:01,591 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_byte_cursor_from_string_harness.i[4561,4574] [2022-07-21 09:38:01,629 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,630 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,631 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,631 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,631 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,635 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,636 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,637 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,637 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,696 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-21 09:38:01,697 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-21 09:38:01,698 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-21 09:38:01,698 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-21 09:38:01,698 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-21 09:38:01,699 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-21 09:38:01,699 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-21 09:38:01,700 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-21 09:38:01,700 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-21 09:38:01,700 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-21 09:38:01,715 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-21 09:38:01,759 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,759 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:38:01,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:38:01,991 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:38:01,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:38:01 WrapperNode [2022-07-21 09:38:01,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:38:01,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:38:01,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:38:01,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:38:01,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:38:01" (1/1) ... [2022-07-21 09:38:02,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:38:01" (1/1) ... [2022-07-21 09:38:02,110 INFO L137 Inliner]: procedures = 693, calls = 2785, calls flagged for inlining = 59, calls inlined = 7, statements flattened = 833 [2022-07-21 09:38:02,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:38:02,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:38:02,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:38:02,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:38:02,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:38:01" (1/1) ... [2022-07-21 09:38:02,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:38:01" (1/1) ... [2022-07-21 09:38:02,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:38:01" (1/1) ... [2022-07-21 09:38:02,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:38:01" (1/1) ... [2022-07-21 09:38:02,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:38:01" (1/1) ... [2022-07-21 09:38:02,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:38:01" (1/1) ... [2022-07-21 09:38:02,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:38:01" (1/1) ... [2022-07-21 09:38:02,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:38:02,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:38:02,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:38:02,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:38:02,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:38:01" (1/1) ... [2022-07-21 09:38:02,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:38:02,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:38:02,222 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) [2022-07-21 09:38:02,227 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 [2022-07-21 09:38:02,264 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-21 09:38:02,265 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-21 09:38:02,265 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-21 09:38:02,265 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-21 09:38:02,265 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-21 09:38:02,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-21 09:38:02,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:38:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-21 09:38:02,266 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-21 09:38:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:38:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 09:38:02,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 09:38:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:38:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:38:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 09:38:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:38:02,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:38:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-21 09:38:02,268 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-21 09:38:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 09:38:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_bytes [2022-07-21 09:38:02,269 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_bytes [2022-07-21 09:38:02,269 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 09:38:02,269 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 09:38:02,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:38:02,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 09:38:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 09:38:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-21 09:38:02,270 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-21 09:38:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-21 09:38:02,270 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-21 09:38:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:38:02,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:38:02,468 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:38:02,471 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:38:03,142 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:38:03,150 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:38:03,150 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 09:38:03,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:38:03 BoogieIcfgContainer [2022-07-21 09:38:03,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:38:03,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:38:03,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:38:03,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:38:03,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:38:00" (1/3) ... [2022-07-21 09:38:03,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721d9495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:38:03, skipping insertion in model container [2022-07-21 09:38:03,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:38:01" (2/3) ... [2022-07-21 09:38:03,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721d9495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:38:03, skipping insertion in model container [2022-07-21 09:38:03,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:38:03" (3/3) ... [2022-07-21 09:38:03,158 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_string_harness.i [2022-07-21 09:38:03,167 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:38:03,167 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:38:03,218 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:38:03,222 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b8aa56d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e543f72 [2022-07-21 09:38:03,223 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 09:38:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-21 09:38:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-21 09:38:03,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:38:03,234 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:38:03,235 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:38:03,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:38:03,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1122645662, now seen corresponding path program 1 times [2022-07-21 09:38:03,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:38:03,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751806596] [2022-07-21 09:38:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:38:03,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:38:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:03,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:38:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:03,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:03,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:38:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:03,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:38:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:03,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:03,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:38:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:03,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:38:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:03,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:38:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:03,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:38:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:03,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:03,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:38:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:03,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 09:38:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:03,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:38:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-21 09:38:03,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:38:03,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751806596] [2022-07-21 09:38:03,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751806596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:38:03,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:38:03,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:38:03,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882520524] [2022-07-21 09:38:03,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:38:03,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:38:03,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:38:03,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:38:03,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:38:03,875 INFO L87 Difference]: Start difference. First operand has 104 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 09:38:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:38:04,069 INFO L93 Difference]: Finished difference Result 201 states and 264 transitions. [2022-07-21 09:38:04,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:38:04,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 85 [2022-07-21 09:38:04,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:38:04,081 INFO L225 Difference]: With dead ends: 201 [2022-07-21 09:38:04,081 INFO L226 Difference]: Without dead ends: 98 [2022-07-21 09:38:04,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:38:04,093 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 92 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:38:04,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 140 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:38:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-21 09:38:04,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-21 09:38:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 63 states have internal predecessors, (71), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-21 09:38:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2022-07-21 09:38:04,128 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 85 [2022-07-21 09:38:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:38:04,129 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2022-07-21 09:38:04,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 09:38:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2022-07-21 09:38:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-21 09:38:04,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:38:04,134 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:38:04,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 09:38:04,134 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:38:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:38:04,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1334345696, now seen corresponding path program 1 times [2022-07-21 09:38:04,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:38:04,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622681733] [2022-07-21 09:38:04,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:38:04,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:38:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:04,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:38:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:04,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:04,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:38:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:04,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:38:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:04,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:04,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:38:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:04,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:38:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:04,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:38:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:04,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:38:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:04,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:04,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:38:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:04,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 09:38:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:04,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:38:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-21 09:38:04,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:38:04,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622681733] [2022-07-21 09:38:04,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622681733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:38:04,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:38:04,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:38:04,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249630299] [2022-07-21 09:38:04,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:38:04,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:38:04,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:38:04,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:38:04,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:38:04,507 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 09:38:04,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:38:04,813 INFO L93 Difference]: Finished difference Result 155 states and 190 transitions. [2022-07-21 09:38:04,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:38:04,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 85 [2022-07-21 09:38:04,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:38:04,817 INFO L225 Difference]: With dead ends: 155 [2022-07-21 09:38:04,817 INFO L226 Difference]: Without dead ends: 101 [2022-07-21 09:38:04,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:38:04,820 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 111 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:38:04,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 268 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 09:38:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-21 09:38:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-21 09:38:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.140625) internal successors, (73), 66 states have internal predecessors, (73), 25 states have call successors, (25), 10 states have call predecessors, (25), 11 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-07-21 09:38:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2022-07-21 09:38:04,838 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 85 [2022-07-21 09:38:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:38:04,839 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2022-07-21 09:38:04,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 09:38:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2022-07-21 09:38:04,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-21 09:38:04,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:38:04,844 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:38:04,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 09:38:04,845 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:38:04,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:38:04,848 INFO L85 PathProgramCache]: Analyzing trace with hash 50703397, now seen corresponding path program 1 times [2022-07-21 09:38:04,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:38:04,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990902338] [2022-07-21 09:38:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:38:04,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:38:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:38:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:38:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:38:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:38:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:38:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:38:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:38:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:38:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 09:38:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:38:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-21 09:38:05,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:38:05,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990902338] [2022-07-21 09:38:05,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990902338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:38:05,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:38:05,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 09:38:05,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650812153] [2022-07-21 09:38:05,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:38:05,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 09:38:05,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:38:05,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 09:38:05,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:38:05,125 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-21 09:38:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:38:05,511 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2022-07-21 09:38:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:38:05,512 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2022-07-21 09:38:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:38:05,513 INFO L225 Difference]: With dead ends: 113 [2022-07-21 09:38:05,513 INFO L226 Difference]: Without dead ends: 111 [2022-07-21 09:38:05,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-21 09:38:05,513 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:38:05,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 419 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 09:38:05,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-21 09:38:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2022-07-21 09:38:05,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 73 states have internal predecessors, (79), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-21 09:38:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2022-07-21 09:38:05,520 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 87 [2022-07-21 09:38:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:38:05,520 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2022-07-21 09:38:05,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-21 09:38:05,520 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2022-07-21 09:38:05,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-21 09:38:05,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:38:05,521 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:38:05,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 09:38:05,521 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:38:05,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:38:05,521 INFO L85 PathProgramCache]: Analyzing trace with hash 976473645, now seen corresponding path program 1 times [2022-07-21 09:38:05,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:38:05,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313493823] [2022-07-21 09:38:05,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:38:05,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:38:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:38:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:38:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:38:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:38:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:38:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:38:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:38:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:38:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 09:38:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:38:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 09:38:05,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:38:05,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313493823] [2022-07-21 09:38:05,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313493823] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:38:05,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785493598] [2022-07-21 09:38:05,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:38:05,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:38:05,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:38:05,952 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:38:05,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 09:38:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:06,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 2658 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-21 09:38:06,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:38:06,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:38:06,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 09:38:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-21 09:38:07,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:38:07,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785493598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:38:07,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:38:07,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [13] total 30 [2022-07-21 09:38:07,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703974615] [2022-07-21 09:38:07,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:38:07,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 09:38:07,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:38:07,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 09:38:07,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=801, Unknown=0, NotChecked=0, Total=870 [2022-07-21 09:38:07,008 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 15 states have internal predecessors, (46), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-21 09:38:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:38:07,199 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2022-07-21 09:38:07,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 09:38:07,201 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 15 states have internal predecessors, (46), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) Word has length 91 [2022-07-21 09:38:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:38:07,202 INFO L225 Difference]: With dead ends: 196 [2022-07-21 09:38:07,202 INFO L226 Difference]: Without dead ends: 127 [2022-07-21 09:38:07,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 09:38:07,203 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 32 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:38:07,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1545 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 84 Unchecked, 0.1s Time] [2022-07-21 09:38:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-21 09:38:07,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-07-21 09:38:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 83 states have (on average 1.144578313253012) internal successors, (95), 86 states have internal predecessors, (95), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-21 09:38:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2022-07-21 09:38:07,219 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 91 [2022-07-21 09:38:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:38:07,220 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2022-07-21 09:38:07,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 15 states have internal predecessors, (46), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-21 09:38:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2022-07-21 09:38:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-21 09:38:07,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:38:07,224 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:38:07,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 09:38:07,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:38:07,439 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:38:07,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:38:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1234639083, now seen corresponding path program 1 times [2022-07-21 09:38:07,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:38:07,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934680388] [2022-07-21 09:38:07,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:38:07,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:38:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:07,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:38:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:07,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:07,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:38:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:07,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:38:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:07,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:07,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:38:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:07,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:38:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:07,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:38:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:07,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:38:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:07,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:38:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:07,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 09:38:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:07,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:38:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:07,753 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-21 09:38:07,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:38:07,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934680388] [2022-07-21 09:38:07,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934680388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:38:07,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:38:07,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:38:07,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431891646] [2022-07-21 09:38:07,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:38:07,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:38:07,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:38:07,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:38:07,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:38:07,756 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-21 09:38:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:38:08,032 INFO L93 Difference]: Finished difference Result 183 states and 222 transitions. [2022-07-21 09:38:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:38:08,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2022-07-21 09:38:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:38:08,033 INFO L225 Difference]: With dead ends: 183 [2022-07-21 09:38:08,033 INFO L226 Difference]: Without dead ends: 118 [2022-07-21 09:38:08,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:38:08,034 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 55 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:38:08,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 227 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:38:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-21 09:38:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2022-07-21 09:38:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 79 states have internal predecessors, (86), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (27), 25 states have call predecessors, (27), 25 states have call successors, (27) [2022-07-21 09:38:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2022-07-21 09:38:08,046 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 91 [2022-07-21 09:38:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:38:08,046 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2022-07-21 09:38:08,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-21 09:38:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2022-07-21 09:38:08,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-21 09:38:08,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:38:08,048 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:38:08,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 09:38:08,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:38:08,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:38:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2058076652, now seen corresponding path program 1 times [2022-07-21 09:38:08,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:38:08,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985758838] [2022-07-21 09:38:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:38:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:38:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:38:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:08,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:38:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:08,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:38:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:08,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:08,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:38:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:08,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:38:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:08,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:38:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:08,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:38:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:08,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:08,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:38:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:08,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 09:38:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:08,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:38:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-21 09:38:08,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:38:08,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985758838] [2022-07-21 09:38:08,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985758838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:38:08,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:38:08,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-21 09:38:08,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937189456] [2022-07-21 09:38:08,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:38:08,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 09:38:08,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:38:08,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 09:38:08,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-21 09:38:08,352 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-21 09:38:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:38:08,946 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2022-07-21 09:38:08,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 09:38:08,946 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2022-07-21 09:38:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:38:08,947 INFO L225 Difference]: With dead ends: 131 [2022-07-21 09:38:08,947 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 09:38:08,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-07-21 09:38:08,948 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 85 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:38:08,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 605 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 09:38:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 09:38:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2022-07-21 09:38:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 78 states have (on average 1.1153846153846154) internal successors, (87), 80 states have internal predecessors, (87), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-07-21 09:38:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2022-07-21 09:38:08,953 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 93 [2022-07-21 09:38:08,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:38:08,954 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2022-07-21 09:38:08,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-21 09:38:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2022-07-21 09:38:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-21 09:38:08,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:38:08,955 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:38:08,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 09:38:08,955 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:38:08,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:38:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1315799824, now seen corresponding path program 1 times [2022-07-21 09:38:08,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:38:08,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376257056] [2022-07-21 09:38:08,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:38:08,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:38:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:38:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:38:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:38:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:38:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:38:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:38:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:38:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 09:38:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 09:38:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:38:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:38:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:38:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-21 09:38:09,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:38:09,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376257056] [2022-07-21 09:38:09,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376257056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:38:09,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306571082] [2022-07-21 09:38:09,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:38:09,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:38:09,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:38:09,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:38:09,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 09:38:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:09,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 2703 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-21 09:38:09,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:38:09,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 09:38:11,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:38:11,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2022-07-21 09:38:11,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-07-21 09:38:14,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:38:14,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:38:14,987 INFO L356 Elim1Store]: treesize reduction 120, result has 17.2 percent of original size [2022-07-21 09:38:14,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 16 case distinctions, treesize of input 144 treesize of output 109 [2022-07-21 09:38:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 09:38:15,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:38:27,288 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:38:27,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 90 [2022-07-21 09:38:27,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306571082] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:38:27,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:38:27,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 36] total 46 [2022-07-21 09:38:27,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883706449] [2022-07-21 09:38:27,802 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:38:27,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-21 09:38:27,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:38:27,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-21 09:38:27,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3574, Unknown=0, NotChecked=0, Total=3782 [2022-07-21 09:38:27,804 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand has 46 states, 39 states have (on average 2.717948717948718) internal successors, (106), 34 states have internal predecessors, (106), 16 states have call successors, (32), 8 states have call predecessors, (32), 12 states have return successors, (30), 16 states have call predecessors, (30), 15 states have call successors, (30) [2022-07-21 09:38:28,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:38:28,688 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2022-07-21 09:38:28,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 09:38:28,689 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 39 states have (on average 2.717948717948718) internal successors, (106), 34 states have internal predecessors, (106), 16 states have call successors, (32), 8 states have call predecessors, (32), 12 states have return successors, (30), 16 states have call predecessors, (30), 15 states have call successors, (30) Word has length 103 [2022-07-21 09:38:28,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:38:28,689 INFO L225 Difference]: With dead ends: 124 [2022-07-21 09:38:28,689 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 09:38:28,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=295, Invalid=5107, Unknown=0, NotChecked=0, Total=5402 [2022-07-21 09:38:28,691 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:38:28,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 355 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 559 Invalid, 0 Unknown, 133 Unchecked, 0.4s Time] [2022-07-21 09:38:28,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 09:38:28,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 09:38:28,692 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) [2022-07-21 09:38:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 09:38:28,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2022-07-21 09:38:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:38:28,693 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 09:38:28,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 39 states have (on average 2.717948717948718) internal successors, (106), 34 states have internal predecessors, (106), 16 states have call successors, (32), 8 states have call predecessors, (32), 12 states have return successors, (30), 16 states have call predecessors, (30), 15 states have call successors, (30) [2022-07-21 09:38:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 09:38:28,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 09:38:28,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 09:38:28,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 09:38:28,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-21 09:38:28,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 09:38:29,017 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (< |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| |#StackHeapBarrier|) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| |#StackHeapBarrier|) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0)) [2022-07-21 09:38:29,017 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-07-21 09:38:29,018 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| |#StackHeapBarrier|)) [2022-07-21 09:38:29,018 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-21 09:38:29,020 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) .cse0) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (let ((.cse1 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (<= .cse1 (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ .cse1 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)))))) (= |old(#valid)| |#valid|))) [2022-07-21 09:38:29,020 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-21 09:38:29,020 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| |#StackHeapBarrier|)) [2022-07-21 09:38:29,020 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-21 09:38:29,020 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-21 09:38:29,020 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-21 09:38:29,021 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-21 09:38:29,021 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-21 09:38:29,021 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-21 09:38:29,021 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-21 09:38:29,021 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-07-21 09:38:29,021 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-21 09:38:29,021 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-21 09:38:29,021 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-21 09:38:29,021 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-21 09:38:29,022 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-21 09:38:29,022 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-21 09:38:29,022 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-21 09:38:29,022 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-21 09:38:29,022 INFO L902 garLoopResultBuilder]: At program point aws_string_bytesENTRY(lines 6242 6246) the Hoare annotation is: true [2022-07-21 09:38:29,022 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesEXIT(lines 6242 6246) no Hoare annotation was computed. [2022-07-21 09:38:29,022 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesFINAL(lines 6242 6246) no Hoare annotation was computed. [2022-07-21 09:38:29,022 INFO L902 garLoopResultBuilder]: At program point L6244-1(line 6244) the Hoare annotation is: true [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point L6244-2(line 6244) no Hoare annotation was computed. [2022-07-21 09:38:29,023 INFO L902 garLoopResultBuilder]: At program point L6244(line 6244) the Hoare annotation is: true [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-21 09:38:29,023 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-21 09:38:29,023 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-21 09:38:29,023 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-21 09:38:29,023 INFO L902 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7368 7372) the Hoare annotation is: true [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point L7371(line 7371) no Hoare annotation was computed. [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2022-07-21 09:38:29,023 INFO L899 garLoopResultBuilder]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2022-07-21 09:38:29,024 INFO L899 garLoopResultBuilder]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2022-07-21 09:38:29,024 INFO L899 garLoopResultBuilder]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2022-07-21 09:38:29,024 INFO L899 garLoopResultBuilder]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2022-07-21 09:38:29,024 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7368 7372) no Hoare annotation was computed. [2022-07-21 09:38:29,024 INFO L899 garLoopResultBuilder]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2022-07-21 09:38:29,024 INFO L899 garLoopResultBuilder]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2022-07-21 09:38:29,024 INFO L899 garLoopResultBuilder]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2022-07-21 09:38:29,025 INFO L899 garLoopResultBuilder]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2022-07-21 09:38:29,025 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7368 7372) no Hoare annotation was computed. [2022-07-21 09:38:29,025 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-21 09:38:29,025 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-21 09:38:29,025 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-21 09:38:29,025 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 09:38:29,025 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-21 09:38:29,026 INFO L899 garLoopResultBuilder]: For program point L9538-1(line 9538) no Hoare annotation was computed. [2022-07-21 09:38:29,026 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-21 09:38:29,026 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-07-21 09:38:29,026 INFO L899 garLoopResultBuilder]: For program point L9518-1(line 9518) no Hoare annotation was computed. [2022-07-21 09:38:29,027 INFO L899 garLoopResultBuilder]: For program point L8240-2(line 8240) no Hoare annotation was computed. [2022-07-21 09:38:29,027 INFO L895 garLoopResultBuilder]: At program point L8240-1(line 8240) the Hoare annotation is: false [2022-07-21 09:38:29,027 INFO L895 garLoopResultBuilder]: At program point L9518-2(lines 9516 9519) the Hoare annotation is: false [2022-07-21 09:38:29,027 INFO L895 garLoopResultBuilder]: At program point L8240(line 8240) the Hoare annotation is: false [2022-07-21 09:38:29,027 INFO L899 garLoopResultBuilder]: For program point L8236-1(line 8236) no Hoare annotation was computed. [2022-07-21 09:38:29,028 INFO L895 garLoopResultBuilder]: At program point L8236(line 8236) the Hoare annotation is: false [2022-07-21 09:38:29,028 INFO L895 garLoopResultBuilder]: At program point L9518(line 9518) the Hoare annotation is: false [2022-07-21 09:38:29,028 INFO L895 garLoopResultBuilder]: At program point L9541(line 9541) the Hoare annotation is: false [2022-07-21 09:38:29,028 INFO L895 garLoopResultBuilder]: At program point L9541-1(line 9541) the Hoare annotation is: false [2022-07-21 09:38:29,028 INFO L899 garLoopResultBuilder]: For program point L9541-2(line 9541) no Hoare annotation was computed. [2022-07-21 09:38:29,028 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-21 09:38:29,028 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-07-21 09:38:29,028 INFO L895 garLoopResultBuilder]: At program point L9543(line 9543) the Hoare annotation is: false [2022-07-21 09:38:29,028 INFO L899 garLoopResultBuilder]: For program point L9543-1(line 9543) no Hoare annotation was computed. [2022-07-21 09:38:29,029 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 09:38:29,029 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 09:38:29,029 INFO L899 garLoopResultBuilder]: For program point L9537(lines 9537 9545) no Hoare annotation was computed. [2022-07-21 09:38:29,029 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 09:38:29,029 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-21 09:38:29,029 INFO L895 garLoopResultBuilder]: At program point L9517(line 9517) the Hoare annotation is: false [2022-07-21 09:38:29,029 INFO L895 garLoopResultBuilder]: At program point L9517-1(line 9517) the Hoare annotation is: false [2022-07-21 09:38:29,029 INFO L899 garLoopResultBuilder]: For program point L9517-2(line 9517) no Hoare annotation was computed. [2022-07-21 09:38:29,030 INFO L895 garLoopResultBuilder]: At program point L8241(lines 8235 8242) the Hoare annotation is: false [2022-07-21 09:38:29,030 INFO L902 garLoopResultBuilder]: At program point L9546(line 9546) the Hoare annotation is: true [2022-07-21 09:38:29,031 INFO L899 garLoopResultBuilder]: For program point L9542-1(line 9542) no Hoare annotation was computed. [2022-07-21 09:38:29,031 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-07-21 09:38:29,031 INFO L895 garLoopResultBuilder]: At program point L9540(line 9540) the Hoare annotation is: false [2022-07-21 09:38:29,031 INFO L895 garLoopResultBuilder]: At program point L9540-1(line 9540) the Hoare annotation is: false [2022-07-21 09:38:29,031 INFO L902 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: true [2022-07-21 09:38:29,031 INFO L899 garLoopResultBuilder]: For program point L9540-2(line 9540) no Hoare annotation was computed. [2022-07-21 09:38:29,031 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-07-21 09:38:29,031 INFO L895 garLoopResultBuilder]: At program point L9542(line 9542) the Hoare annotation is: false [2022-07-21 09:38:29,032 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-21 09:38:29,032 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-21 09:38:29,032 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-21 09:38:29,032 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-21 09:38:29,032 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-21 09:38:29,033 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-21 09:38:29,033 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-21 09:38:29,035 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:38:29,036 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 09:38:29,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 09:38:29 BoogieIcfgContainer [2022-07-21 09:38:29,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 09:38:29,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 09:38:29,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 09:38:29,057 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 09:38:29,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:38:03" (3/4) ... [2022-07-21 09:38:29,059 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 09:38:29,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-07-21 09:38:29,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-21 09:38:29,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2022-07-21 09:38:29,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-21 09:38:29,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-21 09:38:29,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_bytes [2022-07-21 09:38:29,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-21 09:38:29,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-21 09:38:29,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-21 09:38:29,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-21 09:38:29,078 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2022-07-21 09:38:29,079 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2022-07-21 09:38:29,080 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-07-21 09:38:29,080 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-21 09:38:29,082 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-21 09:38:29,082 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-21 09:38:29,083 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 09:38:29,084 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 09:38:29,109 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(str == 0) && str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && \result < unknown-#StackHeapBarrier-unknown) && !(\old(max_size) == 16)) && str < unknown-#StackHeapBarrier-unknown) && \result == 0 [2022-07-21 09:38:29,392 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 09:38:29,393 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 09:38:29,393 INFO L158 Benchmark]: Toolchain (without parser) took 29126.12ms. Allocated memory was 52.4MB in the beginning and 379.6MB in the end (delta: 327.2MB). Free memory was 30.9MB in the beginning and 199.0MB in the end (delta: -168.0MB). Peak memory consumption was 288.1MB. Max. memory is 16.1GB. [2022-07-21 09:38:29,393 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 52.4MB. Free memory was 34.1MB in the beginning and 34.1MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 09:38:29,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1722.72ms. Allocated memory was 52.4MB in the beginning and 123.7MB in the end (delta: 71.3MB). Free memory was 30.7MB in the beginning and 60.3MB in the end (delta: -29.6MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2022-07-21 09:38:29,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.50ms. Allocated memory is still 123.7MB. Free memory was 60.3MB in the beginning and 47.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 09:38:29,394 INFO L158 Benchmark]: Boogie Preprocessor took 84.52ms. Allocated memory is still 123.7MB. Free memory was 47.7MB in the beginning and 41.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-21 09:38:29,394 INFO L158 Benchmark]: RCFGBuilder took 956.13ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 41.4MB in the beginning and 79.1MB in the end (delta: -37.7MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-07-21 09:38:29,395 INFO L158 Benchmark]: TraceAbstraction took 25902.58ms. Allocated memory was 151.0MB in the beginning and 379.6MB in the end (delta: 228.6MB). Free memory was 78.1MB in the beginning and 109.4MB in the end (delta: -31.3MB). Peak memory consumption was 197.2MB. Max. memory is 16.1GB. [2022-07-21 09:38:29,395 INFO L158 Benchmark]: Witness Printer took 336.45ms. Allocated memory is still 379.6MB. Free memory was 109.4MB in the beginning and 199.0MB in the end (delta: -89.6MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2022-07-21 09:38:29,396 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.41ms. Allocated memory is still 52.4MB. Free memory was 34.1MB in the beginning and 34.1MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1722.72ms. Allocated memory was 52.4MB in the beginning and 123.7MB in the end (delta: 71.3MB). Free memory was 30.7MB in the beginning and 60.3MB in the end (delta: -29.6MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.50ms. Allocated memory is still 123.7MB. Free memory was 60.3MB in the beginning and 47.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.52ms. Allocated memory is still 123.7MB. Free memory was 47.7MB in the beginning and 41.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 956.13ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 41.4MB in the beginning and 79.1MB in the end (delta: -37.7MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 25902.58ms. Allocated memory was 151.0MB in the beginning and 379.6MB in the end (delta: 228.6MB). Free memory was 78.1MB in the beginning and 109.4MB in the end (delta: -31.3MB). Peak memory consumption was 197.2MB. Max. memory is 16.1GB. * Witness Printer took 336.45ms. Allocated memory is still 379.6MB. Free memory was 109.4MB in the beginning and 199.0MB in the end (delta: -89.6MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.8s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 564 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 533 mSDsluCounter, 3559 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 217 IncrementalHoareTripleChecker+Unchecked, 2892 mSDsCounter, 266 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2490 IncrementalHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 266 mSolverCounterUnsat, 667 mSDtfsCounter, 2490 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 342 SyntacticMatches, 5 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=4, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 112 PreInvPairs, 117 NumberOfFragments, 277 HoareAnnotationTreeSize, 112 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 829 NumberOfCodeBlocks, 829 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 820 ConstructedInterpolants, 55 QuantifiedInterpolants, 5870 SizeOfPredicates, 52 NumberOfNonLiveVariables, 5361 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 398/455 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 9516]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 8235]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: ((((((!(str == 0) && str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && \result < unknown-#StackHeapBarrier-unknown) && !(\old(max_size) == 16)) && str < unknown-#StackHeapBarrier-unknown) && \result == 0 - InvariantResult [Line: 9546]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-21 09:38:29,430 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