./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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_hash_callback_c_str_eq_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 e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 00:31:14,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 00:31:14,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 00:31:14,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 00:31:14,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 00:31:14,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 00:31:14,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 00:31:14,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 00:31:14,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 00:31:14,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 00:31:14,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 00:31:14,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 00:31:14,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 00:31:14,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 00:31:14,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 00:31:14,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 00:31:14,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 00:31:14,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 00:31:14,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 00:31:14,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 00:31:14,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 00:31:14,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 00:31:14,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 00:31:14,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 00:31:14,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 00:31:14,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 00:31:14,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 00:31:14,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 00:31:14,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 00:31:14,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 00:31:14,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 00:31:14,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 00:31:14,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 00:31:14,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 00:31:14,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 00:31:14,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 00:31:14,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 00:31:14,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 00:31:14,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 00:31:14,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 00:31:14,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 00:31:14,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 00:31:14,938 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 00:31:14,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 00:31:14,939 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 00:31:14,939 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 00:31:14,940 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 00:31:14,940 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 00:31:14,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 00:31:14,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 00:31:14,942 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 00:31:14,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 00:31:14,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 00:31:14,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 00:31:14,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 00:31:14,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 00:31:14,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 00:31:14,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 00:31:14,944 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 00:31:14,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 00:31:14,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 00:31:14,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 00:31:14,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 00:31:14,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:31:14,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 00:31:14,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 00:31:14,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 00:31:14,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 00:31:14,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 00:31:14,946 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 00:31:14,946 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 00:31:14,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 00:31:14,947 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 00:31:14,947 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 -> e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 [2021-12-18 00:31:15,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 00:31:15,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 00:31:15,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 00:31:15,224 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 00:31:15,225 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 00:31:15,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-18 00:31:15,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd13fa504/d0c7f41cad85498a98205fe1901b8b5b/FLAGa14629714 [2021-12-18 00:31:15,883 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 00:31:15,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-18 00:31:15,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd13fa504/d0c7f41cad85498a98205fe1901b8b5b/FLAGa14629714 [2021-12-18 00:31:16,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd13fa504/d0c7f41cad85498a98205fe1901b8b5b [2021-12-18 00:31:16,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 00:31:16,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 00:31:16,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 00:31:16,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 00:31:16,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 00:31:16,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:31:16" (1/1) ... [2021-12-18 00:31:16,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12faae4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:16, skipping insertion in model container [2021-12-18 00:31:16,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:31:16" (1/1) ... [2021-12-18 00:31:16,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 00:31:16,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 00:31:16,368 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_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-18 00:31:16,375 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_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-18 00:31:16,950 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:16,950 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:16,951 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:16,951 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:16,952 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:16,961 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:16,962 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:16,963 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:16,963 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,191 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:31:17,192 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:31:17,192 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:31:17,193 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:31:17,196 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:31:17,198 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:31:17,199 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:31:17,199 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:31:17,201 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:31:17,202 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:31:17,316 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:31:17,411 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,411 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,564 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,565 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,575 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,576 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,578 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,578 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,586 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,587 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,587 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,587 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,588 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,588 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,589 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:31:17,649 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 00:31:17,664 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_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-18 00:31:17,664 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_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-18 00:31:17,698 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,699 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,699 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,699 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,699 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,702 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,702 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,703 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,703 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,719 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:31:17,720 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:31:17,720 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:31:17,720 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:31:17,721 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:31:17,721 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:31:17,721 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:31:17,722 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:31:17,722 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:31:17,722 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:31:17,732 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:31:17,789 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,795 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,864 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,870 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,876 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,891 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,895 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,895 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,900 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,900 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,901 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,901 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,901 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,901 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,902 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:17,923 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:31:18,119 INFO L208 MainTranslator]: Completed translation [2021-12-18 00:31:18,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:18 WrapperNode [2021-12-18 00:31:18,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 00:31:18,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 00:31:18,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 00:31:18,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 00:31:18,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:18" (1/1) ... [2021-12-18 00:31:18,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:18" (1/1) ... [2021-12-18 00:31:18,369 INFO L137 Inliner]: procedures = 768, calls = 3253, calls flagged for inlining = 78, calls inlined = 5, statements flattened = 337 [2021-12-18 00:31:18,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 00:31:18,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 00:31:18,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 00:31:18,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 00:31:18,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:18" (1/1) ... [2021-12-18 00:31:18,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:18" (1/1) ... [2021-12-18 00:31:18,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:18" (1/1) ... [2021-12-18 00:31:18,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:18" (1/1) ... [2021-12-18 00:31:18,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:18" (1/1) ... [2021-12-18 00:31:18,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:18" (1/1) ... [2021-12-18 00:31:18,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:18" (1/1) ... [2021-12-18 00:31:18,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 00:31:18,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 00:31:18,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 00:31:18,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 00:31:18,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:18" (1/1) ... [2021-12-18 00:31:18,411 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:31:18,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:31:18,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 00:31:18,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 00:31:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-18 00:31:18,487 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-18 00:31:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 00:31:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-18 00:31:18,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-18 00:31:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 00:31:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 00:31:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 00:31:18,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 00:31:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-18 00:31:18,489 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-18 00:31:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-18 00:31:18,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-18 00:31:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 00:31:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-18 00:31:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-18 00:31:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2021-12-18 00:31:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2021-12-18 00:31:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2021-12-18 00:31:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2021-12-18 00:31:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 00:31:18,737 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 00:31:18,745 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 00:31:18,979 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2021-12-18 00:31:18,987 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 00:31:18,994 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 00:31:18,994 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-18 00:31:18,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:31:18 BoogieIcfgContainer [2021-12-18 00:31:18,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 00:31:18,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 00:31:18,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 00:31:19,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 00:31:19,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:31:16" (1/3) ... [2021-12-18 00:31:19,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259161d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:31:19, skipping insertion in model container [2021-12-18 00:31:19,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:18" (2/3) ... [2021-12-18 00:31:19,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259161d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:31:19, skipping insertion in model container [2021-12-18 00:31:19,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:31:18" (3/3) ... [2021-12-18 00:31:19,004 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2021-12-18 00:31:19,008 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 00:31:19,008 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 00:31:19,053 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 00:31:19,060 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 00:31:19,061 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 00:31:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-18 00:31:19,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-18 00:31:19,083 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:19,084 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2021-12-18 00:31:19,084 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:19,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:19,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2021-12-18 00:31:19,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:31:19,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642284728] [2021-12-18 00:31:19,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:19,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:31:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:19,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:31:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:19,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:19,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:31:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:19,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:31:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:19,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:19,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:31:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:19,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:31:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:19,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 00:31:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:19,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:31:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:19,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:31:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:19,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 00:31:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-18 00:31:19,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:31:19,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642284728] [2021-12-18 00:31:19,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642284728] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:31:19,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:31:19,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 00:31:19,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965051080] [2021-12-18 00:31:19,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:31:19,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 00:31:19,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:31:19,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 00:31:19,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 00:31:19,652 INFO L87 Difference]: Start difference. First operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-18 00:31:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:31:19,736 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2021-12-18 00:31:19,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 00:31:19,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2021-12-18 00:31:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:31:19,743 INFO L225 Difference]: With dead ends: 139 [2021-12-18 00:31:19,743 INFO L226 Difference]: Without dead ends: 65 [2021-12-18 00:31:19,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 00:31:19,747 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:31:19,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 113 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:31:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-18 00:31:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-18 00:31:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-18 00:31:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2021-12-18 00:31:19,774 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2021-12-18 00:31:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:31:19,775 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2021-12-18 00:31:19,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-18 00:31:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2021-12-18 00:31:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-18 00:31:19,777 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:19,777 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:31:19,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 00:31:19,777 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:19,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2021-12-18 00:31:19,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:31:19,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146277691] [2021-12-18 00:31:19,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:19,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:31:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:19,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:31:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:31:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:31:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:31:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:31:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 00:31:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:31:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:31:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 00:31:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 00:31:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-18 00:31:20,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:31:20,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146277691] [2021-12-18 00:31:20,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146277691] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:31:20,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:31:20,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-18 00:31:20,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440894666] [2021-12-18 00:31:20,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:31:20,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 00:31:20,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:31:20,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 00:31:20,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-18 00:31:20,286 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-18 00:31:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:31:20,577 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2021-12-18 00:31:20,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 00:31:20,577 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 70 [2021-12-18 00:31:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:31:20,579 INFO L225 Difference]: With dead ends: 89 [2021-12-18 00:31:20,579 INFO L226 Difference]: Without dead ends: 65 [2021-12-18 00:31:20,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-12-18 00:31:20,580 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 46 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:31:20,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 497 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:31:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-18 00:31:20,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-18 00:31:20,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-18 00:31:20,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2021-12-18 00:31:20,588 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2021-12-18 00:31:20,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:31:20,592 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2021-12-18 00:31:20,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-18 00:31:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2021-12-18 00:31:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-18 00:31:20,594 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:20,594 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:31:20,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 00:31:20,594 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:20,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:20,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2021-12-18 00:31:20,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:31:20,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336492121] [2021-12-18 00:31:20,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:20,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:31:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:31:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:31:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:31:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:31:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:31:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 00:31:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:31:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:31:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 00:31:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 00:31:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 00:31:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-18 00:31:20,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:31:20,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336492121] [2021-12-18 00:31:20,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336492121] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:31:20,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:31:20,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-18 00:31:20,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797856712] [2021-12-18 00:31:20,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:31:20,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-18 00:31:20,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:31:20,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-18 00:31:20,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2021-12-18 00:31:20,956 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-18 00:31:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:31:21,342 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2021-12-18 00:31:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 00:31:21,342 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2021-12-18 00:31:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:31:21,343 INFO L225 Difference]: With dead ends: 94 [2021-12-18 00:31:21,343 INFO L226 Difference]: Without dead ends: 92 [2021-12-18 00:31:21,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2021-12-18 00:31:21,344 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 58 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 00:31:21,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 721 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 00:31:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-18 00:31:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2021-12-18 00:31:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-18 00:31:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2021-12-18 00:31:21,353 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2021-12-18 00:31:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:31:21,354 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2021-12-18 00:31:21,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-18 00:31:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2021-12-18 00:31:21,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-18 00:31:21,355 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:21,356 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2021-12-18 00:31:21,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 00:31:21,356 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:21,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:21,356 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2021-12-18 00:31:21,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:31:21,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039151372] [2021-12-18 00:31:21,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:21,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:31:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:31:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:31:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:31:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:31:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:31:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 00:31:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:31:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:31:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 00:31:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 00:31:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 00:31:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:31:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-18 00:31:21,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:31:21,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039151372] [2021-12-18 00:31:21,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039151372] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:31:21,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:31:21,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-18 00:31:21,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561991739] [2021-12-18 00:31:21,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:31:21,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 00:31:21,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:31:21,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 00:31:21,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-18 00:31:21,774 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-18 00:31:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:31:22,042 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2021-12-18 00:31:22,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 00:31:22,043 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 83 [2021-12-18 00:31:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:31:22,044 INFO L225 Difference]: With dead ends: 98 [2021-12-18 00:31:22,044 INFO L226 Difference]: Without dead ends: 96 [2021-12-18 00:31:22,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-12-18 00:31:22,045 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 57 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:31:22,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 635 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:31:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-18 00:31:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-12-18 00:31:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 55 states have internal predecessors, (55), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-18 00:31:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2021-12-18 00:31:22,052 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2021-12-18 00:31:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:31:22,052 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2021-12-18 00:31:22,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-18 00:31:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2021-12-18 00:31:22,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-18 00:31:22,053 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:22,054 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:31:22,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 00:31:22,054 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:22,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:22,054 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2021-12-18 00:31:22,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:31:22,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329503672] [2021-12-18 00:31:22,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:22,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:31:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:31:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:31:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:31:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:31:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:31:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-18 00:31:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:31:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:31:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:31:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 00:31:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 00:31:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:31:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-18 00:31:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 00:31:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-18 00:31:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-12-18 00:31:22,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:31:22,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329503672] [2021-12-18 00:31:22,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329503672] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:31:22,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:31:22,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-18 00:31:22,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331287610] [2021-12-18 00:31:22,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:31:22,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 00:31:22,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:31:22,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 00:31:22,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:31:22,416 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-18 00:31:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:31:22,730 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2021-12-18 00:31:22,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 00:31:22,731 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 107 [2021-12-18 00:31:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:31:22,732 INFO L225 Difference]: With dead ends: 102 [2021-12-18 00:31:22,732 INFO L226 Difference]: Without dead ends: 100 [2021-12-18 00:31:22,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2021-12-18 00:31:22,733 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 31 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:31:22,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 1006 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:31:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-18 00:31:22,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-12-18 00:31:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 58 states have internal predecessors, (58), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-18 00:31:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2021-12-18 00:31:22,742 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2021-12-18 00:31:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:31:22,742 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2021-12-18 00:31:22,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-18 00:31:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2021-12-18 00:31:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-18 00:31:22,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:22,744 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:31:22,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 00:31:22,744 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:22,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:22,744 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2021-12-18 00:31:22,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:31:22,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530326949] [2021-12-18 00:31:22,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:22,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:31:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:31:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:31:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:31:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:31:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:31:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-18 00:31:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:31:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:31:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:31:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 00:31:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 00:31:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:31:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-18 00:31:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 00:31:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-18 00:31:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-18 00:31:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-18 00:31:23,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:31:23,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530326949] [2021-12-18 00:31:23,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530326949] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:31:23,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:31:23,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-18 00:31:23,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676146426] [2021-12-18 00:31:23,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:31:23,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 00:31:23,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:31:23,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 00:31:23,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:31:23,198 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-18 00:31:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:31:23,469 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2021-12-18 00:31:23,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 00:31:23,469 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2021-12-18 00:31:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:31:23,480 INFO L225 Difference]: With dead ends: 100 [2021-12-18 00:31:23,481 INFO L226 Difference]: Without dead ends: 96 [2021-12-18 00:31:23,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-12-18 00:31:23,484 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 43 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:31:23,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 560 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:31:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-18 00:31:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-12-18 00:31:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-18 00:31:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-12-18 00:31:23,495 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2021-12-18 00:31:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:31:23,497 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-12-18 00:31:23,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-18 00:31:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-12-18 00:31:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-18 00:31:23,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:23,499 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 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] [2021-12-18 00:31:23,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 00:31:23,499 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:23,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2021-12-18 00:31:23,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:31:23,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121250660] [2021-12-18 00:31:23,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:23,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:31:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:31:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:31:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:31:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:31:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:31:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:31:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 00:31:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:31:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:31:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 00:31:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 00:31:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 00:31:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:31:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-18 00:31:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 00:31:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-18 00:31:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-18 00:31:23,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:31:23,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121250660] [2021-12-18 00:31:23,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121250660] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:31:23,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:31:23,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-18 00:31:23,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283576426] [2021-12-18 00:31:23,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:31:23,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 00:31:23,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:31:23,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 00:31:23,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:31:23,985 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) [2021-12-18 00:31:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:31:24,286 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2021-12-18 00:31:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 00:31:24,287 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) Word has length 100 [2021-12-18 00:31:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:31:24,288 INFO L225 Difference]: With dead ends: 102 [2021-12-18 00:31:24,288 INFO L226 Difference]: Without dead ends: 71 [2021-12-18 00:31:24,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-12-18 00:31:24,289 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 51 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:31:24,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 723 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:31:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-18 00:31:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-18 00:31:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0) internal successors, (43), 43 states have internal predecessors, (43), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-18 00:31:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-18 00:31:24,293 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2021-12-18 00:31:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:31:24,293 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-18 00:31:24,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) [2021-12-18 00:31:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-18 00:31:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-18 00:31:24,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:24,295 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:31:24,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 00:31:24,295 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:24,295 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2021-12-18 00:31:24,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:31:24,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503793452] [2021-12-18 00:31:24,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:24,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:31:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 00:31:24,469 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 00:31:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 00:31:24,644 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-18 00:31:24,644 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 00:31:24,645 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-18 00:31:24,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 00:31:24,649 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:31:24,652 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 00:31:24,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:31:24 BoogieIcfgContainer [2021-12-18 00:31:24,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 00:31:24,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 00:31:24,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 00:31:24,698 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 00:31:24,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:31:18" (3/4) ... [2021-12-18 00:31:24,701 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-18 00:31:24,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 00:31:24,702 INFO L158 Benchmark]: Toolchain (without parser) took 8630.95ms. Allocated memory was 138.4MB in the beginning and 295.7MB in the end (delta: 157.3MB). Free memory was 110.4MB in the beginning and 128.2MB in the end (delta: -17.8MB). Peak memory consumption was 140.2MB. Max. memory is 16.1GB. [2021-12-18 00:31:24,702 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory was 70.6MB in the beginning and 70.5MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 00:31:24,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2047.46ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 110.4MB in the beginning and 120.2MB in the end (delta: -9.9MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. [2021-12-18 00:31:24,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 248.73ms. Allocated memory is still 186.6MB. Free memory was 120.2MB in the beginning and 122.9MB in the end (delta: -2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-18 00:31:24,703 INFO L158 Benchmark]: Boogie Preprocessor took 35.38ms. Allocated memory is still 186.6MB. Free memory was 122.9MB in the beginning and 118.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-18 00:31:24,703 INFO L158 Benchmark]: RCFGBuilder took 590.66ms. Allocated memory is still 186.6MB. Free memory was 118.8MB in the beginning and 89.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-18 00:31:24,704 INFO L158 Benchmark]: TraceAbstraction took 5700.25ms. Allocated memory was 186.6MB in the beginning and 295.7MB in the end (delta: 109.1MB). Free memory was 88.3MB in the beginning and 128.2MB in the end (delta: -39.8MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2021-12-18 00:31:24,704 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 295.7MB. Free memory was 128.2MB in the beginning and 128.2MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 00:31:24,705 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory was 70.6MB in the beginning and 70.5MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2047.46ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 110.4MB in the beginning and 120.2MB in the end (delta: -9.9MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 248.73ms. Allocated memory is still 186.6MB. Free memory was 120.2MB in the beginning and 122.9MB in the end (delta: -2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.38ms. Allocated memory is still 186.6MB. Free memory was 122.9MB in the beginning and 118.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 590.66ms. Allocated memory is still 186.6MB. Free memory was 118.8MB in the beginning and 89.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5700.25ms. Allocated memory was 186.6MB in the beginning and 295.7MB in the end (delta: 109.1MB). Free memory was 88.3MB in the beginning and 128.2MB in the end (delta: -39.8MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 295.7MB. Free memory was 128.2MB in the beginning and 128.2MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. 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 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of strcmp at line 10798, overapproximation of strlen at line 11324. Possible FailurePath: [L6879-L6884] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7634-L7646] static const uint8_t s_tolower_table[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 91, 92, 93, 94, 95, 96, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255}; VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11328] CALL aws_hash_callback_c_str_eq_harness() [L11318] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=-36893488147419103231, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, size=1] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={-2:0}, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={-2:0}, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}] [L11318] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-2:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11318] const char *str1 = ensure_c_str_is_allocated(64); [L11319] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L261] return __VERIFIER_nondet_bool(); [L11319] RET, EXPR nondet_bool() VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={-2:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={-2:0}] [L11319] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=-18446744073709551615, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, size=1] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={-3:0}, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={-3:0}, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}] [L11319] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-3:0}, nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={-2:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-3:0}, nondet_bool()=0, nondet_bool() ? str1 : ensure_c_str_is_allocated(64)={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={-2:0}] [L11319] const char *str2 = nondet_bool() ? str1 : ensure_c_str_is_allocated(64); [L11322] CALL, EXPR aws_hash_callback_c_str_eq(str1, str2) [L10794] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}, str={-2:0}] [L10794] RET, EXPR aws_c_string_is_valid(a) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10794] CALL assume_abort_if_not((aws_c_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10794] RET assume_abort_if_not((aws_c_string_is_valid(a))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}, str={-3:0}] [L10795] RET, EXPR aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] CALL assume_abort_if_not((aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] RET assume_abort_if_not((aws_c_string_is_valid(b))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10797-L10798] _Bool rval = !strcmp(a, b); [L10799] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}, str={-2:0}] [L10799] RET, EXPR aws_c_string_is_valid(a) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}, str={-3:0}] [L10799] RET, EXPR aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] CALL __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] RET __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] return rval; VAL [\result=1, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11322] RET, EXPR aws_hash_callback_c_str_eq(str1, str2) [L11321-L11322] _Bool rval = aws_hash_callback_c_str_eq(str1, str2); [L11323] COND TRUE \read(rval) [L11324] size_t len = strlen(str1); [L11325] CALL assert_bytes_match(str1, str2, len) [L7113] CALL __VERIFIER_assert(!a == !b) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7113] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7114-L7117] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7119] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L7119] RET, EXPR nondet_uint64_t() VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, nondet_uint64_t()=18482772870728515581, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7119] size_t i = nondet_uint64_t(); [L7120-L7122] CALL assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7120-L7122] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, i=36028797018963965, len=36028797018963966, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, a[i]=257, b={-3:0}, b={-3:0}, b[i]=0, i=36028797018963965, len=36028797018963966, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 362 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 4255 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3740 mSDsCounter, 251 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2486 IncrementalHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 251 mSolverCounterUnsat, 515 mSDtfsCounter, 2486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 94, 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, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 597/597 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-18 00:31:24,761 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_hash_callback_c_str_eq_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 00:31:26,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 00:31:26,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 00:31:26,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 00:31:26,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 00:31:26,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 00:31:26,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 00:31:26,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 00:31:26,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 00:31:26,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 00:31:26,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 00:31:26,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 00:31:26,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 00:31:26,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 00:31:26,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 00:31:26,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 00:31:26,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 00:31:26,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 00:31:26,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 00:31:26,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 00:31:26,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 00:31:26,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 00:31:26,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 00:31:26,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 00:31:26,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 00:31:26,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 00:31:26,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 00:31:26,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 00:31:26,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 00:31:26,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 00:31:26,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 00:31:26,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 00:31:26,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 00:31:26,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 00:31:26,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 00:31:26,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 00:31:26,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 00:31:26,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 00:31:26,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 00:31:26,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 00:31:26,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 00:31:26,744 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-12-18 00:31:26,771 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 00:31:26,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 00:31:26,773 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 00:31:26,773 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 00:31:26,773 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 00:31:26,774 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 00:31:26,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 00:31:26,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 00:31:26,775 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 00:31:26,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 00:31:26,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 00:31:26,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 00:31:26,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 00:31:26,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 00:31:26,776 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 00:31:26,776 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 00:31:26,777 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 00:31:26,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 00:31:26,777 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 00:31:26,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 00:31:26,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 00:31:26,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 00:31:26,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 00:31:26,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:31:26,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 00:31:26,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 00:31:26,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 00:31:26,779 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 00:31:26,779 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 00:31:26,779 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 00:31:26,779 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 00:31:26,779 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 00:31:26,780 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 00:31:26,780 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 00:31:26,780 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 [2021-12-18 00:31:27,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 00:31:27,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 00:31:27,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 00:31:27,049 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 00:31:27,050 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 00:31:27,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-18 00:31:27,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff27a5880/3449729fcb4b43f8a4fe88dc8c75e9a4/FLAGe29ddd84b [2021-12-18 00:31:27,655 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 00:31:27,656 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-18 00:31:27,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff27a5880/3449729fcb4b43f8a4fe88dc8c75e9a4/FLAGe29ddd84b [2021-12-18 00:31:27,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff27a5880/3449729fcb4b43f8a4fe88dc8c75e9a4 [2021-12-18 00:31:27,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 00:31:27,847 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 00:31:27,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 00:31:27,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 00:31:27,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 00:31:27,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:31:27" (1/1) ... [2021-12-18 00:31:27,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a9e0278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:27, skipping insertion in model container [2021-12-18 00:31:27,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:31:27" (1/1) ... [2021-12-18 00:31:27,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 00:31:27,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 00:31:28,190 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_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-18 00:31:28,195 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_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-18 00:31:29,034 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,035 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,036 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,036 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,037 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,057 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,058 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,059 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,060 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,394 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:31:29,395 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:31:29,396 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:31:29,397 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:31:29,398 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:31:29,398 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:31:29,399 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:31:29,399 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:31:29,400 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:31:29,400 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:31:29,517 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:31:29,591 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,592 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,778 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,778 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,792 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,793 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,800 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,800 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,808 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,808 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,809 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,809 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,809 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,826 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,826 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:29,884 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:31:29,935 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-18 00:31:29,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 00:31:29,994 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_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-18 00:31:29,995 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_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-18 00:31:30,036 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,040 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,040 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,042 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,043 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,046 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,047 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,048 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,048 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,075 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:31:30,076 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:31:30,076 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:31:30,077 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:31:30,077 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:31:30,078 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:31:30,078 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:31:30,078 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:31:30,079 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:31:30,079 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:31:30,091 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:31:30,176 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,182 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,262 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,262 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,267 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,267 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,269 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,269 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,277 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,278 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,278 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,279 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,279 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,280 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,280 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,305 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:31:30,333 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 00:31:30,350 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_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-18 00:31:30,350 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_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-18 00:31:30,384 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,385 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,385 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,386 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,386 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,389 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,389 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,390 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,390 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,407 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:31:30,408 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:31:30,408 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:31:30,409 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:31:30,410 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:31:30,410 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:31:30,411 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:31:30,411 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:31:30,411 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:31:30,412 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:31:30,424 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:31:30,452 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,452 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,507 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,508 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,512 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,512 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,514 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,514 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,519 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,520 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,520 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,520 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,521 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,521 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,521 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:31:30,551 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:31:30,776 INFO L208 MainTranslator]: Completed translation [2021-12-18 00:31:30,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:30 WrapperNode [2021-12-18 00:31:30,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 00:31:30,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 00:31:30,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 00:31:30,778 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 00:31:30,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:30" (1/1) ... [2021-12-18 00:31:30,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:30" (1/1) ... [2021-12-18 00:31:30,933 INFO L137 Inliner]: procedures = 788, calls = 3253, calls flagged for inlining = 80, calls inlined = 5, statements flattened = 338 [2021-12-18 00:31:30,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 00:31:30,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 00:31:30,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 00:31:30,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 00:31:30,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:30" (1/1) ... [2021-12-18 00:31:30,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:30" (1/1) ... [2021-12-18 00:31:30,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:30" (1/1) ... [2021-12-18 00:31:30,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:30" (1/1) ... [2021-12-18 00:31:30,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:30" (1/1) ... [2021-12-18 00:31:30,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:30" (1/1) ... [2021-12-18 00:31:31,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:30" (1/1) ... [2021-12-18 00:31:31,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 00:31:31,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 00:31:31,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 00:31:31,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 00:31:31,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:30" (1/1) ... [2021-12-18 00:31:31,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:31:31,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:31:31,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 00:31:31,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 00:31:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-18 00:31:31,104 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-18 00:31:31,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-18 00:31:31,104 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-18 00:31:31,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 00:31:31,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 00:31:31,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 00:31:31,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 00:31:31,104 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-18 00:31:31,104 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-18 00:31:31,105 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-18 00:31:31,105 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-18 00:31:31,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 00:31:31,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-18 00:31:31,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-18 00:31:31,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-18 00:31:31,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 00:31:31,105 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2021-12-18 00:31:31,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2021-12-18 00:31:31,106 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2021-12-18 00:31:31,106 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2021-12-18 00:31:31,326 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 00:31:31,327 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 00:31:31,527 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2021-12-18 00:31:31,535 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 00:31:31,541 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 00:31:31,541 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-18 00:31:31,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:31:31 BoogieIcfgContainer [2021-12-18 00:31:31,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 00:31:31,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 00:31:31,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 00:31:31,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 00:31:31,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:31:27" (1/3) ... [2021-12-18 00:31:31,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6b2399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:31:31, skipping insertion in model container [2021-12-18 00:31:31,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:31:30" (2/3) ... [2021-12-18 00:31:31,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6b2399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:31:31, skipping insertion in model container [2021-12-18 00:31:31,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:31:31" (3/3) ... [2021-12-18 00:31:31,549 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2021-12-18 00:31:31,557 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 00:31:31,557 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 00:31:31,645 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 00:31:31,663 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 00:31:31,663 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 00:31:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-18 00:31:31,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-18 00:31:31,680 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:31,681 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2021-12-18 00:31:31,682 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2021-12-18 00:31:31,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 00:31:31,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929337550] [2021-12-18 00:31:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:31,699 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 00:31:31,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 00:31:31,710 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 00:31:31,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-18 00:31:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:31,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-18 00:31:31,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:31:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-18 00:31:32,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:31:32,083 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 00:31:32,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929337550] [2021-12-18 00:31:32,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929337550] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:31:32,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:31:32,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 00:31:32,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390936728] [2021-12-18 00:31:32,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:31:32,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-18 00:31:32,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 00:31:32,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-18 00:31:32,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 00:31:32,108 INFO L87 Difference]: Start difference. First operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-18 00:31:32,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:31:32,125 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2021-12-18 00:31:32,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 00:31:32,126 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 67 [2021-12-18 00:31:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:31:32,131 INFO L225 Difference]: With dead ends: 139 [2021-12-18 00:31:32,131 INFO L226 Difference]: Without dead ends: 65 [2021-12-18 00:31:32,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 00:31:32,135 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:31:32,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:31:32,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-18 00:31:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-18 00:31:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-18 00:31:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2021-12-18 00:31:32,171 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2021-12-18 00:31:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:31:32,172 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2021-12-18 00:31:32,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-18 00:31:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2021-12-18 00:31:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-18 00:31:32,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:32,178 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:31:32,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-18 00:31:32,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 00:31:32,392 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:32,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:32,394 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2021-12-18 00:31:32,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 00:31:32,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114104025] [2021-12-18 00:31:32,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:32,398 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 00:31:32,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 00:31:32,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 00:31:32,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-18 00:31:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:32,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-18 00:31:32,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:31:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-18 00:31:32,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:31:32,803 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 00:31:32,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114104025] [2021-12-18 00:31:32,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114104025] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:31:32,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:31:32,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 00:31:32,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132497244] [2021-12-18 00:31:32,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:31:32,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 00:31:32,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 00:31:32,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 00:31:32,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-18 00:31:32,806 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-18 00:31:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:31:32,992 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2021-12-18 00:31:32,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 00:31:32,993 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 70 [2021-12-18 00:31:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:31:32,994 INFO L225 Difference]: With dead ends: 89 [2021-12-18 00:31:32,994 INFO L226 Difference]: Without dead ends: 65 [2021-12-18 00:31:32,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-12-18 00:31:32,995 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:31:32,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 663 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:31:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-18 00:31:33,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-18 00:31:33,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-18 00:31:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2021-12-18 00:31:33,010 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2021-12-18 00:31:33,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:31:33,010 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2021-12-18 00:31:33,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-18 00:31:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2021-12-18 00:31:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-18 00:31:33,011 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:33,012 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:31:33,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-18 00:31:33,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 00:31:33,223 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:33,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2021-12-18 00:31:33,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 00:31:33,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024280311] [2021-12-18 00:31:33,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:33,226 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 00:31:33,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 00:31:33,240 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 00:31:33,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-18 00:31:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:33,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-18 00:31:33,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:31:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-18 00:31:33,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:31:33,651 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 00:31:33,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024280311] [2021-12-18 00:31:33,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024280311] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:31:33,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:31:33,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-18 00:31:33,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170755108] [2021-12-18 00:31:33,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:31:33,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 00:31:33,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 00:31:33,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 00:31:33,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:31:33,653 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-18 00:31:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:31:33,969 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2021-12-18 00:31:33,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 00:31:33,969 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2021-12-18 00:31:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:31:33,971 INFO L225 Difference]: With dead ends: 94 [2021-12-18 00:31:33,971 INFO L226 Difference]: Without dead ends: 92 [2021-12-18 00:31:33,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-12-18 00:31:33,973 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 38 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:31:33,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 914 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:31:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-18 00:31:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2021-12-18 00:31:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-18 00:31:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2021-12-18 00:31:33,984 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2021-12-18 00:31:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:31:33,984 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2021-12-18 00:31:33,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-18 00:31:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2021-12-18 00:31:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-18 00:31:33,986 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:33,987 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2021-12-18 00:31:34,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-18 00:31:34,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 00:31:34,203 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:34,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2021-12-18 00:31:34,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 00:31:34,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151406423] [2021-12-18 00:31:34,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:34,205 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 00:31:34,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 00:31:34,206 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 00:31:34,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-18 00:31:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:34,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-18 00:31:34,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:31:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-18 00:31:34,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:31:34,684 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 00:31:34,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151406423] [2021-12-18 00:31:34,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151406423] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:31:34,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:31:34,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-18 00:31:34,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873302202] [2021-12-18 00:31:34,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:31:34,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 00:31:34,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 00:31:34,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 00:31:34,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-18 00:31:34,686 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-18 00:31:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:31:34,898 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2021-12-18 00:31:34,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 00:31:34,899 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 83 [2021-12-18 00:31:34,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:31:34,900 INFO L225 Difference]: With dead ends: 98 [2021-12-18 00:31:34,900 INFO L226 Difference]: Without dead ends: 96 [2021-12-18 00:31:34,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-12-18 00:31:34,900 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:31:34,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 854 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:31:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-18 00:31:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-12-18 00:31:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 55 states have internal predecessors, (55), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-18 00:31:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2021-12-18 00:31:34,909 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2021-12-18 00:31:34,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:31:34,909 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2021-12-18 00:31:34,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-18 00:31:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2021-12-18 00:31:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-18 00:31:34,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:34,911 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:31:34,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-18 00:31:35,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 00:31:35,143 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:35,144 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2021-12-18 00:31:35,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 00:31:35,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721755952] [2021-12-18 00:31:35,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:35,145 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 00:31:35,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 00:31:35,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 00:31:35,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-18 00:31:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:35,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-18 00:31:35,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:31:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-12-18 00:31:35,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:31:35,570 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 00:31:35,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721755952] [2021-12-18 00:31:35,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721755952] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:31:35,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:31:35,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-18 00:31:35,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792957525] [2021-12-18 00:31:35,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:31:35,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 00:31:35,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 00:31:35,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 00:31:35,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-12-18 00:31:35,572 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-18 00:31:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:31:35,776 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2021-12-18 00:31:35,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 00:31:35,776 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 107 [2021-12-18 00:31:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:31:35,777 INFO L225 Difference]: With dead ends: 102 [2021-12-18 00:31:35,777 INFO L226 Difference]: Without dead ends: 100 [2021-12-18 00:31:35,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-12-18 00:31:35,778 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 14 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:31:35,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1199 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:31:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-18 00:31:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-12-18 00:31:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 58 states have internal predecessors, (58), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-18 00:31:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2021-12-18 00:31:35,784 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2021-12-18 00:31:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:31:35,785 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2021-12-18 00:31:35,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-18 00:31:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2021-12-18 00:31:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-18 00:31:35,786 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:35,786 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:31:35,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-18 00:31:35,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 00:31:35,987 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:35,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:35,987 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2021-12-18 00:31:35,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 00:31:35,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292616087] [2021-12-18 00:31:35,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:35,988 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 00:31:35,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 00:31:35,991 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 00:31:35,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-18 00:31:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:36,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 00:31:36,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:31:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-18 00:31:36,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:31:36,507 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 00:31:36,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292616087] [2021-12-18 00:31:36,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292616087] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:31:36,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:31:36,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-18 00:31:36,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325032968] [2021-12-18 00:31:36,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:31:36,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 00:31:36,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 00:31:36,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 00:31:36,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-18 00:31:36,509 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-18 00:31:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:31:36,714 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2021-12-18 00:31:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 00:31:36,715 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2021-12-18 00:31:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:31:36,717 INFO L225 Difference]: With dead ends: 100 [2021-12-18 00:31:36,717 INFO L226 Difference]: Without dead ends: 96 [2021-12-18 00:31:36,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-12-18 00:31:36,718 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 26 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:31:36,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 752 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:31:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-18 00:31:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-12-18 00:31:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-18 00:31:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-12-18 00:31:36,741 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2021-12-18 00:31:36,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:31:36,741 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-12-18 00:31:36,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-18 00:31:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-12-18 00:31:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-18 00:31:36,743 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:36,743 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 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] [2021-12-18 00:31:36,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-18 00:31:36,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 00:31:36,944 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:36,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2021-12-18 00:31:36,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 00:31:36,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058980893] [2021-12-18 00:31:36,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:36,946 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 00:31:36,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 00:31:36,947 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 00:31:36,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 00:31:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:31:37,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 00:31:37,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:31:37,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 00:31:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-18 00:31:37,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:31:37,433 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 00:31:37,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058980893] [2021-12-18 00:31:37,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058980893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:31:37,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:31:37,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 00:31:37,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965758819] [2021-12-18 00:31:37,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:31:37,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 00:31:37,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 00:31:37,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 00:31:37,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:31:37,434 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-18 00:31:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:31:37,559 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2021-12-18 00:31:37,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 00:31:37,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 100 [2021-12-18 00:31:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:31:37,560 INFO L225 Difference]: With dead ends: 102 [2021-12-18 00:31:37,560 INFO L226 Difference]: Without dead ends: 71 [2021-12-18 00:31:37,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:31:37,561 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:31:37,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 547 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:31:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-18 00:31:37,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-18 00:31:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0) internal successors, (43), 43 states have internal predecessors, (43), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-18 00:31:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-18 00:31:37,566 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2021-12-18 00:31:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:31:37,566 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-18 00:31:37,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-18 00:31:37,573 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-18 00:31:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-18 00:31:37,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:31:37,592 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:31:37,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-18 00:31:37,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 00:31:37,793 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:31:37,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:31:37,794 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2021-12-18 00:31:37,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 00:31:37,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169998499] [2021-12-18 00:31:37,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:31:37,795 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 00:31:37,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 00:31:37,796 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 00:31:37,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-18 00:31:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 00:31:38,513 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 00:31:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 00:31:39,336 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-18 00:31:39,336 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 00:31:39,337 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-18 00:31:39,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-18 00:31:39,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 00:31:39,548 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:31:39,552 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 00:31:39,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:31:39 BoogieIcfgContainer [2021-12-18 00:31:39,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 00:31:39,624 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 00:31:39,624 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 00:31:39,624 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 00:31:39,624 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:31:31" (3/4) ... [2021-12-18 00:31:39,626 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-18 00:31:39,626 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 00:31:39,626 INFO L158 Benchmark]: Toolchain (without parser) took 11779.58ms. Allocated memory was 50.3MB in the beginning and 360.7MB in the end (delta: 310.4MB). Free memory was 24.9MB in the beginning and 274.5MB in the end (delta: -249.6MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2021-12-18 00:31:39,626 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 50.3MB. Free memory was 31.6MB in the beginning and 31.6MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 00:31:39,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2927.52ms. Allocated memory was 50.3MB in the beginning and 180.4MB in the end (delta: 130.0MB). Free memory was 24.7MB in the beginning and 115.5MB in the end (delta: -90.7MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. [2021-12-18 00:31:39,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 156.72ms. Allocated memory is still 180.4MB. Free memory was 115.5MB in the beginning and 105.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-18 00:31:39,627 INFO L158 Benchmark]: Boogie Preprocessor took 70.72ms. Allocated memory is still 180.4MB. Free memory was 105.0MB in the beginning and 99.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-18 00:31:39,627 INFO L158 Benchmark]: RCFGBuilder took 536.76ms. Allocated memory is still 180.4MB. Free memory was 99.7MB in the beginning and 65.1MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2021-12-18 00:31:39,627 INFO L158 Benchmark]: TraceAbstraction took 8078.97ms. Allocated memory was 180.4MB in the beginning and 360.7MB in the end (delta: 180.4MB). Free memory was 64.1MB in the beginning and 274.5MB in the end (delta: -210.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 00:31:39,627 INFO L158 Benchmark]: Witness Printer took 2.46ms. Allocated memory is still 360.7MB. Free memory is still 274.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 00:31:39,628 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.15ms. Allocated memory is still 50.3MB. Free memory was 31.6MB in the beginning and 31.6MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2927.52ms. Allocated memory was 50.3MB in the beginning and 180.4MB in the end (delta: 130.0MB). Free memory was 24.7MB in the beginning and 115.5MB in the end (delta: -90.7MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 156.72ms. Allocated memory is still 180.4MB. Free memory was 115.5MB in the beginning and 105.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.72ms. Allocated memory is still 180.4MB. Free memory was 105.0MB in the beginning and 99.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 536.76ms. Allocated memory is still 180.4MB. Free memory was 99.7MB in the beginning and 65.1MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8078.97ms. Allocated memory was 180.4MB in the beginning and 360.7MB in the end (delta: 180.4MB). Free memory was 64.1MB in the beginning and 274.5MB in the end (delta: -210.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.46ms. Allocated memory is still 360.7MB. Free memory is still 274.5MB. There was no memory consumed. 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 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of strcmp at line 10798, overapproximation of strlen at line 11324. Possible FailurePath: [L6879-L6884] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7634-L7646] static const uint8_t s_tolower_table[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 91, 92, 93, 94, 95, 96, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255}; VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11328] CALL aws_hash_callback_c_str_eq_harness() [L11318] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, size=64] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={14:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={14:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}] [L11318] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={14:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11318] const char *str1 = ensure_c_str_is_allocated(64); [L11319] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L261] return __VERIFIER_nondet_bool(); [L11319] RET, EXPR nondet_bool() VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, size=64] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={9:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={9:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}] [L11319] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={9:0}, nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={9:0}, nondet_bool()=0, nondet_bool() ? str1 : ensure_c_str_is_allocated(64)={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] const char *str2 = nondet_bool() ? str1 : ensure_c_str_is_allocated(64); [L11322] CALL, EXPR aws_hash_callback_c_str_eq(str1, str2) [L10794] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str={14:0}] [L10794] RET, EXPR aws_c_string_is_valid(a) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10794] CALL assume_abort_if_not((aws_c_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10794] RET assume_abort_if_not((aws_c_string_is_valid(a))) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str={9:0}] [L10795] RET, EXPR aws_c_string_is_valid(b) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] CALL assume_abort_if_not((aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] RET assume_abort_if_not((aws_c_string_is_valid(b))) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10797-L10798] _Bool rval = !strcmp(a, b); [L10799] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str={14:0}] [L10799] RET, EXPR aws_c_string_is_valid(a) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str={9:0}] [L10799] RET, EXPR aws_c_string_is_valid(b) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] CALL __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] RET __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] return rval; VAL [\result=1, a={14:0}, a={14:0}, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11322] RET, EXPR aws_hash_callback_c_str_eq(str1, str2) [L11321-L11322] _Bool rval = aws_hash_callback_c_str_eq(str1, str2); [L11323] COND TRUE \read(rval) [L11324] size_t len = strlen(str1); [L11325] CALL assert_bytes_match(str1, str2, len) [L7113] CALL __VERIFIER_assert(!a == !b) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7113] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7114-L7117] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7119] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L7119] RET, EXPR nondet_uint64_t() VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, len=1073741824, nondet_uint64_t()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7119] size_t i = nondet_uint64_t(); [L7120-L7122] CALL assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7120-L7122] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, i=0, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=1073741824, a={14:0}, a={14:0}, a[i]=48, b={9:0}, b={9:0}, b[i]=-128, i=0, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 5015 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4468 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 958 IncrementalHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 547 mSDtfsCounter, 958 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 636 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 81, 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, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1351 SizeOfPredicates, 55 NumberOfNonLiveVariables, 3221 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 597/597 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-18 00:31:39,670 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: UNKNOWN: Overapproximated counterexample