./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 e19ca921 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-dev-e19ca92 [2021-12-22 13:58:46,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 13:58:46,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 13:58:46,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 13:58:46,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 13:58:46,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 13:58:46,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 13:58:46,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 13:58:46,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 13:58:46,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 13:58:46,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 13:58:46,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 13:58:46,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 13:58:46,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 13:58:46,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 13:58:46,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 13:58:46,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 13:58:46,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 13:58:46,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 13:58:46,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 13:58:46,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 13:58:46,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 13:58:46,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 13:58:46,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 13:58:46,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 13:58:46,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 13:58:46,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 13:58:46,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 13:58:46,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 13:58:46,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 13:58:46,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 13:58:46,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 13:58:46,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 13:58:46,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 13:58:46,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 13:58:46,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 13:58:46,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 13:58:46,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 13:58:46,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 13:58:46,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 13:58:46,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 13:58:46,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-22 13:58:46,812 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 13:58:46,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 13:58:46,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 13:58:46,815 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 13:58:46,816 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 13:58:46,816 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 13:58:46,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 13:58:46,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 13:58:46,817 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 13:58:46,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 13:58:46,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 13:58:46,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 13:58:46,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 13:58:46,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 13:58:46,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 13:58:46,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 13:58:46,819 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 13:58:46,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 13:58:46,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 13:58:46,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 13:58:46,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 13:58:46,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:58:46,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 13:58:46,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 13:58:46,820 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 13:58:46,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 13:58:46,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 13:58:46,821 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 13:58:46,821 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 13:58:46,821 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 13:58:46,821 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 13:58:46,821 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-22 13:58:47,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 13:58:47,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 13:58:47,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 13:58:47,058 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 13:58:47,058 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 13:58:47,059 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-22 13:58:47,114 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f7352f1/a30533622a3e4bff920824ddf21efedb/FLAG3a1ea7085 [2021-12-22 13:58:47,823 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 13:58:47,824 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-22 13:58:47,867 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f7352f1/a30533622a3e4bff920824ddf21efedb/FLAG3a1ea7085 [2021-12-22 13:58:48,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f7352f1/a30533622a3e4bff920824ddf21efedb [2021-12-22 13:58:48,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 13:58:48,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 13:58:48,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 13:58:48,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 13:58:48,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 13:58:48,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:58:48" (1/1) ... [2021-12-22 13:58:48,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a7759bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:58:48, skipping insertion in model container [2021-12-22 13:58:48,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:58:48" (1/1) ... [2021-12-22 13:58:48,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 13:58:48,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 13:58:48,764 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-22 13:58:48,773 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-22 13:58:49,669 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:49,670 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:49,670 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:49,671 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:49,672 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:49,683 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:49,684 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:49,685 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:49,686 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:49,981 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-22 13:58:49,983 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-22 13:58:49,984 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-22 13:58:49,985 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-22 13:58:49,986 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-22 13:58:49,987 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-22 13:58:49,987 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-22 13:58:50,024 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-22 13:58:50,025 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-22 13:58:50,025 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-22 13:58:50,265 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-22 13:58:50,342 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,342 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,600 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,601 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,633 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,634 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,643 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,644 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,661 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,663 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,664 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,664 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,665 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,665 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,696 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,750 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:58:50,795 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 13:58:50,819 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-22 13:58:50,820 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-22 13:58:50,860 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,861 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,863 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,864 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,864 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,870 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,871 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,872 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,872 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,900 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-22 13:58:50,901 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-22 13:58:50,901 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-22 13:58:50,902 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-22 13:58:50,903 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-22 13:58:50,903 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-22 13:58:50,903 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-22 13:58:50,904 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-22 13:58:50,904 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-22 13:58:50,904 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-22 13:58:50,920 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-22 13:58:50,990 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:50,992 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:51,074 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:51,075 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:51,082 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:51,083 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:51,087 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:51,087 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:51,094 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:51,094 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:51,095 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:51,095 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:51,096 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:51,096 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:51,096 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:58:51,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:58:51,345 INFO L208 MainTranslator]: Completed translation [2021-12-22 13:58:51,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:58:51 WrapperNode [2021-12-22 13:58:51,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 13:58:51,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 13:58:51,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 13:58:51,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 13:58:51,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:58:51" (1/1) ... [2021-12-22 13:58:51,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:58:51" (1/1) ... [2021-12-22 13:58:51,556 INFO L137 Inliner]: procedures = 768, calls = 3253, calls flagged for inlining = 78, calls inlined = 5, statements flattened = 337 [2021-12-22 13:58:51,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 13:58:51,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 13:58:51,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 13:58:51,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 13:58:51,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:58:51" (1/1) ... [2021-12-22 13:58:51,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:58:51" (1/1) ... [2021-12-22 13:58:51,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:58:51" (1/1) ... [2021-12-22 13:58:51,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:58:51" (1/1) ... [2021-12-22 13:58:51,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:58:51" (1/1) ... [2021-12-22 13:58:51,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:58:51" (1/1) ... [2021-12-22 13:58:51,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:58:51" (1/1) ... [2021-12-22 13:58:51,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 13:58:51,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 13:58:51,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 13:58:51,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 13:58:51,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:58:51" (1/1) ... [2021-12-22 13:58:51,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:58:51,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:58:51,677 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-22 13:58:51,689 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-22 13:58:51,716 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-22 13:58:51,717 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-22 13:58:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 13:58:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-22 13:58:51,718 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-22 13:58:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 13:58:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 13:58:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 13:58:51,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 13:58:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-22 13:58:51,719 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-22 13:58:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-22 13:58:51,720 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-22 13:58:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-22 13:58:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-22 13:58:51,720 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-22 13:58:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2021-12-22 13:58:51,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2021-12-22 13:58:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2021-12-22 13:58:51,721 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2021-12-22 13:58:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 13:58:51,994 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 13:58:51,996 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 13:58:52,239 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2021-12-22 13:58:52,249 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 13:58:52,255 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 13:58:52,255 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-22 13:58:52,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:58:52 BoogieIcfgContainer [2021-12-22 13:58:52,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 13:58:52,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 13:58:52,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 13:58:52,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 13:58:52,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:58:48" (1/3) ... [2021-12-22 13:58:52,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1990c0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:58:52, skipping insertion in model container [2021-12-22 13:58:52,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:58:51" (2/3) ... [2021-12-22 13:58:52,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1990c0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:58:52, skipping insertion in model container [2021-12-22 13:58:52,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:58:52" (3/3) ... [2021-12-22 13:58:52,265 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2021-12-22 13:58:52,270 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 13:58:52,270 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-22 13:58:52,310 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 13:58:52,316 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-22 13:58:52,316 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-22 13:58:52,331 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-22 13:58:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-22 13:58:52,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:58:52,339 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-22 13:58:52,339 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:58:52,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:58:52,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2021-12-22 13:58:52,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:58:52,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19990140] [2021-12-22 13:58:52,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:58:52,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:58:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:58:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:52,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:52,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 13:58:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:52,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:58:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:52,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:52,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 13:58:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:52,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:58:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:52,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 13:58:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:52,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-22 13:58:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:52,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-22 13:58:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:52,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-22 13:58:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:52,996 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-22 13:58:52,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:58:52,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19990140] [2021-12-22 13:58:52,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19990140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:58:52,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:58:52,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 13:58:53,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743610443] [2021-12-22 13:58:53,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:58:53,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:58:53,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:58:53,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:58:53,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 13:58:53,040 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-22 13:58:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:58:53,165 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2021-12-22 13:58:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:58:53,168 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-22 13:58:53,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:58:53,175 INFO L225 Difference]: With dead ends: 139 [2021-12-22 13:58:53,175 INFO L226 Difference]: Without dead ends: 65 [2021-12-22 13:58:53,179 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-22 13:58:53,182 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-22 13:58:53,183 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-22 13:58:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-22 13:58:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-22 13:58:53,215 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-22 13:58:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2021-12-22 13:58:53,219 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2021-12-22 13:58:53,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:58:53,220 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2021-12-22 13:58:53,220 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-22 13:58:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2021-12-22 13:58:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-22 13:58:53,223 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:58:53,223 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-22 13:58:53,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 13:58:53,224 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:58:53,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:58:53,225 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2021-12-22 13:58:53,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:58:53,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537695655] [2021-12-22 13:58:53,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:58:53,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:58:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:53,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:58:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:53,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:53,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 13:58:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:53,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:58:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:53,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:53,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 13:58:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:53,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:58:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:53,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 13:58:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:53,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-22 13:58:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:53,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-22 13:58:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:53,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-22 13:58:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:53,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:58:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:53,772 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-22 13:58:53,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:58:53,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537695655] [2021-12-22 13:58:53,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537695655] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:58:53,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:58:53,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-22 13:58:53,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534759008] [2021-12-22 13:58:53,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:58:53,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 13:58:53,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:58:53,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 13:58:53,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-22 13:58:53,777 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-22 13:58:54,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:58:54,127 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2021-12-22 13:58:54,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 13:58:54,127 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-22 13:58:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:58:54,129 INFO L225 Difference]: With dead ends: 89 [2021-12-22 13:58:54,129 INFO L226 Difference]: Without dead ends: 65 [2021-12-22 13:58:54,130 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-22 13:58:54,131 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-22 13:58:54,131 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-22 13:58:54,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-22 13:58:54,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-22 13:58:54,140 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-22 13:58:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2021-12-22 13:58:54,142 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2021-12-22 13:58:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:58:54,143 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2021-12-22 13:58:54,143 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-22 13:58:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2021-12-22 13:58:54,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-22 13:58:54,144 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:58:54,144 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-22 13:58:54,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 13:58:54,145 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:58:54,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:58:54,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2021-12-22 13:58:54,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:58:54,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612633227] [2021-12-22 13:58:54,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:58:54,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:58:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:54,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:58:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:54,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:54,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 13:58:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:54,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:58:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:54,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:54,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 13:58:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:54,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:58:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:54,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 13:58:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:54,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-22 13:58:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:54,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-22 13:58:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:54,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-22 13:58:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:54,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:58:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:54,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-22 13:58:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:54,613 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-22 13:58:54,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:58:54,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612633227] [2021-12-22 13:58:54,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612633227] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:58:54,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:58:54,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-22 13:58:54,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654737213] [2021-12-22 13:58:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:58:54,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-22 13:58:54,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:58:54,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-22 13:58:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2021-12-22 13:58:54,617 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-22 13:58:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:58:55,104 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2021-12-22 13:58:55,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-22 13:58:55,104 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-22 13:58:55,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:58:55,106 INFO L225 Difference]: With dead ends: 94 [2021-12-22 13:58:55,106 INFO L226 Difference]: Without dead ends: 92 [2021-12-22 13:58:55,107 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-22 13:58:55,108 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 58 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-22 13:58:55,108 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-22 13:58:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-22 13:58:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2021-12-22 13:58:55,120 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-22 13:58:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2021-12-22 13:58:55,121 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2021-12-22 13:58:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:58:55,122 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2021-12-22 13:58:55,122 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-22 13:58:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2021-12-22 13:58:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-22 13:58:55,124 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:58:55,124 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-22 13:58:55,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 13:58:55,125 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:58:55,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:58:55,126 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2021-12-22 13:58:55,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:58:55,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983125343] [2021-12-22 13:58:55,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:58:55,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:58:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:58:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 13:58:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:58:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 13:58:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:58:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 13:58:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-22 13:58:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-22 13:58:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-22 13:58:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:58:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-22 13:58:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-22 13:58:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:55,605 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-22 13:58:55,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:58:55,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983125343] [2021-12-22 13:58:55,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983125343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:58:55,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:58:55,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 13:58:55,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795112052] [2021-12-22 13:58:55,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:58:55,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 13:58:55,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:58:55,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 13:58:55,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-22 13:58:55,609 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-22 13:58:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:58:55,999 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2021-12-22 13:58:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 13:58:55,999 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-22 13:58:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:58:56,001 INFO L225 Difference]: With dead ends: 98 [2021-12-22 13:58:56,001 INFO L226 Difference]: Without dead ends: 96 [2021-12-22 13:58:56,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-12-22 13:58:56,002 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 13:58:56,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 631 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 13:58:56,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-22 13:58:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-12-22 13:58:56,015 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-22 13:58:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2021-12-22 13:58:56,019 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2021-12-22 13:58:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:58:56,020 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2021-12-22 13:58:56,020 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-22 13:58:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2021-12-22 13:58:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-22 13:58:56,026 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:58:56,027 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-22 13:58:56,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 13:58:56,027 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:58:56,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:58:56,028 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2021-12-22 13:58:56,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:58:56,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923266798] [2021-12-22 13:58:56,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:58:56,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:58:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:58:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 13:58:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:58:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 13:58:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:58:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:58:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 13:58:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:58:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 13:58:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-22 13:58:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-22 13:58:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-22 13:58:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-22 13:58:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-22 13:58:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 13:58:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:56,573 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-22 13:58:56,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:58:56,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923266798] [2021-12-22 13:58:56,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923266798] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:58:56,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:58:56,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-22 13:58:56,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988196596] [2021-12-22 13:58:56,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:58:56,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-22 13:58:56,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:58:56,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-22 13:58:56,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-12-22 13:58:56,575 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-22 13:58:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:58:56,965 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2021-12-22 13:58:56,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:58:56,966 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-22 13:58:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:58:56,967 INFO L225 Difference]: With dead ends: 102 [2021-12-22 13:58:56,967 INFO L226 Difference]: Without dead ends: 100 [2021-12-22 13:58:56,968 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-22 13:58:56,968 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.3s IncrementalHoareTripleChecker+Time [2021-12-22 13:58:56,969 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.3s Time] [2021-12-22 13:58:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-22 13:58:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-12-22 13:58:56,978 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-22 13:58:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2021-12-22 13:58:56,979 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2021-12-22 13:58:56,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:58:56,979 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2021-12-22 13:58:56,980 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-22 13:58:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2021-12-22 13:58:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-22 13:58:56,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:58:56,981 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-22 13:58:56,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 13:58:56,982 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:58:56,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:58:56,983 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2021-12-22 13:58:56,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:58:56,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109418113] [2021-12-22 13:58:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:58:56,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:58:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:58:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 13:58:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:58:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 13:58:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:58:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:58:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 13:58:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:58:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 13:58:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-22 13:58:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-22 13:58:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-22 13:58:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-22 13:58:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-22 13:58:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 13:58:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-22 13:58:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:57,599 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-22 13:58:57,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:58:57,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109418113] [2021-12-22 13:58:57,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109418113] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:58:57,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:58:57,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-22 13:58:57,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481366110] [2021-12-22 13:58:57,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:58:57,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-22 13:58:57,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:58:57,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-22 13:58:57,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-12-22 13:58:57,602 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-22 13:58:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:58:57,906 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2021-12-22 13:58:57,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:58:57,906 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-22 13:58:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:58:57,909 INFO L225 Difference]: With dead ends: 100 [2021-12-22 13:58:57,909 INFO L226 Difference]: Without dead ends: 96 [2021-12-22 13:58:57,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-12-22 13:58:57,910 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 45 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:58:57,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 504 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 13:58:57,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-22 13:58:57,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-12-22 13:58:57,919 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-22 13:58:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-12-22 13:58:57,921 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2021-12-22 13:58:57,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:58:57,922 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-12-22 13:58:57,922 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-22 13:58:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-12-22 13:58:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-22 13:58:57,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:58:57,927 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-22 13:58:57,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 13:58:57,927 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:58:57,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:58:57,928 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2021-12-22 13:58:57,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:58:57,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997151154] [2021-12-22 13:58:57,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:58:57,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:58:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:58:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 13:58:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:58:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:58:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 13:58:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:58:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 13:58:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-22 13:58:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-22 13:58:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-22 13:58:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:58:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-22 13:58:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-22 13:58:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 13:58:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 13:58:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-22 13:58:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:58:58,585 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-22 13:58:58,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:58:58,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997151154] [2021-12-22 13:58:58,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997151154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:58:58,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:58:58,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-22 13:58:58,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662878967] [2021-12-22 13:58:58,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:58:58,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-22 13:58:58,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:58:58,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-22 13:58:58,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-12-22 13:58:58,588 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-22 13:58:58,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:58:58,933 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2021-12-22 13:58:58,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 13:58:58,934 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-22 13:58:58,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:58:58,935 INFO L225 Difference]: With dead ends: 102 [2021-12-22 13:58:58,935 INFO L226 Difference]: Without dead ends: 71 [2021-12-22 13:58:58,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-12-22 13:58:58,936 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 55 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 13:58:58,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 695 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 13:58:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-22 13:58:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-22 13:58:58,942 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-22 13:58:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-22 13:58:58,942 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2021-12-22 13:58:58,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:58:58,943 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-22 13:58:58,943 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-22 13:58:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-22 13:58:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-22 13:58:58,944 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:58:58,944 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-22 13:58:58,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 13:58:58,945 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:58:58,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:58:58,945 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2021-12-22 13:58:58,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:58:58,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021964700] [2021-12-22 13:58:58,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:58:58,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:58:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:58:59,148 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 13:58:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:58:59,401 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 13:58:59,401 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 13:58:59,402 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-22 13:58:59,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 13:58:59,406 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:58:59,409 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 13:58:59,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 01:58:59 BoogieIcfgContainer [2021-12-22 13:58:59,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 13:58:59,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 13:58:59,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 13:58:59,471 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 13:58:59,471 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:58:52" (3/4) ... [2021-12-22 13:58:59,474 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-22 13:58:59,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 13:58:59,474 INFO L158 Benchmark]: Toolchain (without parser) took 11095.25ms. Allocated memory was 96.5MB in the beginning and 276.8MB in the end (delta: 180.4MB). Free memory was 53.9MB in the beginning and 91.4MB in the end (delta: -37.5MB). Peak memory consumption was 142.8MB. Max. memory is 16.1GB. [2021-12-22 13:58:59,475 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory was 55.5MB in the beginning and 55.5MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 13:58:59,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2965.04ms. Allocated memory was 96.5MB in the beginning and 155.2MB in the end (delta: 58.7MB). Free memory was 53.7MB in the beginning and 74.8MB in the end (delta: -21.1MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2021-12-22 13:58:59,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 210.37ms. Allocated memory is still 155.2MB. Free memory was 74.8MB in the beginning and 64.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 13:58:59,475 INFO L158 Benchmark]: Boogie Preprocessor took 87.03ms. Allocated memory is still 155.2MB. Free memory was 64.3MB in the beginning and 59.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-22 13:58:59,476 INFO L158 Benchmark]: RCFGBuilder took 612.46ms. Allocated memory is still 155.2MB. Free memory was 59.3MB in the beginning and 70.3MB in the end (delta: -11.0MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2021-12-22 13:58:59,476 INFO L158 Benchmark]: TraceAbstraction took 7211.35ms. Allocated memory was 155.2MB in the beginning and 276.8MB in the end (delta: 121.6MB). Free memory was 70.3MB in the beginning and 91.4MB in the end (delta: -21.1MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2021-12-22 13:58:59,476 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 276.8MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 13:58:59,478 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.19ms. Allocated memory is still 96.5MB. Free memory was 55.5MB in the beginning and 55.5MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2965.04ms. Allocated memory was 96.5MB in the beginning and 155.2MB in the end (delta: 58.7MB). Free memory was 53.7MB in the beginning and 74.8MB in the end (delta: -21.1MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 210.37ms. Allocated memory is still 155.2MB. Free memory was 74.8MB in the beginning and 64.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.03ms. Allocated memory is still 155.2MB. Free memory was 64.3MB in the beginning and 59.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 612.46ms. Allocated memory is still 155.2MB. Free memory was 59.3MB in the beginning and 70.3MB in the end (delta: -11.0MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7211.35ms. Allocated memory was 155.2MB in the beginning and 276.8MB in the end (delta: 121.6MB). Free memory was 70.3MB in the beginning and 91.4MB in the end (delta: -21.1MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 276.8MB. Free memory is still 91.4MB. 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()=-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)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=258, 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)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=258, 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)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=258, nondet_uint64_t()=18446744073709551873, 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)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, i=257, len=258, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=258, a={-2:0}, a={-2:0}, a[i]=-255, b={-3:0}, b={-3:0}, b[i]=0, i=257, len=258, 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.1s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 4167 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3652 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2413 IncrementalHoareTripleChecker+Invalid, 2672 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 515 mSDtfsCounter, 2413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 95, 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, 0.8s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1728 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-22 13:58:59,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-dev-e19ca92 [2021-12-22 13:59:01,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 13:59:01,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 13:59:01,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 13:59:01,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 13:59:01,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 13:59:01,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 13:59:01,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 13:59:01,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 13:59:01,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 13:59:01,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 13:59:01,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 13:59:01,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 13:59:01,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 13:59:01,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 13:59:01,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 13:59:01,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 13:59:01,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 13:59:01,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 13:59:01,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 13:59:01,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 13:59:01,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 13:59:01,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 13:59:01,504 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 13:59:01,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 13:59:01,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 13:59:01,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 13:59:01,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 13:59:01,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 13:59:01,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 13:59:01,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 13:59:01,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 13:59:01,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 13:59:01,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 13:59:01,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 13:59:01,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 13:59:01,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 13:59:01,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 13:59:01,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 13:59:01,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 13:59:01,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 13:59:01,519 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-12-22 13:59:01,552 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 13:59:01,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 13:59:01,553 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 13:59:01,554 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 13:59:01,554 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 13:59:01,555 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 13:59:01,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 13:59:01,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 13:59:01,556 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 13:59:01,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 13:59:01,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 13:59:01,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 13:59:01,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 13:59:01,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 13:59:01,558 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 13:59:01,558 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-22 13:59:01,558 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-22 13:59:01,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 13:59:01,559 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 13:59:01,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 13:59:01,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 13:59:01,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 13:59:01,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 13:59:01,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:59:01,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 13:59:01,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 13:59:01,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 13:59:01,568 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-22 13:59:01,568 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-22 13:59:01,568 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 13:59:01,569 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 13:59:01,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 13:59:01,569 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 13:59:01,569 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-22 13:59:01,569 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-22 13:59:01,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 13:59:01,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 13:59:01,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 13:59:01,905 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 13:59:01,905 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 13:59:01,907 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-22 13:59:01,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e775278c9/64e0230cd3414b3da7d6c61299144b20/FLAG9af380694 [2021-12-22 13:59:02,727 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 13:59:02,728 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-22 13:59:02,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e775278c9/64e0230cd3414b3da7d6c61299144b20/FLAG9af380694 [2021-12-22 13:59:02,823 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e775278c9/64e0230cd3414b3da7d6c61299144b20 [2021-12-22 13:59:02,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 13:59:02,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 13:59:02,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 13:59:02,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 13:59:02,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 13:59:02,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:59:02" (1/1) ... [2021-12-22 13:59:02,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b2cd91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:59:02, skipping insertion in model container [2021-12-22 13:59:02,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:59:02" (1/1) ... [2021-12-22 13:59:02,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 13:59:02,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 13:59:03,286 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-22 13:59:03,294 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-22 13:59:04,245 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:04,247 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:04,247 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:04,248 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:04,249 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:04,260 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:04,261 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:04,262 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:04,263 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:04,561 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-22 13:59:04,562 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-22 13:59:04,563 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-22 13:59:04,564 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-22 13:59:04,565 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-22 13:59:04,565 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-22 13:59:04,566 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-22 13:59:04,566 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-22 13:59:04,567 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-22 13:59:04,567 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-22 13:59:04,706 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-22 13:59:04,834 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:04,844 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,088 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,089 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,109 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,110 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,117 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,118 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,133 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,136 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,136 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,137 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,137 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,137 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,138 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:59:05,248 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-22 13:59:05,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 13:59:05,320 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-22 13:59:05,320 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-22 13:59:05,367 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,367 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,367 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,370 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,380 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,386 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,387 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,387 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,388 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,419 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-22 13:59:05,419 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-22 13:59:05,420 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-22 13:59:05,420 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-22 13:59:05,421 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-22 13:59:05,421 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-22 13:59:05,422 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-22 13:59:05,422 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-22 13:59:05,422 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-22 13:59:05,423 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-22 13:59:05,437 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-22 13:59:05,485 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,487 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,547 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,548 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,552 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,553 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,564 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,565 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,571 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,572 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,573 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,573 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,573 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,574 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,575 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,607 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:59:05,646 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 13:59:05,666 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-22 13:59:05,667 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-22 13:59:05,703 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,703 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,704 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,704 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,705 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,708 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,709 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,710 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,711 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,754 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-22 13:59:05,755 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-22 13:59:05,763 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-22 13:59:05,763 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-22 13:59:05,765 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-22 13:59:05,777 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-22 13:59:05,778 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-22 13:59:05,778 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-22 13:59:05,778 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-22 13:59:05,779 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-22 13:59:05,793 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-22 13:59:05,825 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,826 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,886 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,887 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,892 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,892 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,894 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,894 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,901 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,901 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,902 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,902 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,903 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,903 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,903 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:59:05,926 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:59:06,184 INFO L208 MainTranslator]: Completed translation [2021-12-22 13:59:06,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:59:06 WrapperNode [2021-12-22 13:59:06,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 13:59:06,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 13:59:06,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 13:59:06,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 13:59:06,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:59:06" (1/1) ... [2021-12-22 13:59:06,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:59:06" (1/1) ... [2021-12-22 13:59:06,376 INFO L137 Inliner]: procedures = 788, calls = 3253, calls flagged for inlining = 80, calls inlined = 5, statements flattened = 338 [2021-12-22 13:59:06,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 13:59:06,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 13:59:06,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 13:59:06,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 13:59:06,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:59:06" (1/1) ... [2021-12-22 13:59:06,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:59:06" (1/1) ... [2021-12-22 13:59:06,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:59:06" (1/1) ... [2021-12-22 13:59:06,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:59:06" (1/1) ... [2021-12-22 13:59:06,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:59:06" (1/1) ... [2021-12-22 13:59:06,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:59:06" (1/1) ... [2021-12-22 13:59:06,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:59:06" (1/1) ... [2021-12-22 13:59:06,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 13:59:06,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 13:59:06,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 13:59:06,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 13:59:06,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:59:06" (1/1) ... [2021-12-22 13:59:06,440 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:59:06,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:59:06,460 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-22 13:59:06,486 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-22 13:59:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-22 13:59:06,498 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-22 13:59:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-22 13:59:06,500 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-22 13:59:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 13:59:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 13:59:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 13:59:06,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 13:59:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-22 13:59:06,503 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-22 13:59:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-22 13:59:06,503 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-22 13:59:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-22 13:59:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-22 13:59:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-22 13:59:06,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-22 13:59:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-22 13:59:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2021-12-22 13:59:06,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2021-12-22 13:59:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2021-12-22 13:59:06,512 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2021-12-22 13:59:06,712 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 13:59:06,713 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 13:59:07,101 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2021-12-22 13:59:07,110 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 13:59:07,116 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 13:59:07,116 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-22 13:59:07,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:59:07 BoogieIcfgContainer [2021-12-22 13:59:07,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 13:59:07,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 13:59:07,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 13:59:07,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 13:59:07,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:59:02" (1/3) ... [2021-12-22 13:59:07,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be91f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:59:07, skipping insertion in model container [2021-12-22 13:59:07,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:59:06" (2/3) ... [2021-12-22 13:59:07,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be91f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:59:07, skipping insertion in model container [2021-12-22 13:59:07,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:59:07" (3/3) ... [2021-12-22 13:59:07,124 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2021-12-22 13:59:07,128 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 13:59:07,128 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-22 13:59:07,172 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 13:59:07,178 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-22 13:59:07,178 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-22 13:59:07,192 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-22 13:59:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-22 13:59:07,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:59:07,201 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-22 13:59:07,201 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:59:07,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:59:07,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2021-12-22 13:59:07,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 13:59:07,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191334104] [2021-12-22 13:59:07,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:59:07,222 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 13:59:07,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 13:59:07,229 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-22 13:59:07,230 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-22 13:59:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:59:07,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-22 13:59:07,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:59:07,695 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-22 13:59:07,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:59:07,695 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 13:59:07,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191334104] [2021-12-22 13:59:07,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191334104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:59:07,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:59:07,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 13:59:07,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532021998] [2021-12-22 13:59:07,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:59:07,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-22 13:59:07,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 13:59:07,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-22 13:59:07,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-22 13:59:07,733 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-22 13:59:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:59:07,766 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2021-12-22 13:59:07,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-22 13:59:07,768 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-22 13:59:07,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:59:07,778 INFO L225 Difference]: With dead ends: 139 [2021-12-22 13:59:07,778 INFO L226 Difference]: Without dead ends: 65 [2021-12-22 13:59:07,781 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-22 13:59:07,784 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-22 13:59:07,785 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-22 13:59:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-22 13:59:07,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-22 13:59:07,823 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-22 13:59:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2021-12-22 13:59:07,829 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2021-12-22 13:59:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:59:07,830 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2021-12-22 13:59:07,830 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-22 13:59:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2021-12-22 13:59:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-22 13:59:07,836 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:59:07,836 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-22 13:59:07,855 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-22 13:59:08,052 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-22 13:59:08,052 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:59:08,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:59:08,053 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2021-12-22 13:59:08,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 13:59:08,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820506225] [2021-12-22 13:59:08,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:59:08,054 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 13:59:08,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 13:59:08,055 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-22 13:59:08,057 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-22 13:59:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:59:08,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-22 13:59:08,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:59:08,613 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-22 13:59:08,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:59:08,614 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 13:59:08,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820506225] [2021-12-22 13:59:08,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820506225] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:59:08,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:59:08,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-22 13:59:08,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6992228] [2021-12-22 13:59:08,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:59:08,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 13:59:08,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 13:59:08,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 13:59:08,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-22 13:59:08,617 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-22 13:59:08,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:59:08,863 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2021-12-22 13:59:08,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:59:08,864 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-22 13:59:08,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:59:08,865 INFO L225 Difference]: With dead ends: 89 [2021-12-22 13:59:08,865 INFO L226 Difference]: Without dead ends: 65 [2021-12-22 13:59:08,866 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-22 13:59:08,866 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.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:59:08,867 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.2s Time] [2021-12-22 13:59:08,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-22 13:59:08,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-22 13:59:08,877 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-22 13:59:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2021-12-22 13:59:08,880 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2021-12-22 13:59:08,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:59:08,883 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2021-12-22 13:59:08,883 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-22 13:59:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2021-12-22 13:59:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-22 13:59:08,885 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:59:08,885 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-22 13:59:08,903 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-22 13:59:09,103 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-22 13:59:09,104 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:59:09,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:59:09,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2021-12-22 13:59:09,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 13:59:09,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306202275] [2021-12-22 13:59:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:59:09,106 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 13:59:09,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 13:59:09,107 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-22 13:59:09,109 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-22 13:59:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:59:09,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-22 13:59:09,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:59:09,664 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-22 13:59:09,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:59:09,664 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 13:59:09,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306202275] [2021-12-22 13:59:09,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306202275] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:59:09,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:59:09,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-22 13:59:09,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618321242] [2021-12-22 13:59:09,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:59:09,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-22 13:59:09,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 13:59:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-22 13:59:09,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-12-22 13:59:09,668 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-22 13:59:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:59:10,078 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2021-12-22 13:59:10,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:59:10,079 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-22 13:59:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:59:10,081 INFO L225 Difference]: With dead ends: 94 [2021-12-22 13:59:10,081 INFO L226 Difference]: Without dead ends: 92 [2021-12-22 13:59:10,081 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-22 13:59:10,082 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.3s IncrementalHoareTripleChecker+Time [2021-12-22 13:59:10,082 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.3s Time] [2021-12-22 13:59:10,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-22 13:59:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2021-12-22 13:59:10,092 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-22 13:59:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2021-12-22 13:59:10,093 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2021-12-22 13:59:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:59:10,093 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2021-12-22 13:59:10,094 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-22 13:59:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2021-12-22 13:59:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-22 13:59:10,095 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:59:10,095 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-22 13:59:10,111 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-22 13:59:10,311 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-22 13:59:10,312 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:59:10,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:59:10,312 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2021-12-22 13:59:10,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 13:59:10,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831693089] [2021-12-22 13:59:10,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:59:10,313 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 13:59:10,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 13:59:10,314 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-22 13:59:10,316 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-22 13:59:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:59:10,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-22 13:59:10,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:59:10,868 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-22 13:59:10,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:59:10,869 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 13:59:10,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831693089] [2021-12-22 13:59:10,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831693089] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:59:10,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:59:10,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-22 13:59:10,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136227513] [2021-12-22 13:59:10,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:59:10,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 13:59:10,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 13:59:10,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 13:59:10,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-22 13:59:10,870 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-22 13:59:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:59:11,125 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2021-12-22 13:59:11,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 13:59:11,126 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-22 13:59:11,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:59:11,128 INFO L225 Difference]: With dead ends: 98 [2021-12-22 13:59:11,128 INFO L226 Difference]: Without dead ends: 96 [2021-12-22 13:59:11,128 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-22 13:59:11,129 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:59:11,129 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.2s Time] [2021-12-22 13:59:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-22 13:59:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-12-22 13:59:11,137 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-22 13:59:11,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2021-12-22 13:59:11,138 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2021-12-22 13:59:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:59:11,138 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2021-12-22 13:59:11,139 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-22 13:59:11,139 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2021-12-22 13:59:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-22 13:59:11,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:59:11,140 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-22 13:59:11,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-22 13:59:11,361 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-22 13:59:11,361 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:59:11,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:59:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2021-12-22 13:59:11,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 13:59:11,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826315384] [2021-12-22 13:59:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:59:11,363 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 13:59:11,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 13:59:11,364 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-22 13:59:11,366 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-22 13:59:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:59:11,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-22 13:59:11,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:59:11,892 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-22 13:59:11,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:59:11,892 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 13:59:11,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826315384] [2021-12-22 13:59:11,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826315384] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:59:11,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:59:11,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 13:59:11,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888239011] [2021-12-22 13:59:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:59:11,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 13:59:11,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 13:59:11,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 13:59:11,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-12-22 13:59:11,893 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-22 13:59:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:59:12,169 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2021-12-22 13:59:12,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 13:59:12,170 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-22 13:59:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:59:12,171 INFO L225 Difference]: With dead ends: 102 [2021-12-22 13:59:12,171 INFO L226 Difference]: Without dead ends: 100 [2021-12-22 13:59:12,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-12-22 13:59:12,172 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 14 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-22 13:59:12,172 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-22 13:59:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-22 13:59:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-12-22 13:59:12,182 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-22 13:59:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2021-12-22 13:59:12,183 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2021-12-22 13:59:12,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:59:12,183 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2021-12-22 13:59:12,183 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-22 13:59:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2021-12-22 13:59:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-22 13:59:12,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:59:12,185 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-22 13:59:12,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-22 13:59:12,404 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-22 13:59:12,404 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:59:12,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:59:12,404 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2021-12-22 13:59:12,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 13:59:12,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550503429] [2021-12-22 13:59:12,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:59:12,405 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 13:59:12,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 13:59:12,406 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-22 13:59:12,407 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-22 13:59:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:59:12,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-22 13:59:12,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:59:13,075 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-22 13:59:13,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:59:13,075 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 13:59:13,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550503429] [2021-12-22 13:59:13,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550503429] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:59:13,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:59:13,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 13:59:13,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043072513] [2021-12-22 13:59:13,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:59:13,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 13:59:13,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 13:59:13,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 13:59:13,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-22 13:59:13,077 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-22 13:59:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:59:13,355 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2021-12-22 13:59:13,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 13:59:13,355 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-22 13:59:13,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:59:13,360 INFO L225 Difference]: With dead ends: 100 [2021-12-22 13:59:13,360 INFO L226 Difference]: Without dead ends: 96 [2021-12-22 13:59:13,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-12-22 13:59:13,361 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 26 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:59:13,361 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.2s Time] [2021-12-22 13:59:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-22 13:59:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-12-22 13:59:13,368 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-22 13:59:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-12-22 13:59:13,369 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2021-12-22 13:59:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:59:13,369 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-12-22 13:59:13,369 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-22 13:59:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-12-22 13:59:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-22 13:59:13,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:59:13,370 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-22 13:59:13,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-22 13:59:13,588 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-22 13:59:13,589 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:59:13,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:59:13,589 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2021-12-22 13:59:13,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 13:59:13,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202748665] [2021-12-22 13:59:13,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:59:13,590 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 13:59:13,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 13:59:13,592 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-22 13:59:13,594 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-22 13:59:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:59:13,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-22 13:59:13,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:59:14,140 INFO L387 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-22 13:59:14,176 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-22 13:59:14,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:59:14,176 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 13:59:14,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202748665] [2021-12-22 13:59:14,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202748665] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:59:14,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:59:14,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:59:14,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002377557] [2021-12-22 13:59:14,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:59:14,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:59:14,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 13:59:14,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:59:14,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:59:14,178 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-22 13:59:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:59:14,354 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2021-12-22 13:59:14,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 13:59:14,354 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-22 13:59:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:59:14,355 INFO L225 Difference]: With dead ends: 102 [2021-12-22 13:59:14,356 INFO L226 Difference]: Without dead ends: 71 [2021-12-22 13:59:14,356 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-22 13:59:14,357 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-22 13:59:14,357 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-22 13:59:14,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-22 13:59:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-22 13:59:14,363 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-22 13:59:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-22 13:59:14,364 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2021-12-22 13:59:14,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:59:14,364 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-22 13:59:14,364 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-22 13:59:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-22 13:59:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-22 13:59:14,366 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:59:14,366 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-22 13:59:14,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-22 13:59:14,583 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-22 13:59:14,584 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:59:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:59:14,584 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2021-12-22 13:59:14,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 13:59:14,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803946431] [2021-12-22 13:59:14,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:59:14,585 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 13:59:14,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 13:59:14,586 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-22 13:59:14,587 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-22 13:59:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:59:15,142 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 13:59:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:59:15,816 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-22 13:59:15,816 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 13:59:15,817 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-22 13:59:15,846 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-22 13:59:16,039 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-22 13:59:16,042 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:59:16,045 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 13:59:16,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 01:59:16 BoogieIcfgContainer [2021-12-22 13:59:16,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 13:59:16,135 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 13:59:16,135 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 13:59:16,135 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 13:59:16,135 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:59:07" (3/4) ... [2021-12-22 13:59:16,138 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-22 13:59:16,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 13:59:16,139 INFO L158 Benchmark]: Toolchain (without parser) took 13309.93ms. Allocated memory was 58.7MB in the beginning and 257.9MB in the end (delta: 199.2MB). Free memory was 37.5MB in the beginning and 54.7MB in the end (delta: -17.2MB). Peak memory consumption was 181.8MB. Max. memory is 16.1GB. [2021-12-22 13:59:16,139 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 58.7MB. Free memory was 40.2MB in the beginning and 40.2MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 13:59:16,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3354.63ms. Allocated memory was 58.7MB in the beginning and 165.7MB in the end (delta: 107.0MB). Free memory was 37.3MB in the beginning and 104.0MB in the end (delta: -66.8MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2021-12-22 13:59:16,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 190.99ms. Allocated memory is still 165.7MB. Free memory was 104.0MB in the beginning and 93.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 13:59:16,140 INFO L158 Benchmark]: Boogie Preprocessor took 55.76ms. Allocated memory is still 165.7MB. Free memory was 93.6MB in the beginning and 88.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-22 13:59:16,140 INFO L158 Benchmark]: RCFGBuilder took 684.24ms. Allocated memory is still 165.7MB. Free memory was 88.4MB in the beginning and 99.2MB in the end (delta: -10.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2021-12-22 13:59:16,140 INFO L158 Benchmark]: TraceAbstraction took 9014.91ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 98.1MB in the beginning and 54.7MB in the end (delta: 43.4MB). Peak memory consumption was 134.7MB. Max. memory is 16.1GB. [2021-12-22 13:59:16,141 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 257.9MB. Free memory is still 54.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 13:59:16,142 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.25ms. Allocated memory is still 58.7MB. Free memory was 40.2MB in the beginning and 40.2MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3354.63ms. Allocated memory was 58.7MB in the beginning and 165.7MB in the end (delta: 107.0MB). Free memory was 37.3MB in the beginning and 104.0MB in the end (delta: -66.8MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 190.99ms. Allocated memory is still 165.7MB. Free memory was 104.0MB in the beginning and 93.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.76ms. Allocated memory is still 165.7MB. Free memory was 93.6MB in the beginning and 88.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 684.24ms. Allocated memory is still 165.7MB. Free memory was 88.4MB in the beginning and 99.2MB in the end (delta: -10.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9014.91ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 98.1MB in the beginning and 54.7MB in the end (delta: 43.4MB). Peak memory consumption was 134.7MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 257.9MB. Free memory is still 54.7MB. 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]=-80, 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: 8.9s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 5015 SdHoareTripleChecker+Invalid, 1.0s 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.9s 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.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 2.3s 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-22 13:59:16,195 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