./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 0f8a17c6 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.1-dev-0f8a17c [2021-11-16 21:01:38,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 21:01:38,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 21:01:38,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 21:01:38,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 21:01:38,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 21:01:38,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 21:01:38,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 21:01:38,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 21:01:38,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 21:01:38,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 21:01:38,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 21:01:38,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 21:01:38,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 21:01:38,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 21:01:38,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 21:01:38,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 21:01:38,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 21:01:38,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 21:01:38,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 21:01:38,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 21:01:38,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 21:01:38,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 21:01:38,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 21:01:38,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 21:01:38,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 21:01:38,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 21:01:38,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 21:01:38,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 21:01:38,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 21:01:38,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 21:01:38,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 21:01:38,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 21:01:38,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 21:01:38,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 21:01:38,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 21:01:38,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 21:01:38,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 21:01:38,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 21:01:38,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 21:01:38,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 21:01:38,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 21:01:38,765 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 21:01:38,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 21:01:38,767 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 21:01:38,767 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 21:01:38,768 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 21:01:38,768 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 21:01:38,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 21:01:38,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 21:01:38,769 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 21:01:38,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 21:01:38,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 21:01:38,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 21:01:38,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 21:01:38,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 21:01:38,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 21:01:38,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 21:01:38,770 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 21:01:38,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 21:01:38,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 21:01:38,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 21:01:38,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 21:01:38,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:01:38,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 21:01:38,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 21:01:38,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 21:01:38,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 21:01:38,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 21:01:38,772 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 21:01:38,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 21:01:38,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 21:01:38,772 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 21:01:38,772 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-11-16 21:01:38,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 21:01:38,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 21:01:38,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 21:01:38,997 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 21:01:38,998 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 21:01:38,999 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-11-16 21:01:39,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9b8e4fbb/7f9f9d3183f349cd8017318dc559fcee/FLAGde806a83e [2021-11-16 21:01:39,737 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 21:01:39,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-11-16 21:01:39,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9b8e4fbb/7f9f9d3183f349cd8017318dc559fcee/FLAGde806a83e [2021-11-16 21:01:40,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9b8e4fbb/7f9f9d3183f349cd8017318dc559fcee [2021-11-16 21:01:40,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 21:01:40,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 21:01:40,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 21:01:40,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 21:01:40,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 21:01:40,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:01:40" (1/1) ... [2021-11-16 21:01:40,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230f4697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:40, skipping insertion in model container [2021-11-16 21:01:40,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:01:40" (1/1) ... [2021-11-16 21:01:40,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 21:01:40,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 21:01:40,498 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-11-16 21:01:40,504 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-11-16 21:01:40,525 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:01:40,531 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:01:41,209 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,211 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,212 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,213 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,214 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,221 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,223 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,224 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,224 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,513 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:01:41,514 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:01:41,515 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:01:41,516 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:01:41,518 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:01:41,520 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:01:41,521 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:01:41,522 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:01:41,523 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:01:41,524 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:01:41,639 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:01:41,735 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,738 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,902 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,918 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,937 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,938 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,945 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,946 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,957 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,958 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,960 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,961 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,961 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,962 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,962 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:41,996 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:01:42,081 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 21:01:42,095 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-11-16 21:01:42,096 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-11-16 21:01:42,097 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:01:42,098 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:01:42,120 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,121 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,122 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,122 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,122 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,126 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,126 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,127 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,127 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,148 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:01:42,149 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:01:42,149 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:01:42,149 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:01:42,150 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:01:42,150 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:01:42,150 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:01:42,151 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:01:42,151 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:01:42,151 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:01:42,162 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:01:42,198 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,199 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,274 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,275 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,283 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,283 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,286 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,286 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,295 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,296 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,296 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,296 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,297 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,297 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,297 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:42,319 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:01:42,481 INFO L208 MainTranslator]: Completed translation [2021-11-16 21:01:42,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:42 WrapperNode [2021-11-16 21:01:42,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 21:01:42,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 21:01:42,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 21:01:42,483 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 21:01:42,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:42" (1/1) ... [2021-11-16 21:01:42,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:42" (1/1) ... [2021-11-16 21:01:42,631 INFO L137 Inliner]: procedures = 770, calls = 3255, calls flagged for inlining = 78, calls inlined = 5, statements flattened = 335 [2021-11-16 21:01:42,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 21:01:42,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 21:01:42,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 21:01:42,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 21:01:42,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:42" (1/1) ... [2021-11-16 21:01:42,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:42" (1/1) ... [2021-11-16 21:01:42,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:42" (1/1) ... [2021-11-16 21:01:42,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:42" (1/1) ... [2021-11-16 21:01:42,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:42" (1/1) ... [2021-11-16 21:01:42,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:42" (1/1) ... [2021-11-16 21:01:42,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:42" (1/1) ... [2021-11-16 21:01:42,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 21:01:42,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 21:01:42,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 21:01:42,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 21:01:42,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:42" (1/1) ... [2021-11-16 21:01:42,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:01:42,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:01:42,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-16 21:01:42,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-16 21:01:42,818 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 21:01:42,819 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 21:01:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 21:01:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 21:01:42,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 21:01:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 21:01:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 21:01:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 21:01:42,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 21:01:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 21:01:42,820 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 21:01:42,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 21:01:42,821 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-11-16 21:01:42,821 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-11-16 21:01:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 21:01:42,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 21:01:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 21:01:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2021-11-16 21:01:42,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2021-11-16 21:01:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2021-11-16 21:01:42,822 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2021-11-16 21:01:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 21:01:43,062 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 21:01:43,063 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 21:01:43,296 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2021-11-16 21:01:43,303 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 21:01:43,307 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 21:01:43,308 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-16 21:01:43,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:01:43 BoogieIcfgContainer [2021-11-16 21:01:43,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 21:01:43,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 21:01:43,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 21:01:43,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 21:01:43,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:01:40" (1/3) ... [2021-11-16 21:01:43,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8e42b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:01:43, skipping insertion in model container [2021-11-16 21:01:43,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:42" (2/3) ... [2021-11-16 21:01:43,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8e42b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:01:43, skipping insertion in model container [2021-11-16 21:01:43,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:01:43" (3/3) ... [2021-11-16 21:01:43,315 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2021-11-16 21:01:43,319 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 21:01:43,319 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 21:01:43,349 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 21:01:43,354 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 21:01:43,354 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 21:01:43,366 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-11-16 21:01:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-16 21:01:43,371 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:01:43,372 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-11-16 21:01:43,372 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:01:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:01:43,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2021-11-16 21:01:43,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:01:43,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331995125] [2021-11-16 21:01:43,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:01:43,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:01:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:43,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:01:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:43,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:43,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:01:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:43,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 21:01:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:43,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:43,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:01:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:43,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 21:01:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:43,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 21:01:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:43,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 21:01:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:43,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 21:01:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:43,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-16 21:01:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-11-16 21:01:43,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:01:43,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331995125] [2021-11-16 21:01:43,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331995125] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:01:43,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:01:43,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-16 21:01:43,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451846953] [2021-11-16 21:01:43,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:01:43,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-16 21:01:43,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:01:43,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-16 21:01:43,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 21:01:43,884 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-11-16 21:01:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:01:43,998 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2021-11-16 21:01:43,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-16 21:01:44,000 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-11-16 21:01:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:01:44,008 INFO L225 Difference]: With dead ends: 139 [2021-11-16 21:01:44,009 INFO L226 Difference]: Without dead ends: 65 [2021-11-16 21:01:44,011 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-11-16 21:01:44,013 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-11-16 21:01:44,013 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-11-16 21:01:44,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-16 21:01:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-11-16 21:01:44,045 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-11-16 21:01:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2021-11-16 21:01:44,050 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2021-11-16 21:01:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:01:44,051 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2021-11-16 21:01:44,051 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-11-16 21:01:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2021-11-16 21:01:44,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-16 21:01:44,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:01:44,056 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-11-16 21:01:44,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 21:01:44,056 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:01:44,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:01:44,056 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2021-11-16 21:01:44,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:01:44,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310781323] [2021-11-16 21:01:44,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:01:44,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:01:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:44,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:01:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:44,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:44,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:01:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:44,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 21:01:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:44,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:01:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:44,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 21:01:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:44,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 21:01:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:44,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 21:01:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:44,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 21:01:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-16 21:01:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 21:01:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-16 21:01:44,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:01:44,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310781323] [2021-11-16 21:01:44,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310781323] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:01:44,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:01:44,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-16 21:01:44,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128821880] [2021-11-16 21:01:44,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:01:44,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 21:01:44,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:01:44,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 21:01:44,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-11-16 21:01:44,514 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-11-16 21:01:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:01:44,792 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2021-11-16 21:01:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 21:01:44,793 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-11-16 21:01:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:01:44,795 INFO L225 Difference]: With dead ends: 89 [2021-11-16 21:01:44,795 INFO L226 Difference]: Without dead ends: 65 [2021-11-16 21:01:44,796 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-11-16 21:01:44,799 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-11-16 21:01:44,799 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-11-16 21:01:44,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-16 21:01:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-11-16 21:01:44,827 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-11-16 21:01:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2021-11-16 21:01:44,830 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2021-11-16 21:01:44,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:01:44,831 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2021-11-16 21:01:44,831 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-11-16 21:01:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2021-11-16 21:01:44,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-16 21:01:44,835 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:01:44,837 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-11-16 21:01:44,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-16 21:01:44,838 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:01:44,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:01:44,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2021-11-16 21:01:44,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:01:44,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990062090] [2021-11-16 21:01:44,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:01:44,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:01:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:01:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:01:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 21:01:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:01:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 21:01:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 21:01:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 21:01:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 21:01:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-16 21:01:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 21:01:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 21:01:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-16 21:01:45,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:01:45,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990062090] [2021-11-16 21:01:45,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990062090] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:01:45,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:01:45,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-16 21:01:45,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220107907] [2021-11-16 21:01:45,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:01:45,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-16 21:01:45,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:01:45,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-16 21:01:45,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2021-11-16 21:01:45,266 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-11-16 21:01:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:01:45,656 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2021-11-16 21:01:45,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-16 21:01:45,656 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-11-16 21:01:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:01:45,658 INFO L225 Difference]: With dead ends: 94 [2021-11-16 21:01:45,658 INFO L226 Difference]: Without dead ends: 92 [2021-11-16 21:01:45,658 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-11-16 21:01:45,659 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 58 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:01:45,659 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-11-16 21:01:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-16 21:01:45,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2021-11-16 21:01:45,666 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-11-16 21:01:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2021-11-16 21:01:45,666 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2021-11-16 21:01:45,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:01:45,667 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2021-11-16 21:01:45,667 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-11-16 21:01:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2021-11-16 21:01:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-16 21:01:45,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:01:45,668 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-11-16 21:01:45,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-16 21:01:45,668 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:01:45,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:01:45,669 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2021-11-16 21:01:45,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:01:45,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686936337] [2021-11-16 21:01:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:01:45,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:01:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:01:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:01:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 21:01:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:01:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 21:01:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 21:01:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:45,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 21:01:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 21:01:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-16 21:01:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 21:01:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 21:01:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 21:01:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-16 21:01:46,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:01:46,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686936337] [2021-11-16 21:01:46,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686936337] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:01:46,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:01:46,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-16 21:01:46,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451017692] [2021-11-16 21:01:46,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:01:46,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 21:01:46,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:01:46,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 21:01:46,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:01:46,042 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-11-16 21:01:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:01:46,367 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2021-11-16 21:01:46,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-16 21:01:46,368 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-11-16 21:01:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:01:46,369 INFO L225 Difference]: With dead ends: 98 [2021-11-16 21:01:46,369 INFO L226 Difference]: Without dead ends: 96 [2021-11-16 21:01:46,369 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-11-16 21:01:46,370 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.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:01:46,370 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.2s Time] [2021-11-16 21:01:46,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-11-16 21:01:46,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-11-16 21:01:46,376 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-11-16 21:01:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2021-11-16 21:01:46,377 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2021-11-16 21:01:46,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:01:46,377 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2021-11-16 21:01:46,378 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-11-16 21:01:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2021-11-16 21:01:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-16 21:01:46,379 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:01:46,379 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-11-16 21:01:46,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-16 21:01:46,379 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:01:46,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:01:46,379 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2021-11-16 21:01:46,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:01:46,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095145040] [2021-11-16 21:01:46,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:01:46,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:01:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:01:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:01:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 21:01:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:01:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 21:01:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-16 21:01:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:01:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 21:01:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:01:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 21:01:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 21:01:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:01:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 21:01:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-16 21:01:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 21:01:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-16 21:01:46,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:01:46,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095145040] [2021-11-16 21:01:46,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095145040] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:01:46,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:01:46,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-16 21:01:46,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222546951] [2021-11-16 21:01:46,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:01:46,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-16 21:01:46,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:01:46,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-16 21:01:46,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:01:46,743 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-11-16 21:01:47,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:01:47,074 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2021-11-16 21:01:47,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 21:01:47,075 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-11-16 21:01:47,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:01:47,076 INFO L225 Difference]: With dead ends: 102 [2021-11-16 21:01:47,076 INFO L226 Difference]: Without dead ends: 100 [2021-11-16 21:01:47,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2021-11-16 21:01:47,077 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 31 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:01:47,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 1006 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 21:01:47,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-16 21:01:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-11-16 21:01:47,083 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-11-16 21:01:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2021-11-16 21:01:47,084 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2021-11-16 21:01:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:01:47,084 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2021-11-16 21:01:47,084 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-11-16 21:01:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2021-11-16 21:01:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-16 21:01:47,085 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:01:47,085 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-11-16 21:01:47,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-16 21:01:47,086 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:01:47,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:01:47,086 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2021-11-16 21:01:47,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:01:47,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25284806] [2021-11-16 21:01:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:01:47,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:01:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:01:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:01:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 21:01:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:01:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 21:01:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-16 21:01:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:01:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 21:01:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:01:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 21:01:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 21:01:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:01:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 21:01:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-16 21:01:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 21:01:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-16 21:01:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-11-16 21:01:47,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:01:47,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25284806] [2021-11-16 21:01:47,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25284806] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:01:47,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:01:47,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-16 21:01:47,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85973668] [2021-11-16 21:01:47,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:01:47,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-16 21:01:47,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:01:47,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-16 21:01:47,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:01:47,616 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-11-16 21:01:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:01:47,900 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2021-11-16 21:01:47,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 21:01:47,901 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-11-16 21:01:47,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:01:47,903 INFO L225 Difference]: With dead ends: 100 [2021-11-16 21:01:47,903 INFO L226 Difference]: Without dead ends: 96 [2021-11-16 21:01:47,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-11-16 21:01:47,906 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-11-16 21:01:47,906 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-11-16 21:01:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-11-16 21:01:47,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-11-16 21:01:47,912 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-11-16 21:01:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-11-16 21:01:47,913 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2021-11-16 21:01:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:01:47,914 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-11-16 21:01:47,914 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-11-16 21:01:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-11-16 21:01:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-16 21:01:47,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:01:47,915 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-11-16 21:01:47,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-16 21:01:47,915 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:01:47,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:01:47,915 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2021-11-16 21:01:47,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:01:47,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895046695] [2021-11-16 21:01:47,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:01:47,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:01:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:01:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:01:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-16 21:01:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:01:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:01:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 21:01:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 21:01:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 21:01:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 21:01:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-16 21:01:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 21:01:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 21:01:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 21:01:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-16 21:01:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-16 21:01:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 21:01:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-16 21:01:48,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:01:48,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895046695] [2021-11-16 21:01:48,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895046695] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:01:48,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:01:48,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-16 21:01:48,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807492866] [2021-11-16 21:01:48,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:01:48,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-16 21:01:48,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:01:48,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-16 21:01:48,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:01:48,413 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-11-16 21:01:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:01:48,723 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2021-11-16 21:01:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-16 21:01:48,723 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-11-16 21:01:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:01:48,724 INFO L225 Difference]: With dead ends: 102 [2021-11-16 21:01:48,724 INFO L226 Difference]: Without dead ends: 71 [2021-11-16 21:01:48,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-11-16 21:01:48,726 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.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:01:48,726 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.2s Time] [2021-11-16 21:01:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-16 21:01:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-16 21:01:48,730 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-11-16 21:01:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-11-16 21:01:48,731 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2021-11-16 21:01:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:01:48,732 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-11-16 21:01:48,732 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-11-16 21:01:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-11-16 21:01:48,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-11-16 21:01:48,733 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:01:48,733 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-11-16 21:01:48,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-16 21:01:48,734 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:01:48,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:01:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2021-11-16 21:01:48,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:01:48,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379425112] [2021-11-16 21:01:48,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:01:48,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:01:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-16 21:01:48,919 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-16 21:01:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-16 21:01:49,097 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-16 21:01:49,097 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-16 21:01:49,098 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-16 21:01:49,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-16 21:01:49,101 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:01:49,103 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 21:01:49,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 09:01:49 BoogieIcfgContainer [2021-11-16 21:01:49,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 21:01:49,144 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 21:01:49,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 21:01:49,145 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 21:01:49,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:01:43" (3/4) ... [2021-11-16 21:01:49,147 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-16 21:01:49,147 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 21:01:49,147 INFO L158 Benchmark]: Toolchain (without parser) took 9059.39ms. Allocated memory was 104.9MB in the beginning and 299.9MB in the end (delta: 195.0MB). Free memory was 59.7MB in the beginning and 88.9MB in the end (delta: -29.2MB). Peak memory consumption was 164.0MB. Max. memory is 16.1GB. [2021-11-16 21:01:49,148 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory was 38.7MB in the beginning and 38.7MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 21:01:49,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2391.15ms. Allocated memory was 104.9MB in the beginning and 167.8MB in the end (delta: 62.9MB). Free memory was 59.5MB in the beginning and 70.7MB in the end (delta: -11.2MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2021-11-16 21:01:49,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.58ms. Allocated memory is still 167.8MB. Free memory was 70.7MB in the beginning and 104.9MB in the end (delta: -34.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-16 21:01:49,159 INFO L158 Benchmark]: Boogie Preprocessor took 68.08ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 100.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-16 21:01:49,159 INFO L158 Benchmark]: RCFGBuilder took 608.26ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 70.2MB in the end (delta: 30.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-11-16 21:01:49,160 INFO L158 Benchmark]: TraceAbstraction took 5833.67ms. Allocated memory was 167.8MB in the beginning and 299.9MB in the end (delta: 132.1MB). Free memory was 69.3MB in the beginning and 88.9MB in the end (delta: -19.6MB). Peak memory consumption was 111.3MB. Max. memory is 16.1GB. [2021-11-16 21:01:49,160 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 299.9MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 21:01:49,161 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.16ms. Allocated memory is still 81.8MB. Free memory was 38.7MB in the beginning and 38.7MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2391.15ms. Allocated memory was 104.9MB in the beginning and 167.8MB in the end (delta: 62.9MB). Free memory was 59.5MB in the beginning and 70.7MB in the end (delta: -11.2MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 149.58ms. Allocated memory is still 167.8MB. Free memory was 70.7MB in the beginning and 104.9MB in the end (delta: -34.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.08ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 100.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 608.26ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 70.2MB in the end (delta: 30.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5833.67ms. Allocated memory was 167.8MB in the beginning and 299.9MB in the end (delta: 132.1MB). Free memory was 69.3MB in the beginning and 88.9MB in the end (delta: -19.6MB). Peak memory consumption was 111.3MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 299.9MB. Free memory is still 88.9MB. 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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L11318] const char *str1 = ensure_c_str_is_allocated(64); [L11319] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L261] return __VERIFIER_nondet_bool(); [L11319] RET, EXPR nondet_bool() VAL [nondet_bool()=0, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}, str1={-2:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [nondet_bool()=0, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}, str1={-2:0}] [L11319] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L10794] CALL assume_abort_if_not((aws_c_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L10795] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L10795] CALL assume_abort_if_not((aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L10797-L10798] _Bool rval = !strcmp(a, b); [L10799] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L10799] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L7113] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L7114-L7117] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L7119] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L266] return __VERIFIER_nondet_ulong(); [L7119] RET, EXPR nondet_uint64_t() VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, nondet_uint64_t()=18482772870728515581, s_can_fail_allocator_static={257:0}, s_tolower_table={258: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={257:0}, s_tolower_table={258:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L7120-L7122] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, i=36028797018963965, len=36028797018963966, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, a[i]=-255, b={-3:0}, b={-3:0}, b[i]=0, i=36028797018963965, len=36028797018963966, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L7123] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={257:0}, s_tolower_table={258:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 4167 SdHoareTripleChecker+Invalid, 1.1s 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, 0.9s 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.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1717 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-11-16 21:01:49,198 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.1-dev-0f8a17c [2021-11-16 21:01:51,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 21:01:51,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 21:01:51,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 21:01:51,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 21:01:51,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 21:01:51,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 21:01:51,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 21:01:51,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 21:01:51,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 21:01:51,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 21:01:51,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 21:01:51,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 21:01:51,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 21:01:51,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 21:01:51,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 21:01:51,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 21:01:51,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 21:01:51,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 21:01:51,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 21:01:51,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 21:01:51,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 21:01:51,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 21:01:51,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 21:01:51,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 21:01:51,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 21:01:51,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 21:01:51,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 21:01:51,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 21:01:51,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 21:01:51,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 21:01:51,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 21:01:51,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 21:01:51,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 21:01:51,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 21:01:51,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 21:01:51,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 21:01:51,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 21:01:51,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 21:01:51,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 21:01:51,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 21:01:51,235 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-16 21:01:51,258 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 21:01:51,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 21:01:51,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 21:01:51,259 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 21:01:51,260 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 21:01:51,260 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 21:01:51,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 21:01:51,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 21:01:51,261 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 21:01:51,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 21:01:51,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 21:01:51,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 21:01:51,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 21:01:51,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 21:01:51,262 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-16 21:01:51,262 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-16 21:01:51,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 21:01:51,262 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 21:01:51,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 21:01:51,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 21:01:51,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 21:01:51,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 21:01:51,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:01:51,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 21:01:51,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 21:01:51,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 21:01:51,263 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-16 21:01:51,263 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-16 21:01:51,263 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 21:01:51,263 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 21:01:51,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 21:01:51,263 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 21:01:51,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-16 21:01:51,264 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-11-16 21:01:51,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 21:01:51,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 21:01:51,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 21:01:51,566 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 21:01:51,566 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 21:01:51,567 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-11-16 21:01:51,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9586e7664/7f50e5f045e94568abd2105111f1ae32/FLAG578b30fdd [2021-11-16 21:01:52,330 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 21:01:52,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-11-16 21:01:52,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9586e7664/7f50e5f045e94568abd2105111f1ae32/FLAG578b30fdd [2021-11-16 21:01:52,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9586e7664/7f50e5f045e94568abd2105111f1ae32 [2021-11-16 21:01:52,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 21:01:52,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 21:01:52,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 21:01:52,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 21:01:52,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 21:01:52,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:01:52" (1/1) ... [2021-11-16 21:01:52,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4467eecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:52, skipping insertion in model container [2021-11-16 21:01:52,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:01:52" (1/1) ... [2021-11-16 21:01:52,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 21:01:52,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 21:01:52,774 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-11-16 21:01:52,781 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-11-16 21:01:52,802 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:01:52,809 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:01:53,676 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:53,678 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:53,678 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:53,679 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:53,679 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:53,701 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:53,703 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:53,704 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:53,705 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,043 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:01:54,045 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:01:54,046 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:01:54,047 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:01:54,048 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:01:54,049 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:01:54,050 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:01:54,051 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:01:54,052 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:01:54,053 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:01:54,196 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:01:54,283 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,283 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,493 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,495 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,513 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,514 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,520 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,520 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,552 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,553 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,553 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,554 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,554 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,555 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,555 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,603 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:01:54,651 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 21:01:54,668 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-11-16 21:01:54,669 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-11-16 21:01:54,670 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:01:54,671 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:01:54,715 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,715 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,716 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,716 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,716 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,720 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,721 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,721 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,722 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,767 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:01:54,767 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:01:54,768 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:01:54,768 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:01:54,768 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:01:54,769 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:01:54,769 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:01:54,769 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:01:54,769 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:01:54,770 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:01:54,783 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:01:54,820 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,822 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,894 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,895 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,905 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,905 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,908 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,909 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,919 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,919 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,920 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,921 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,921 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,921 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,922 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:01:54,987 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:01:55,238 INFO L208 MainTranslator]: Completed translation [2021-11-16 21:01:55,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:55 WrapperNode [2021-11-16 21:01:55,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 21:01:55,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 21:01:55,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 21:01:55,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 21:01:55,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:55" (1/1) ... [2021-11-16 21:01:55,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:55" (1/1) ... [2021-11-16 21:01:55,380 INFO L137 Inliner]: procedures = 790, calls = 3255, calls flagged for inlining = 80, calls inlined = 5, statements flattened = 336 [2021-11-16 21:01:55,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 21:01:55,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 21:01:55,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 21:01:55,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 21:01:55,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:55" (1/1) ... [2021-11-16 21:01:55,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:55" (1/1) ... [2021-11-16 21:01:55,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:55" (1/1) ... [2021-11-16 21:01:55,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:55" (1/1) ... [2021-11-16 21:01:55,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:55" (1/1) ... [2021-11-16 21:01:55,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:55" (1/1) ... [2021-11-16 21:01:55,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:55" (1/1) ... [2021-11-16 21:01:55,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 21:01:55,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 21:01:55,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 21:01:55,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 21:01:55,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:55" (1/1) ... [2021-11-16 21:01:55,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:01:55,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:01:55,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-16 21:01:55,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-16 21:01:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 21:01:55,587 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 21:01:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 21:01:55,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 21:01:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 21:01:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 21:01:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 21:01:55,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 21:01:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 21:01:55,588 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 21:01:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 21:01:55,589 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-11-16 21:01:55,589 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-11-16 21:01:55,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-16 21:01:55,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-16 21:01:55,589 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 21:01:55,589 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 21:01:55,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 21:01:55,589 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2021-11-16 21:01:55,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2021-11-16 21:01:55,590 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2021-11-16 21:01:55,590 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2021-11-16 21:01:55,839 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 21:01:55,840 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 21:01:56,185 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2021-11-16 21:01:56,207 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 21:01:56,212 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 21:01:56,212 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-16 21:01:56,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:01:56 BoogieIcfgContainer [2021-11-16 21:01:56,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 21:01:56,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 21:01:56,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 21:01:56,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 21:01:56,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:01:52" (1/3) ... [2021-11-16 21:01:56,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a3d9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:01:56, skipping insertion in model container [2021-11-16 21:01:56,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:01:55" (2/3) ... [2021-11-16 21:01:56,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a3d9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:01:56, skipping insertion in model container [2021-11-16 21:01:56,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:01:56" (3/3) ... [2021-11-16 21:01:56,218 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2021-11-16 21:01:56,221 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 21:01:56,221 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 21:01:56,298 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 21:01:56,304 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 21:01:56,304 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 21:01:56,317 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-11-16 21:01:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-16 21:01:56,323 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:01:56,324 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-11-16 21:01:56,325 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:01:56,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:01:56,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2021-11-16 21:01:56,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:01:56,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815433958] [2021-11-16 21:01:56,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:01:56,345 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:01:56,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:01:56,347 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-11-16 21:01:56,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-16 21:01:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:56,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-16 21:01:56,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:01:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-11-16 21:01:56,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:01:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-11-16 21:01:56,842 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:01:56,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815433958] [2021-11-16 21:01:56,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815433958] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:01:56,842 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:01:56,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-16 21:01:56,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607454761] [2021-11-16 21:01:56,844 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:01:56,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-16 21:01:56,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:01:56,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-16 21:01:56,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 21:01:56,864 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-11-16 21:01:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:01:56,881 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2021-11-16 21:01:56,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-16 21:01:56,883 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-11-16 21:01:56,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:01:56,888 INFO L225 Difference]: With dead ends: 139 [2021-11-16 21:01:56,888 INFO L226 Difference]: Without dead ends: 65 [2021-11-16 21:01:56,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 21:01:56,892 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-11-16 21:01:56,893 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-11-16 21:01:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-16 21:01:56,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-11-16 21:01:56,918 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-11-16 21:01:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2021-11-16 21:01:56,920 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2021-11-16 21:01:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:01:56,938 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2021-11-16 21:01:56,938 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-11-16 21:01:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2021-11-16 21:01:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-16 21:01:56,941 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:01:56,941 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-11-16 21:01:56,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-16 21:01:57,154 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-11-16 21:01:57,155 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:01:57,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:01:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2021-11-16 21:01:57,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:01:57,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508538162] [2021-11-16 21:01:57,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:01:57,157 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:01:57,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:01:57,158 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-11-16 21:01:57,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-16 21:01:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:57,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-16 21:01:57,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:01:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-16 21:01:57,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:01:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-16 21:01:57,902 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:01:57,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508538162] [2021-11-16 21:01:57,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508538162] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:01:57,903 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:01:57,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 14 [2021-11-16 21:01:57,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630345682] [2021-11-16 21:01:57,904 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:01:57,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 21:01:57,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:01:57,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 21:01:57,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:01:57,910 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 10 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) [2021-11-16 21:01:58,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:01:58,122 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2021-11-16 21:01:58,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 21:01:58,123 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 10 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) Word has length 70 [2021-11-16 21:01:58,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:01:58,125 INFO L225 Difference]: With dead ends: 89 [2021-11-16 21:01:58,125 INFO L226 Difference]: Without dead ends: 65 [2021-11-16 21:01:58,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-11-16 21:01:58,126 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 32 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:01:58,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 722 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:01:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-16 21:01:58,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-11-16 21:01:58,133 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-11-16 21:01:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2021-11-16 21:01:58,134 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2021-11-16 21:01:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:01:58,134 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2021-11-16 21:01:58,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 10 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) [2021-11-16 21:01:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2021-11-16 21:01:58,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-16 21:01:58,144 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:01:58,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-11-16 21:01:58,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-16 21:01:58,357 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-11-16 21:01:58,357 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:01:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:01:58,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2021-11-16 21:01:58,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:01:58,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087926152] [2021-11-16 21:01:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:01:58,360 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:01:58,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:01:58,376 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-11-16 21:01:58,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-16 21:01:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:58,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-16 21:01:58,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:01:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-16 21:01:58,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:01:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-16 21:01:59,143 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:01:59,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087926152] [2021-11-16 21:01:59,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087926152] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:01:59,143 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:01:59,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 15] imperfect sequences [] total 19 [2021-11-16 21:01:59,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985217933] [2021-11-16 21:01:59,144 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:01:59,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-16 21:01:59,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:01:59,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-16 21:01:59,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-11-16 21:01:59,145 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 13 states have internal predecessors, (37), 5 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 4 states have call successors, (14) [2021-11-16 21:01:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:01:59,530 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2021-11-16 21:01:59,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-16 21:01:59,536 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 13 states have internal predecessors, (37), 5 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 4 states have call successors, (14) Word has length 75 [2021-11-16 21:01:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:01:59,537 INFO L225 Difference]: With dead ends: 94 [2021-11-16 21:01:59,537 INFO L226 Difference]: Without dead ends: 92 [2021-11-16 21:01:59,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2021-11-16 21:01:59,538 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 39 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:01:59,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 1179 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-16 21:01:59,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-16 21:01:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2021-11-16 21:01:59,553 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-11-16 21:01:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2021-11-16 21:01:59,555 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2021-11-16 21:01:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:01:59,555 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2021-11-16 21:01:59,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 13 states have internal predecessors, (37), 5 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 4 states have call successors, (14) [2021-11-16 21:01:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2021-11-16 21:01:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-16 21:01:59,556 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:01:59,557 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-11-16 21:01:59,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-16 21:01:59,767 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-11-16 21:01:59,767 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:01:59,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:01:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2021-11-16 21:01:59,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:01:59,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734445033] [2021-11-16 21:01:59,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:01:59,769 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:01:59,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:01:59,783 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-11-16 21:01:59,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-16 21:01:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:01:59,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-16 21:01:59,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:02:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-16 21:02:00,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:02:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-16 21:02:00,622 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:02:00,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734445033] [2021-11-16 21:02:00,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734445033] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:02:00,623 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:02:00,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [] total 18 [2021-11-16 21:02:00,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161822571] [2021-11-16 21:02:00,623 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:02:00,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-16 21:02:00,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:02:00,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-16 21:02:00,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-11-16 21:02:00,624 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 18 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 5 states have call successors, (21) [2021-11-16 21:02:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:02:00,969 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2021-11-16 21:02:00,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-16 21:02:00,969 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 5 states have call successors, (21) Word has length 83 [2021-11-16 21:02:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:02:00,970 INFO L225 Difference]: With dead ends: 98 [2021-11-16 21:02:00,971 INFO L226 Difference]: Without dead ends: 96 [2021-11-16 21:02:00,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2021-11-16 21:02:00,971 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 45 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:02:00,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 920 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-16 21:02:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-11-16 21:02:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-11-16 21:02:00,979 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-11-16 21:02:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2021-11-16 21:02:00,980 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2021-11-16 21:02:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:02:00,981 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2021-11-16 21:02:00,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 5 states have call successors, (21) [2021-11-16 21:02:00,981 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2021-11-16 21:02:00,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-16 21:02:00,981 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:02:00,982 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-11-16 21:02:01,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-16 21:02:01,194 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-11-16 21:02:01,195 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:02:01,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:02:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2021-11-16 21:02:01,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:02:01,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030825106] [2021-11-16 21:02:01,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:02:01,197 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:02:01,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:02:01,198 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-11-16 21:02:01,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-16 21:02:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:01,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-16 21:02:01,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:02:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-16 21:02:01,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:02:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-16 21:02:01,988 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:02:01,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030825106] [2021-11-16 21:02:01,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030825106] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:02:01,988 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:02:01,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 14] imperfect sequences [] total 18 [2021-11-16 21:02:01,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050724557] [2021-11-16 21:02:01,988 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:02:01,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-16 21:02:01,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:02:01,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-16 21:02:01,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-11-16 21:02:01,989 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (17), 7 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-16 21:02:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:02:02,266 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2021-11-16 21:02:02,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 21:02:02,266 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (17), 7 states have call predecessors, (17), 3 states have call successors, (17) Word has length 107 [2021-11-16 21:02:02,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:02:02,267 INFO L225 Difference]: With dead ends: 102 [2021-11-16 21:02:02,267 INFO L226 Difference]: Without dead ends: 100 [2021-11-16 21:02:02,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2021-11-16 21:02:02,268 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 15 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:02:02,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 1468 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 21:02:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-16 21:02:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-11-16 21:02:02,275 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-11-16 21:02:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2021-11-16 21:02:02,276 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2021-11-16 21:02:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:02:02,276 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2021-11-16 21:02:02,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (17), 7 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-16 21:02:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2021-11-16 21:02:02,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-16 21:02:02,280 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:02:02,280 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-11-16 21:02:02,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-16 21:02:02,498 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-11-16 21:02:02,498 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:02:02,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:02:02,499 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2021-11-16 21:02:02,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:02:02,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718078702] [2021-11-16 21:02:02,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:02:02,509 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:02:02,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:02:02,524 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-11-16 21:02:02,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-16 21:02:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:02,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-16 21:02:02,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:02:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-11-16 21:02:03,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:02:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-11-16 21:02:03,497 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:02:03,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718078702] [2021-11-16 21:02:03,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718078702] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:02:03,497 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:02:03,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 14] imperfect sequences [] total 16 [2021-11-16 21:02:03,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239148567] [2021-11-16 21:02:03,497 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:02:03,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-16 21:02:03,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:02:03,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-16 21:02:03,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-11-16 21:02:03,499 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-16 21:02:03,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:02:03,867 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2021-11-16 21:02:03,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 21:02:03,869 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2021-11-16 21:02:03,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:02:03,871 INFO L225 Difference]: With dead ends: 100 [2021-11-16 21:02:03,871 INFO L226 Difference]: Without dead ends: 96 [2021-11-16 21:02:03,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-11-16 21:02:03,872 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 23 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:02:03,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 862 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-16 21:02:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-11-16 21:02:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-11-16 21:02:03,880 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-11-16 21:02:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-11-16 21:02:03,881 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2021-11-16 21:02:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:02:03,881 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-11-16 21:02:03,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-16 21:02:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-11-16 21:02:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-16 21:02:03,882 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:02:03,882 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-11-16 21:02:03,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-16 21:02:04,094 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-11-16 21:02:04,095 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:02:04,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:02:04,095 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2021-11-16 21:02:04,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:02:04,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231342828] [2021-11-16 21:02:04,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:02:04,096 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:02:04,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:02:04,097 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-11-16 21:02:04,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-16 21:02:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:04,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-16 21:02:04,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:02:04,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-11-16 21:02:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-16 21:02:04,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:02:04,873 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-11-16 21:02:04,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2021-11-16 21:02:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-16 21:02:05,126 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:02:05,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231342828] [2021-11-16 21:02:05,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231342828] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:02:05,126 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:02:05,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2021-11-16 21:02:05,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969051195] [2021-11-16 21:02:05,126 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:02:05,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 21:02:05,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:02:05,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 21:02:05,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:02:05,127 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 11 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-16 21:02:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:02:05,302 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2021-11-16 21:02:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:02:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 100 [2021-11-16 21:02:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:02:05,304 INFO L225 Difference]: With dead ends: 102 [2021-11-16 21:02:05,304 INFO L226 Difference]: Without dead ends: 71 [2021-11-16 21:02:05,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:02:05,305 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 14 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:02:05,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 627 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 7 Unchecked, 0.1s Time] [2021-11-16 21:02:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-16 21:02:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-16 21:02:05,309 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-11-16 21:02:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-11-16 21:02:05,310 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2021-11-16 21:02:05,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:02:05,310 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-11-16 21:02:05,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-16 21:02:05,310 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-11-16 21:02:05,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-11-16 21:02:05,311 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:02:05,316 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-11-16 21:02:05,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-16 21:02:05,527 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-11-16 21:02:05,528 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:02:05,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:02:05,529 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2021-11-16 21:02:05,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:02:05,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579731840] [2021-11-16 21:02:05,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:02:05,530 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:02:05,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:02:05,532 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-11-16 21:02:05,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-16 21:02:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-16 21:02:06,515 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-16 21:02:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-16 21:02:07,539 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-11-16 21:02:07,539 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-16 21:02:07,540 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-16 21:02:07,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-11-16 21:02:07,768 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-11-16 21:02:07,771 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:02:07,773 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 21:02:07,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 09:02:07 BoogieIcfgContainer [2021-11-16 21:02:07,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 21:02:07,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 21:02:07,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 21:02:07,858 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 21:02:07,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:01:56" (3/4) ... [2021-11-16 21:02:07,862 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-16 21:02:07,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 21:02:07,863 INFO L158 Benchmark]: Toolchain (without parser) took 15415.88ms. Allocated memory was 60.8MB in the beginning and 281.0MB in the end (delta: 220.2MB). Free memory was 30.0MB in the beginning and 87.1MB in the end (delta: -57.0MB). Peak memory consumption was 165.7MB. Max. memory is 16.1GB. [2021-11-16 21:02:07,863 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 21:02:07,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2789.93ms. Allocated memory was 60.8MB in the beginning and 146.8MB in the end (delta: 86.0MB). Free memory was 29.7MB in the beginning and 55.4MB in the end (delta: -25.6MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2021-11-16 21:02:07,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.67ms. Allocated memory is still 146.8MB. Free memory was 55.4MB in the beginning and 84.3MB in the end (delta: -28.9MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2021-11-16 21:02:07,864 INFO L158 Benchmark]: Boogie Preprocessor took 72.56ms. Allocated memory is still 146.8MB. Free memory was 84.3MB in the beginning and 79.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-16 21:02:07,865 INFO L158 Benchmark]: RCFGBuilder took 759.50ms. Allocated memory is still 146.8MB. Free memory was 79.0MB in the beginning and 43.4MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-11-16 21:02:07,865 INFO L158 Benchmark]: TraceAbstraction took 11642.86ms. Allocated memory was 146.8MB in the beginning and 281.0MB in the end (delta: 134.2MB). Free memory was 43.4MB in the beginning and 88.1MB in the end (delta: -44.7MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2021-11-16 21:02:07,865 INFO L158 Benchmark]: Witness Printer took 5.31ms. Allocated memory is still 281.0MB. Free memory was 88.1MB in the beginning and 87.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 21:02:07,866 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2789.93ms. Allocated memory was 60.8MB in the beginning and 146.8MB in the end (delta: 86.0MB). Free memory was 29.7MB in the beginning and 55.4MB in the end (delta: -25.6MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 140.67ms. Allocated memory is still 146.8MB. Free memory was 55.4MB in the beginning and 84.3MB in the end (delta: -28.9MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.56ms. Allocated memory is still 146.8MB. Free memory was 84.3MB in the beginning and 79.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 759.50ms. Allocated memory is still 146.8MB. Free memory was 79.0MB in the beginning and 43.4MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11642.86ms. Allocated memory was 146.8MB in the beginning and 281.0MB in the end (delta: 134.2MB). Free memory was 43.4MB in the beginning and 88.1MB in the end (delta: -44.7MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. * Witness Printer took 5.31ms. Allocated memory is still 281.0MB. Free memory was 88.1MB in the beginning and 87.1MB in the end (delta: 1.0MB). 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={15:0}, s_tolower_table={19: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={15:0}, s_tolower_table={19:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={15:0}, s_tolower_table={19: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={15:0}, s_tolower_table={19: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={15:0}, s_tolower_table={19:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19: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={15:0}, s_tolower_table={19:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=64, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=64, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, size=64] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={11:0}, cap=64, max_size=64, s_can_fail_allocator_static={15:0}, s_tolower_table={19: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={15:0}, s_tolower_table={19:0}, str={11:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19: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={15:0}, s_tolower_table={19:0}, str={11:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={11:0}, cap=64, max_size=64, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, str={11:0}] [L11318] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={11:0}, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L11318] const char *str1 = ensure_c_str_is_allocated(64); [L11319] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L261] return __VERIFIER_nondet_bool(); [L11319] RET, EXPR nondet_bool() VAL [nondet_bool()=0, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, str1={11:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [nondet_bool()=0, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, str1={11:0}] [L11319] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={15:0}, s_tolower_table={19: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={15:0}, s_tolower_table={19: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={15:0}, s_tolower_table={19:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19: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={15:0}, s_tolower_table={19:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=64, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=64, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, size=64] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={7:0}, cap=64, max_size=64, s_can_fail_allocator_static={15:0}, s_tolower_table={19: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={15:0}, s_tolower_table={19:0}, str={7:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19: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={15:0}, s_tolower_table={19:0}, str={7:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={7:0}, cap=64, max_size=64, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, str={7:0}] [L11319] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={7:0}, nondet_bool()=0, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, str1={11:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={7:0}, nondet_bool()=0, nondet_bool() ? str1 : ensure_c_str_is_allocated(64)={7:0}, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, str1={11: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={15:0}, s_tolower_table={19:0}, str={11:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, str={11:0}, str={11:0}] [L10794] RET, EXPR aws_c_string_is_valid(a) VAL [a={11:0}, a={11:0}, aws_c_string_is_valid(a)=1, b={7:0}, b={7:0}, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L10794] CALL assume_abort_if_not((aws_c_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L10794] RET assume_abort_if_not((aws_c_string_is_valid(a))) VAL [a={11:0}, a={11:0}, aws_c_string_is_valid(a)=1, b={7:0}, b={7:0}, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L10795] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, str={7:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, str={7:0}, str={7:0}] [L10795] RET, EXPR aws_c_string_is_valid(b) VAL [a={11:0}, a={11:0}, aws_c_string_is_valid(b)=1, b={7:0}, b={7:0}, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L10795] CALL assume_abort_if_not((aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L10795] RET assume_abort_if_not((aws_c_string_is_valid(b))) VAL [a={11:0}, a={11:0}, aws_c_string_is_valid(b)=1, b={7:0}, b={7:0}, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L10797-L10798] _Bool rval = !strcmp(a, b); [L10799] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, str={11:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, str={11:0}, str={11:0}] [L10799] RET, EXPR aws_c_string_is_valid(a) VAL [a={11:0}, a={11:0}, aws_c_string_is_valid(a)=1, b={7:0}, b={7:0}, rval=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={11:0}, a={11:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, b={7:0}, b={7:0}, rval=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L10799] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, str={7:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}, str={7:0}, str={7:0}] [L10799] RET, EXPR aws_c_string_is_valid(b) VAL [a={11:0}, a={11: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={7:0}, b={7:0}, rval=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={11:0}, a={11: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={7:0}, b={7:0}, rval=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19: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={15:0}, s_tolower_table={19:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L10799] RET __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [a={11:0}, a={11: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={7:0}, b={7:0}, rval=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L10799] return rval; VAL [\result=1, a={11:0}, a={11:0}, b={7:0}, b={7:0}, rval=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19: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={15:0}, s_tolower_table={19:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L7113] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=1073741824, a={11:0}, a={11:0}, b={7:0}, b={7:0}, len=1073741824, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L7114-L7117] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=1073741824, a={11:0}, a={11:0}, b={7:0}, b={7:0}, len=1073741824, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L7119] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L266] return __VERIFIER_nondet_ulong(); [L7119] RET, EXPR nondet_uint64_t() VAL [\old(len)=1073741824, a={11:0}, a={11:0}, b={7:0}, b={7:0}, len=1073741824, nondet_uint64_t()=0, s_can_fail_allocator_static={15:0}, s_tolower_table={19: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={15:0}, s_tolower_table={19:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L7120-L7122] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=1073741824, a={11:0}, a={11:0}, b={7:0}, b={7:0}, i=0, len=1073741824, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=1073741824, a={11:0}, a={11:0}, a[i]=48, b={7:0}, b={7:0}, b[i]=-80, i=0, len=1073741824, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L7123] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={15:0}, s_tolower_table={19:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, 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, 195 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 5864 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7 IncrementalHoareTripleChecker+Unchecked, 5317 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1172 IncrementalHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 547 mSDtfsCounter, 1172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1246 GetRequests, 1136 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1220 ConstructedInterpolants, 1 QuantifiedInterpolants, 2723 SizeOfPredicates, 61 NumberOfNonLiveVariables, 3217 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 1194/1194 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-11-16 21:02:07,904 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