./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 ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 03:17:50,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 03:17:50,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 03:17:50,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 03:17:50,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 03:17:50,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 03:17:50,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 03:17:50,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 03:17:50,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 03:17:50,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 03:17:50,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 03:17:50,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 03:17:50,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 03:17:50,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 03:17:50,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 03:17:50,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 03:17:50,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 03:17:50,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 03:17:50,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 03:17:50,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 03:17:50,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 03:17:50,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 03:17:50,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 03:17:50,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 03:17:50,950 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 03:17:50,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 03:17:50,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 03:17:50,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 03:17:50,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 03:17:50,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 03:17:50,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 03:17:50,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 03:17:50,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 03:17:50,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 03:17:50,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 03:17:50,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 03:17:50,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 03:17:50,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 03:17:50,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 03:17:50,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 03:17:50,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 03:17:50,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-28 03:17:50,992 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 03:17:50,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 03:17:50,993 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 03:17:50,994 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 03:17:50,994 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 03:17:50,994 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 03:17:50,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 03:17:50,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 03:17:50,996 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 03:17:50,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 03:17:50,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 03:17:50,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 03:17:50,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 03:17:50,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 03:17:50,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 03:17:50,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 03:17:50,997 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 03:17:50,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 03:17:50,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 03:17:50,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 03:17:50,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 03:17:50,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:17:50,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 03:17:50,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 03:17:50,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 03:17:50,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 03:17:50,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 03:17:50,999 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 03:17:50,999 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 03:17:50,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 03:17:51,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 [2021-12-28 03:17:51,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 03:17:51,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 03:17:51,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 03:17:51,288 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 03:17:51,288 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 03:17:51,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-28 03:17:51,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8255d44c/0c94e20a62c549dd9142e357f6649e14/FLAGc3c6a8a02 [2021-12-28 03:17:51,987 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 03:17:51,988 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-28 03:17:52,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8255d44c/0c94e20a62c549dd9142e357f6649e14/FLAGc3c6a8a02 [2021-12-28 03:17:52,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8255d44c/0c94e20a62c549dd9142e357f6649e14 [2021-12-28 03:17:52,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 03:17:52,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 03:17:52,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 03:17:52,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 03:17:52,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 03:17:52,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:17:52" (1/1) ... [2021-12-28 03:17:52,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa19b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:17:52, skipping insertion in model container [2021-12-28 03:17:52,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:17:52" (1/1) ... [2021-12-28 03:17:52,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 03:17:52,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 03:17:52,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-28 03:17:52,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-28 03:17:53,272 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:53,273 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:53,273 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:53,274 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:53,274 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:53,285 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:53,286 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:53,287 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:53,288 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:53,588 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-28 03:17:53,589 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-28 03:17:53,590 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-28 03:17:53,591 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-28 03:17:53,594 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-28 03:17:53,595 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-28 03:17:53,598 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-28 03:17:53,599 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-28 03:17:53,599 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-28 03:17:53,601 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-28 03:17:53,740 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-28 03:17:53,837 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:53,837 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,064 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,065 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,081 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,083 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,090 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,091 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,104 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,106 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,106 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,107 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,107 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,108 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,108 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:17:54,189 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 03:17:54,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-28 03:17:54,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-28 03:17:54,245 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,246 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,246 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,246 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,246 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,266 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,267 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,268 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,268 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,288 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-28 03:17:54,288 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-28 03:17:54,289 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-28 03:17:54,289 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-28 03:17:54,290 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-28 03:17:54,290 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-28 03:17:54,290 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-28 03:17:54,291 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-28 03:17:54,291 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-28 03:17:54,291 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-28 03:17:54,302 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-28 03:17:54,336 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,338 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,399 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,399 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,408 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,409 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,412 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,413 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,418 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,418 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,419 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,419 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,419 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,419 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,420 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:17:54,471 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:17:54,694 INFO L208 MainTranslator]: Completed translation [2021-12-28 03:17:54,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:17:54 WrapperNode [2021-12-28 03:17:54,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 03:17:54,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 03:17:54,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 03:17:54,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 03:17:54,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:17:54" (1/1) ... [2021-12-28 03:17:54,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:17:54" (1/1) ... [2021-12-28 03:17:54,826 INFO L137 Inliner]: procedures = 768, calls = 3253, calls flagged for inlining = 78, calls inlined = 5, statements flattened = 337 [2021-12-28 03:17:54,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 03:17:54,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 03:17:54,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 03:17:54,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 03:17:54,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:17:54" (1/1) ... [2021-12-28 03:17:54,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:17:54" (1/1) ... [2021-12-28 03:17:54,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:17:54" (1/1) ... [2021-12-28 03:17:54,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:17:54" (1/1) ... [2021-12-28 03:17:54,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:17:54" (1/1) ... [2021-12-28 03:17:54,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:17:54" (1/1) ... [2021-12-28 03:17:54,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:17:54" (1/1) ... [2021-12-28 03:17:54,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 03:17:54,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 03:17:54,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 03:17:54,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 03:17:54,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:17:54" (1/1) ... [2021-12-28 03:17:54,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:17:54,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:17:54,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 03:17:54,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 03:17:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-28 03:17:54,963 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-28 03:17:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 03:17:54,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-28 03:17:54,964 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-28 03:17:54,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 03:17:54,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 03:17:54,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 03:17:54,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 03:17:54,964 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-28 03:17:54,964 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-28 03:17:54,964 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-28 03:17:54,965 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-28 03:17:54,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 03:17:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-28 03:17:54,966 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-28 03:17:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2021-12-28 03:17:54,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2021-12-28 03:17:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2021-12-28 03:17:54,966 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2021-12-28 03:17:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 03:17:55,193 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 03:17:55,194 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 03:17:55,369 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2021-12-28 03:17:55,377 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 03:17:55,381 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 03:17:55,381 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-28 03:17:55,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:17:55 BoogieIcfgContainer [2021-12-28 03:17:55,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 03:17:55,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 03:17:55,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 03:17:55,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 03:17:55,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:17:52" (1/3) ... [2021-12-28 03:17:55,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f70f9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:17:55, skipping insertion in model container [2021-12-28 03:17:55,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:17:54" (2/3) ... [2021-12-28 03:17:55,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f70f9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:17:55, skipping insertion in model container [2021-12-28 03:17:55,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:17:55" (3/3) ... [2021-12-28 03:17:55,388 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2021-12-28 03:17:55,391 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 03:17:55,391 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 03:17:55,420 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 03:17:55,425 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 03:17:55,425 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 03:17:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-28 03:17:55,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-28 03:17:55,441 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:17:55,442 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:17:55,442 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:17:55,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:17:55,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2021-12-28 03:17:55,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:17:55,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453670248] [2021-12-28 03:17:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:17:55,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:17:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:55,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:17:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:55,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:55,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:17:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:55,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 03:17:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:55,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:55,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 03:17:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:55,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:17:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:55,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 03:17:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:55,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:17:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:55,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:17:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:55,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 03:17:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-28 03:17:55,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:17:55,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453670248] [2021-12-28 03:17:55,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453670248] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:17:55,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:17:55,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 03:17:55,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56597471] [2021-12-28 03:17:55,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:17:55,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 03:17:55,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:17:55,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 03:17:55,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:17:55,897 INFO L87 Difference]: Start difference. First operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:17:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:17:56,029 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2021-12-28 03:17:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 03:17:56,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2021-12-28 03:17:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:17:56,038 INFO L225 Difference]: With dead ends: 139 [2021-12-28 03:17:56,038 INFO L226 Difference]: Without dead ends: 65 [2021-12-28 03:17:56,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:17:56,048 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:17:56,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 113 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:17:56,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-28 03:17:56,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-28 03:17:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-28 03:17:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2021-12-28 03:17:56,081 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2021-12-28 03:17:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:17:56,082 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2021-12-28 03:17:56,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 03:17:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2021-12-28 03:17:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-28 03:17:56,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:17:56,086 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:17:56,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 03:17:56,086 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:17:56,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:17:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2021-12-28 03:17:56,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:17:56,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535902650] [2021-12-28 03:17:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:17:56,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:17:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:56,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:17:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:56,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:56,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:17:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:56,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 03:17:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:56,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:56,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 03:17:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:17:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:56,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 03:17:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:56,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:17:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:56,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:17:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:56,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 03:17:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:56,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 03:17:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-28 03:17:56,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:17:56,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535902650] [2021-12-28 03:17:56,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535902650] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:17:56,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:17:56,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 03:17:56,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837299641] [2021-12-28 03:17:56,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:17:56,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 03:17:56,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:17:56,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 03:17:56,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-28 03:17:56,583 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-28 03:17:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:17:56,921 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2021-12-28 03:17:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 03:17:56,921 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 70 [2021-12-28 03:17:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:17:56,924 INFO L225 Difference]: With dead ends: 89 [2021-12-28 03:17:56,925 INFO L226 Difference]: Without dead ends: 65 [2021-12-28 03:17:56,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-12-28 03:17:56,930 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 46 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:17:56,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 432 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:17:56,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-28 03:17:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-28 03:17:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-28 03:17:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2021-12-28 03:17:56,943 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2021-12-28 03:17:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:17:56,943 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2021-12-28 03:17:56,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-28 03:17:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2021-12-28 03:17:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-28 03:17:56,945 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:17:56,945 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:17:56,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 03:17:56,946 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:17:56,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:17:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2021-12-28 03:17:56,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:17:56,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016077076] [2021-12-28 03:17:56,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:17:56,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:17:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:57,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:17:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:57,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:57,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:17:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:57,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 03:17:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:57,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:57,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 03:17:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:57,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:17:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:57,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 03:17:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:17:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:57,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:17:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:57,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 03:17:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:57,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 03:17:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:57,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 03:17:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-28 03:17:57,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:17:57,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016077076] [2021-12-28 03:17:57,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016077076] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:17:57,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:17:57,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-28 03:17:57,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373604810] [2021-12-28 03:17:57,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:17:57,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-28 03:17:57,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:17:57,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-28 03:17:57,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2021-12-28 03:17:57,343 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-28 03:17:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:17:57,779 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2021-12-28 03:17:57,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 03:17:57,779 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2021-12-28 03:17:57,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:17:57,782 INFO L225 Difference]: With dead ends: 94 [2021-12-28 03:17:57,782 INFO L226 Difference]: Without dead ends: 92 [2021-12-28 03:17:57,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2021-12-28 03:17:57,785 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 58 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:17:57,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 570 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:17:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-28 03:17:57,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2021-12-28 03:17:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-28 03:17:57,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2021-12-28 03:17:57,803 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2021-12-28 03:17:57,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:17:57,804 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2021-12-28 03:17:57,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-28 03:17:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2021-12-28 03:17:57,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-28 03:17:57,810 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:17:57,810 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:17:57,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 03:17:57,810 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:17:57,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:17:57,811 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2021-12-28 03:17:57,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:17:57,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141044213] [2021-12-28 03:17:57,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:17:57,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:17:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:17:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:17:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 03:17:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 03:17:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:17:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 03:17:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:17:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:17:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 03:17:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 03:17:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 03:17:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 03:17:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-28 03:17:58,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:17:58,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141044213] [2021-12-28 03:17:58,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141044213] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:17:58,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:17:58,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-28 03:17:58,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033199301] [2021-12-28 03:17:58,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:17:58,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 03:17:58,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:17:58,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 03:17:58,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:17:58,248 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-28 03:17:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:17:58,648 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2021-12-28 03:17:58,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 03:17:58,648 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 83 [2021-12-28 03:17:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:17:58,652 INFO L225 Difference]: With dead ends: 98 [2021-12-28 03:17:58,652 INFO L226 Difference]: Without dead ends: 96 [2021-12-28 03:17:58,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:17:58,654 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:17:58,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 466 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:17:58,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-28 03:17:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-12-28 03:17:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 55 states have internal predecessors, (55), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-28 03:17:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2021-12-28 03:17:58,676 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2021-12-28 03:17:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:17:58,677 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2021-12-28 03:17:58,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-28 03:17:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2021-12-28 03:17:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-28 03:17:58,679 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:17:58,679 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:17:58,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 03:17:58,679 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:17:58,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:17:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2021-12-28 03:17:58,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:17:58,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817394164] [2021-12-28 03:17:58,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:17:58,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:17:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:17:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:17:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 03:17:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 03:17:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:17:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-28 03:17:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:17:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 03:17:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 03:17:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 03:17:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 03:17:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 03:17:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-28 03:17:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:58,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 03:17:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 03:17:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-12-28 03:17:59,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:17:59,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817394164] [2021-12-28 03:17:59,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817394164] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:17:59,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:17:59,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-28 03:17:59,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520954222] [2021-12-28 03:17:59,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:17:59,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-28 03:17:59,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:17:59,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-28 03:17:59,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-12-28 03:17:59,033 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-28 03:17:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:17:59,396 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2021-12-28 03:17:59,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 03:17:59,397 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 107 [2021-12-28 03:17:59,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:17:59,398 INFO L225 Difference]: With dead ends: 102 [2021-12-28 03:17:59,398 INFO L226 Difference]: Without dead ends: 100 [2021-12-28 03:17:59,398 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-12-28 03:17:59,399 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 31 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:17:59,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 856 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:17:59,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-28 03:17:59,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-12-28 03:17:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 58 states have internal predecessors, (58), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-28 03:17:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2021-12-28 03:17:59,405 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2021-12-28 03:17:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:17:59,405 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2021-12-28 03:17:59,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-28 03:17:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2021-12-28 03:17:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-28 03:17:59,406 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:17:59,407 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:17:59,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 03:17:59,407 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:17:59,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:17:59,407 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2021-12-28 03:17:59,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:17:59,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976778139] [2021-12-28 03:17:59,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:17:59,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:17:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:17:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:17:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 03:17:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 03:17:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:17:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-28 03:17:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:17:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 03:17:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:17:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 03:17:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 03:17:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 03:17:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 03:17:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-28 03:17:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 03:17:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 03:17:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 03:17:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:17:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-28 03:17:59,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:17:59,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976778139] [2021-12-28 03:17:59,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976778139] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:17:59,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:17:59,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-28 03:17:59,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371870099] [2021-12-28 03:17:59,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:17:59,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-28 03:17:59,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:17:59,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-28 03:17:59,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-12-28 03:17:59,861 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-28 03:18:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:18:00,139 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2021-12-28 03:18:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 03:18:00,139 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2021-12-28 03:18:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:18:00,141 INFO L225 Difference]: With dead ends: 100 [2021-12-28 03:18:00,141 INFO L226 Difference]: Without dead ends: 96 [2021-12-28 03:18:00,141 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-12-28 03:18:00,142 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 45 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:18:00,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 418 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:18:00,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-28 03:18:00,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-12-28 03:18:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-28 03:18:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-12-28 03:18:00,146 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2021-12-28 03:18:00,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:18:00,146 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-12-28 03:18:00,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-28 03:18:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-12-28 03:18:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-28 03:18:00,147 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:18:00,147 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:18:00,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 03:18:00,147 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:18:00,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:18:00,148 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2021-12-28 03:18:00,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:18:00,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122559652] [2021-12-28 03:18:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:18:00,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:18:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:18:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:18:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:18:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 03:18:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:18:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 03:18:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:18:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 03:18:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 03:18:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:18:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 03:18:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 03:18:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 03:18:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 03:18:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 03:18:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 03:18:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 03:18:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-28 03:18:00,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:18:00,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122559652] [2021-12-28 03:18:00,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122559652] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:18:00,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:18:00,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-28 03:18:00,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306569361] [2021-12-28 03:18:00,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:18:00,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-28 03:18:00,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:18:00,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-28 03:18:00,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-12-28 03:18:00,603 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) [2021-12-28 03:18:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:18:00,960 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2021-12-28 03:18:00,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 03:18:00,961 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) Word has length 100 [2021-12-28 03:18:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:18:00,962 INFO L225 Difference]: With dead ends: 102 [2021-12-28 03:18:00,962 INFO L226 Difference]: Without dead ends: 71 [2021-12-28 03:18:00,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-12-28 03:18:00,963 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 55 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:18:00,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 507 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:18:00,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-28 03:18:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-28 03:18:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0) internal successors, (43), 43 states have internal predecessors, (43), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-28 03:18:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-28 03:18:00,966 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2021-12-28 03:18:00,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:18:00,967 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-28 03:18:00,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) [2021-12-28 03:18:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-28 03:18:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-28 03:18:00,967 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:18:00,968 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:18:00,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 03:18:00,968 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:18:00,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:18:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2021-12-28 03:18:00,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:18:00,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938615701] [2021-12-28 03:18:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:18:00,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:18:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 03:18:01,100 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 03:18:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 03:18:01,257 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 03:18:01,257 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 03:18:01,258 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 03:18:01,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 03:18:01,261 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:18:01,262 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 03:18:01,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:18:01 BoogieIcfgContainer [2021-12-28 03:18:01,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 03:18:01,319 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 03:18:01,319 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 03:18:01,319 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 03:18:01,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:17:55" (3/4) ... [2021-12-28 03:18:01,321 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-28 03:18:01,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 03:18:01,322 INFO L158 Benchmark]: Toolchain (without parser) took 8999.49ms. Allocated memory was 56.6MB in the beginning and 268.4MB in the end (delta: 211.8MB). Free memory was 36.8MB in the beginning and 71.9MB in the end (delta: -35.1MB). Peak memory consumption was 176.2MB. Max. memory is 16.1GB. [2021-12-28 03:18:01,322 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 03:18:01,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2370.51ms. Allocated memory was 56.6MB in the beginning and 130.0MB in the end (delta: 73.4MB). Free memory was 36.7MB in the beginning and 66.8MB in the end (delta: -30.1MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2021-12-28 03:18:01,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 130.87ms. Allocated memory is still 130.0MB. Free memory was 66.8MB in the beginning and 56.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-28 03:18:01,323 INFO L158 Benchmark]: Boogie Preprocessor took 38.71ms. Allocated memory is still 130.0MB. Free memory was 56.3MB in the beginning and 52.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 03:18:01,323 INFO L158 Benchmark]: RCFGBuilder took 516.66ms. Allocated memory is still 130.0MB. Free memory was 52.1MB in the beginning and 56.1MB in the end (delta: -4.0MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2021-12-28 03:18:01,323 INFO L158 Benchmark]: TraceAbstraction took 5934.97ms. Allocated memory was 130.0MB in the beginning and 268.4MB in the end (delta: 138.4MB). Free memory was 55.5MB in the beginning and 73.0MB in the end (delta: -17.5MB). Peak memory consumption was 121.9MB. Max. memory is 16.1GB. [2021-12-28 03:18:01,324 INFO L158 Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 268.4MB. Free memory was 73.0MB in the beginning and 71.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 03:18:01,325 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 56.6MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2370.51ms. Allocated memory was 56.6MB in the beginning and 130.0MB in the end (delta: 73.4MB). Free memory was 36.7MB in the beginning and 66.8MB in the end (delta: -30.1MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 130.87ms. Allocated memory is still 130.0MB. Free memory was 66.8MB in the beginning and 56.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.71ms. Allocated memory is still 130.0MB. Free memory was 56.3MB in the beginning and 52.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 516.66ms. Allocated memory is still 130.0MB. Free memory was 52.1MB in the beginning and 56.1MB in the end (delta: -4.0MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5934.97ms. Allocated memory was 130.0MB in the beginning and 268.4MB in the end (delta: 138.4MB). Free memory was 55.5MB in the beginning and 73.0MB in the end (delta: -17.5MB). Peak memory consumption was 121.9MB. Max. memory is 16.1GB. * Witness Printer took 2.52ms. Allocated memory is still 268.4MB. Free memory was 73.0MB in the beginning and 71.9MB 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={5:0}, s_tolower_table={6:0}] [L11328] CALL aws_hash_callback_c_str_eq_harness() [L11318] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=-36893488147419103231, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, size=1] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={-2:0}, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={-2:0}, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}] [L11318] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-2:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11318] const char *str1 = ensure_c_str_is_allocated(64); [L11319] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L261] return __VERIFIER_nondet_bool(); [L11319] RET, EXPR nondet_bool() VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={-2:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={-2:0}] [L11319] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=-18446744073709551615, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, size=1] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={-3:0}, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={-3:0}, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}] [L11319] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-3:0}, nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={-2:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-3:0}, nondet_bool()=0, nondet_bool() ? str1 : ensure_c_str_is_allocated(64)={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={-2:0}] [L11319] const char *str2 = nondet_bool() ? str1 : ensure_c_str_is_allocated(64); [L11322] CALL, EXPR aws_hash_callback_c_str_eq(str1, str2) [L10794] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}, str={-2:0}] [L10794] RET, EXPR aws_c_string_is_valid(a) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10794] CALL assume_abort_if_not((aws_c_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10794] RET assume_abort_if_not((aws_c_string_is_valid(a))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}, str={-3:0}] [L10795] RET, EXPR aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] CALL assume_abort_if_not((aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] RET assume_abort_if_not((aws_c_string_is_valid(b))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10797-L10798] _Bool rval = !strcmp(a, b); [L10799] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}, str={-2:0}] [L10799] RET, EXPR aws_c_string_is_valid(a) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}, str={-3:0}] [L10799] RET, EXPR aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] CALL __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] RET __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] return rval; VAL [\result=1, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11322] RET, EXPR aws_hash_callback_c_str_eq(str1, str2) [L11321-L11322] _Bool rval = aws_hash_callback_c_str_eq(str1, str2); [L11323] COND TRUE \read(rval) [L11324] size_t len = strlen(str1); [L11325] CALL assert_bytes_match(str1, str2, len) [L7113] CALL __VERIFIER_assert(!a == !b) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7113] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=258, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7114-L7117] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=258, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7119] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L7119] RET, EXPR nondet_uint64_t() VAL [\old(len)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=258, nondet_uint64_t()=18446744073709551873, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7119] size_t i = nondet_uint64_t(); [L7120-L7122] CALL assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7120-L7122] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, i=257, len=258, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=258, a={-2:0}, a={-2:0}, a[i]=-255, b={-3:0}, b={-3:0}, b[i]=0, i=257, len=258, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 3362 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2847 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3218 IncrementalHoareTripleChecker+Invalid, 3477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 515 mSDtfsCounter, 3218 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.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1728 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 597/597 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-28 03:18:01,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 03:18:02,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 03:18:02,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 03:18:02,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 03:18:02,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 03:18:02,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 03:18:02,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 03:18:02,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 03:18:02,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 03:18:02,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 03:18:02,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 03:18:02,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 03:18:02,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 03:18:02,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 03:18:02,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 03:18:02,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 03:18:02,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 03:18:02,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 03:18:02,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 03:18:02,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 03:18:02,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 03:18:02,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 03:18:02,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 03:18:02,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 03:18:02,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 03:18:02,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 03:18:02,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 03:18:02,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 03:18:02,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 03:18:02,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 03:18:02,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 03:18:02,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 03:18:02,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 03:18:02,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 03:18:02,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 03:18:02,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 03:18:03,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 03:18:03,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 03:18:03,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 03:18:03,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 03:18:03,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 03:18:03,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-12-28 03:18:03,030 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 03:18:03,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 03:18:03,032 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 03:18:03,032 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 03:18:03,033 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 03:18:03,033 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 03:18:03,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 03:18:03,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 03:18:03,034 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 03:18:03,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 03:18:03,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 03:18:03,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 03:18:03,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 03:18:03,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 03:18:03,036 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 03:18:03,036 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-28 03:18:03,036 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-28 03:18:03,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 03:18:03,036 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 03:18:03,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 03:18:03,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 03:18:03,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 03:18:03,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 03:18:03,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:18:03,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 03:18:03,037 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 03:18:03,037 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 03:18:03,037 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-28 03:18:03,038 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-28 03:18:03,038 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 03:18:03,038 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 03:18:03,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 03:18:03,038 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-28 03:18:03,038 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 [2021-12-28 03:18:03,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 03:18:03,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 03:18:03,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 03:18:03,339 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 03:18:03,339 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 03:18:03,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-28 03:18:03,380 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168250767/1f3c5a0535be428aa462940da37145f7/FLAG580000d32 [2021-12-28 03:18:03,972 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 03:18:03,973 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-28 03:18:04,002 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168250767/1f3c5a0535be428aa462940da37145f7/FLAG580000d32 [2021-12-28 03:18:04,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168250767/1f3c5a0535be428aa462940da37145f7 [2021-12-28 03:18:04,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 03:18:04,415 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 03:18:04,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 03:18:04,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 03:18:04,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 03:18:04,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:18:04" (1/1) ... [2021-12-28 03:18:04,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b9189c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:04, skipping insertion in model container [2021-12-28 03:18:04,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:18:04" (1/1) ... [2021-12-28 03:18:04,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 03:18:04,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 03:18:04,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-28 03:18:04,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-28 03:18:05,471 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:05,472 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:05,472 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:05,472 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:05,473 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:05,487 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:05,487 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:05,488 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:05,489 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:05,832 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-28 03:18:05,834 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-28 03:18:05,835 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-28 03:18:05,836 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-28 03:18:05,838 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-28 03:18:05,840 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-28 03:18:05,840 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-28 03:18:05,842 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-28 03:18:05,843 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-28 03:18:05,844 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-28 03:18:05,979 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-28 03:18:06,049 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,050 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,256 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,257 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,275 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,276 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,283 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,283 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,296 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,297 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,298 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,299 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,299 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,299 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,300 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:18:06,392 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-28 03:18:06,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 03:18:06,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-28 03:18:06,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-28 03:18:06,470 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,470 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,470 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,470 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,471 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,474 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,474 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,474 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,475 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,498 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-28 03:18:06,499 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-28 03:18:06,499 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-28 03:18:06,512 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-28 03:18:06,513 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-28 03:18:06,514 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-28 03:18:06,514 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-28 03:18:06,514 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-28 03:18:06,515 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-28 03:18:06,515 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-28 03:18:06,525 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-28 03:18:06,557 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,559 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,618 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,618 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,622 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,622 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,623 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,624 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,628 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,629 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,629 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,629 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,630 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,630 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,630 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,653 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:18:06,718 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 03:18:06,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-28 03:18:06,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-28 03:18:06,762 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,763 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,763 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,763 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,764 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,766 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,767 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,767 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,768 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,786 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-28 03:18:06,787 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-28 03:18:06,788 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-28 03:18:06,788 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-28 03:18:06,789 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-28 03:18:06,789 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-28 03:18:06,789 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-28 03:18:06,790 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-28 03:18:06,790 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-28 03:18:06,791 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-28 03:18:06,801 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-28 03:18:06,854 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,854 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,892 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,893 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,897 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,897 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,899 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,899 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,910 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,911 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,911 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,911 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,911 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,912 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,912 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:18:06,928 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:18:07,105 INFO L208 MainTranslator]: Completed translation [2021-12-28 03:18:07,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:07 WrapperNode [2021-12-28 03:18:07,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 03:18:07,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 03:18:07,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 03:18:07,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 03:18:07,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:07" (1/1) ... [2021-12-28 03:18:07,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:07" (1/1) ... [2021-12-28 03:18:07,287 INFO L137 Inliner]: procedures = 788, calls = 3253, calls flagged for inlining = 80, calls inlined = 5, statements flattened = 338 [2021-12-28 03:18:07,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 03:18:07,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 03:18:07,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 03:18:07,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 03:18:07,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:07" (1/1) ... [2021-12-28 03:18:07,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:07" (1/1) ... [2021-12-28 03:18:07,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:07" (1/1) ... [2021-12-28 03:18:07,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:07" (1/1) ... [2021-12-28 03:18:07,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:07" (1/1) ... [2021-12-28 03:18:07,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:07" (1/1) ... [2021-12-28 03:18:07,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:07" (1/1) ... [2021-12-28 03:18:07,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 03:18:07,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 03:18:07,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 03:18:07,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 03:18:07,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:07" (1/1) ... [2021-12-28 03:18:07,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:18:07,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:18:07,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 03:18:07,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 03:18:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-28 03:18:07,402 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-28 03:18:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-28 03:18:07,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-28 03:18:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 03:18:07,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 03:18:07,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 03:18:07,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 03:18:07,406 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-28 03:18:07,406 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-28 03:18:07,407 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-28 03:18:07,407 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-28 03:18:07,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-28 03:18:07,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-28 03:18:07,411 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-28 03:18:07,411 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-28 03:18:07,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 03:18:07,411 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2021-12-28 03:18:07,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2021-12-28 03:18:07,411 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2021-12-28 03:18:07,411 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2021-12-28 03:18:07,559 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 03:18:07,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 03:18:07,810 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2021-12-28 03:18:07,818 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 03:18:07,822 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 03:18:07,823 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-28 03:18:07,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:18:07 BoogieIcfgContainer [2021-12-28 03:18:07,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 03:18:07,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 03:18:07,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 03:18:07,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 03:18:07,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:18:04" (1/3) ... [2021-12-28 03:18:07,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d259cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:18:07, skipping insertion in model container [2021-12-28 03:18:07,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:07" (2/3) ... [2021-12-28 03:18:07,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d259cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:18:07, skipping insertion in model container [2021-12-28 03:18:07,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:18:07" (3/3) ... [2021-12-28 03:18:07,830 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2021-12-28 03:18:07,833 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 03:18:07,834 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 03:18:07,863 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 03:18:07,867 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 03:18:07,867 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 03:18:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-28 03:18:07,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-28 03:18:07,886 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:18:07,887 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:18:07,887 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:18:07,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:18:07,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2021-12-28 03:18:07,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 03:18:07,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843989174] [2021-12-28 03:18:07,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:18:07,906 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 03:18:07,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 03:18:07,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 03:18:07,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-28 03:18:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:08,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-28 03:18:08,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:18:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-28 03:18:08,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:18:08,347 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 03:18:08,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843989174] [2021-12-28 03:18:08,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843989174] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:18:08,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:18:08,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 03:18:08,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487789002] [2021-12-28 03:18:08,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:18:08,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-28 03:18:08,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 03:18:08,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-28 03:18:08,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 03:18:08,370 INFO L87 Difference]: Start difference. First operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-28 03:18:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:18:08,386 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2021-12-28 03:18:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-28 03:18:08,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 67 [2021-12-28 03:18:08,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:18:08,393 INFO L225 Difference]: With dead ends: 139 [2021-12-28 03:18:08,393 INFO L226 Difference]: Without dead ends: 65 [2021-12-28 03:18:08,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 03:18:08,397 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:18:08,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:18:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-28 03:18:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-28 03:18:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-28 03:18:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2021-12-28 03:18:08,423 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2021-12-28 03:18:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:18:08,424 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2021-12-28 03:18:08,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-28 03:18:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2021-12-28 03:18:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-28 03:18:08,426 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:18:08,426 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:18:08,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-28 03:18:08,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 03:18:08,641 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:18:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:18:08,642 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2021-12-28 03:18:08,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 03:18:08,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542664740] [2021-12-28 03:18:08,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:18:08,643 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 03:18:08,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 03:18:08,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 03:18:08,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-28 03:18:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:08,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-28 03:18:08,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:18:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-28 03:18:09,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:18:09,099 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 03:18:09,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542664740] [2021-12-28 03:18:09,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542664740] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:18:09,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:18:09,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 03:18:09,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850040140] [2021-12-28 03:18:09,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:18:09,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 03:18:09,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 03:18:09,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 03:18:09,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:18:09,102 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-28 03:18:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:18:09,280 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2021-12-28 03:18:09,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 03:18:09,281 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 70 [2021-12-28 03:18:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:18:09,282 INFO L225 Difference]: With dead ends: 89 [2021-12-28 03:18:09,282 INFO L226 Difference]: Without dead ends: 65 [2021-12-28 03:18:09,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-12-28 03:18:09,283 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:18:09,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 663 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:18:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-28 03:18:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-28 03:18:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-28 03:18:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2021-12-28 03:18:09,290 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2021-12-28 03:18:09,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:18:09,291 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2021-12-28 03:18:09,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-28 03:18:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2021-12-28 03:18:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-28 03:18:09,292 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:18:09,292 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:18:09,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-28 03:18:09,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 03:18:09,504 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:18:09,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:18:09,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2021-12-28 03:18:09,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 03:18:09,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447420102] [2021-12-28 03:18:09,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:18:09,506 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 03:18:09,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 03:18:09,507 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 03:18:09,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-28 03:18:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:09,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-28 03:18:09,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:18:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-28 03:18:09,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:18:09,958 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 03:18:09,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447420102] [2021-12-28 03:18:09,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447420102] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:18:09,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:18:09,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-28 03:18:09,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689586976] [2021-12-28 03:18:09,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:18:09,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-28 03:18:09,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 03:18:09,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-28 03:18:09,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-12-28 03:18:09,960 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-28 03:18:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:18:10,276 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2021-12-28 03:18:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 03:18:10,279 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2021-12-28 03:18:10,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:18:10,281 INFO L225 Difference]: With dead ends: 94 [2021-12-28 03:18:10,281 INFO L226 Difference]: Without dead ends: 92 [2021-12-28 03:18:10,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-12-28 03:18:10,282 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 38 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:18:10,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 914 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:18:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-28 03:18:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2021-12-28 03:18:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-28 03:18:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2021-12-28 03:18:10,296 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2021-12-28 03:18:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:18:10,297 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2021-12-28 03:18:10,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-28 03:18:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2021-12-28 03:18:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-28 03:18:10,302 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:18:10,302 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:18:10,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-28 03:18:10,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 03:18:10,514 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:18:10,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:18:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2021-12-28 03:18:10,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 03:18:10,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676022912] [2021-12-28 03:18:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:18:10,516 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 03:18:10,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 03:18:10,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 03:18:10,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-28 03:18:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:10,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-28 03:18:10,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:18:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-28 03:18:11,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:18:11,023 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 03:18:11,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676022912] [2021-12-28 03:18:11,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676022912] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:18:11,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:18:11,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 03:18:11,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113838548] [2021-12-28 03:18:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:18:11,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 03:18:11,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 03:18:11,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 03:18:11,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-28 03:18:11,026 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-28 03:18:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:18:11,237 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2021-12-28 03:18:11,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 03:18:11,238 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 83 [2021-12-28 03:18:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:18:11,241 INFO L225 Difference]: With dead ends: 98 [2021-12-28 03:18:11,241 INFO L226 Difference]: Without dead ends: 96 [2021-12-28 03:18:11,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-12-28 03:18:11,242 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:18:11,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 854 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:18:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-28 03:18:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-12-28 03:18:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 55 states have internal predecessors, (55), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-28 03:18:11,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2021-12-28 03:18:11,254 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2021-12-28 03:18:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:18:11,255 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2021-12-28 03:18:11,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-28 03:18:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2021-12-28 03:18:11,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-28 03:18:11,256 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:18:11,256 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:18:11,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-28 03:18:11,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 03:18:11,469 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:18:11,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:18:11,469 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2021-12-28 03:18:11,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 03:18:11,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631334519] [2021-12-28 03:18:11,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:18:11,471 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 03:18:11,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 03:18:11,471 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 03:18:11,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-28 03:18:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:11,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 03:18:11,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:18:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-12-28 03:18:11,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:18:11,946 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 03:18:11,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631334519] [2021-12-28 03:18:11,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631334519] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:18:11,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:18:11,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-28 03:18:11,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31538937] [2021-12-28 03:18:11,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:18:11,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 03:18:11,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 03:18:11,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 03:18:11,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:18:11,947 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-28 03:18:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:18:12,175 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2021-12-28 03:18:12,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 03:18:12,175 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 107 [2021-12-28 03:18:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:18:12,176 INFO L225 Difference]: With dead ends: 102 [2021-12-28 03:18:12,176 INFO L226 Difference]: Without dead ends: 100 [2021-12-28 03:18:12,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:18:12,177 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 14 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:18:12,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1199 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:18:12,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-28 03:18:12,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-12-28 03:18:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 58 states have internal predecessors, (58), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-28 03:18:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2021-12-28 03:18:12,185 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2021-12-28 03:18:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:18:12,185 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2021-12-28 03:18:12,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-28 03:18:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2021-12-28 03:18:12,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-28 03:18:12,186 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:18:12,186 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:18:12,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-28 03:18:12,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 03:18:12,387 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:18:12,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:18:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2021-12-28 03:18:12,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 03:18:12,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618513464] [2021-12-28 03:18:12,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:18:12,388 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 03:18:12,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 03:18:12,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 03:18:12,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-28 03:18:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:12,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-28 03:18:12,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:18:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-28 03:18:12,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:18:12,892 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 03:18:12,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618513464] [2021-12-28 03:18:12,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618513464] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:18:12,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:18:12,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-28 03:18:12,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914541280] [2021-12-28 03:18:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:18:12,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 03:18:12,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 03:18:12,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 03:18:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:18:12,894 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-28 03:18:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:18:13,101 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2021-12-28 03:18:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 03:18:13,104 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2021-12-28 03:18:13,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:18:13,106 INFO L225 Difference]: With dead ends: 100 [2021-12-28 03:18:13,106 INFO L226 Difference]: Without dead ends: 96 [2021-12-28 03:18:13,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-12-28 03:18:13,107 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 26 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:18:13,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 752 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:18:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-28 03:18:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-12-28 03:18:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-28 03:18:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-12-28 03:18:13,118 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2021-12-28 03:18:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:18:13,119 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-12-28 03:18:13,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-28 03:18:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-12-28 03:18:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-28 03:18:13,120 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:18:13,120 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:18:13,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-28 03:18:13,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 03:18:13,338 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:18:13,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:18:13,338 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2021-12-28 03:18:13,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 03:18:13,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170888170] [2021-12-28 03:18:13,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:18:13,339 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 03:18:13,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 03:18:13,340 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 03:18:13,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-28 03:18:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:18:13,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-28 03:18:13,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:18:13,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-28 03:18:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-28 03:18:13,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:18:13,789 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 03:18:13,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170888170] [2021-12-28 03:18:13,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170888170] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:18:13,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:18:13,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 03:18:13,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36104457] [2021-12-28 03:18:13,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:18:13,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 03:18:13,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 03:18:13,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 03:18:13,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 03:18:13,790 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-28 03:18:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:18:13,940 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2021-12-28 03:18:13,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 03:18:13,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 100 [2021-12-28 03:18:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:18:13,942 INFO L225 Difference]: With dead ends: 102 [2021-12-28 03:18:13,942 INFO L226 Difference]: Without dead ends: 71 [2021-12-28 03:18:13,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-28 03:18:13,943 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:18:13,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 547 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:18:13,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-28 03:18:13,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-28 03:18:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0) internal successors, (43), 43 states have internal predecessors, (43), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-28 03:18:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-28 03:18:13,950 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2021-12-28 03:18:13,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:18:13,950 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-28 03:18:13,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-28 03:18:13,951 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-28 03:18:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-28 03:18:13,951 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:18:13,952 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:18:13,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-28 03:18:14,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 03:18:14,161 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:18:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:18:14,162 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2021-12-28 03:18:14,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 03:18:14,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947561336] [2021-12-28 03:18:14,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:18:14,163 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 03:18:14,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 03:18:14,164 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 03:18:14,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-28 03:18:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 03:18:14,690 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 03:18:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 03:18:15,275 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-28 03:18:15,275 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 03:18:15,276 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 03:18:15,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-28 03:18:15,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 03:18:15,497 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:18:15,499 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 03:18:15,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:18:15 BoogieIcfgContainer [2021-12-28 03:18:15,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 03:18:15,548 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 03:18:15,548 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 03:18:15,548 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 03:18:15,548 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:18:07" (3/4) ... [2021-12-28 03:18:15,550 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-28 03:18:15,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 03:18:15,551 INFO L158 Benchmark]: Toolchain (without parser) took 11135.83ms. Allocated memory was 60.8MB in the beginning and 314.6MB in the end (delta: 253.8MB). Free memory was 28.9MB in the beginning and 172.7MB in the end (delta: -143.8MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. [2021-12-28 03:18:15,551 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 60.8MB. Free memory was 43.6MB in the beginning and 43.6MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 03:18:15,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2690.10ms. Allocated memory was 60.8MB in the beginning and 157.3MB in the end (delta: 96.5MB). Free memory was 28.6MB in the beginning and 63.9MB in the end (delta: -35.3MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2021-12-28 03:18:15,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 180.81ms. Allocated memory is still 157.3MB. Free memory was 63.9MB in the beginning and 92.8MB in the end (delta: -28.9MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2021-12-28 03:18:15,552 INFO L158 Benchmark]: Boogie Preprocessor took 52.55ms. Allocated memory is still 157.3MB. Free memory was 92.8MB in the beginning and 87.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 03:18:15,552 INFO L158 Benchmark]: RCFGBuilder took 483.59ms. Allocated memory is still 157.3MB. Free memory was 87.5MB in the beginning and 51.9MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-12-28 03:18:15,552 INFO L158 Benchmark]: TraceAbstraction took 7721.35ms. Allocated memory was 157.3MB in the beginning and 314.6MB in the end (delta: 157.3MB). Free memory was 51.9MB in the beginning and 173.7MB in the end (delta: -121.9MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2021-12-28 03:18:15,552 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 314.6MB. Free memory was 173.7MB in the beginning and 172.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 03:18:15,553 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.12ms. Allocated memory is still 60.8MB. Free memory was 43.6MB in the beginning and 43.6MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2690.10ms. Allocated memory was 60.8MB in the beginning and 157.3MB in the end (delta: 96.5MB). Free memory was 28.6MB in the beginning and 63.9MB in the end (delta: -35.3MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 180.81ms. Allocated memory is still 157.3MB. Free memory was 63.9MB in the beginning and 92.8MB in the end (delta: -28.9MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.55ms. Allocated memory is still 157.3MB. Free memory was 92.8MB in the beginning and 87.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 483.59ms. Allocated memory is still 157.3MB. Free memory was 87.5MB in the beginning and 51.9MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7721.35ms. Allocated memory was 157.3MB in the beginning and 314.6MB in the end (delta: 157.3MB). Free memory was 51.9MB in the beginning and 173.7MB in the end (delta: -121.9MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 314.6MB. Free memory was 173.7MB in the beginning and 172.7MB 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={5:0}, s_tolower_table={6:0}] [L11328] CALL aws_hash_callback_c_str_eq_harness() [L11318] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, size=64] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={14:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={14:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}] [L11318] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={14:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11318] const char *str1 = ensure_c_str_is_allocated(64); [L11319] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L261] return __VERIFIER_nondet_bool(); [L11319] RET, EXPR nondet_bool() VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, size=64] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={9:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={9:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}] [L11319] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={9:0}, nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={9:0}, nondet_bool()=0, nondet_bool() ? str1 : ensure_c_str_is_allocated(64)={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] const char *str2 = nondet_bool() ? str1 : ensure_c_str_is_allocated(64); [L11322] CALL, EXPR aws_hash_callback_c_str_eq(str1, str2) [L10794] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str={14:0}] [L10794] RET, EXPR aws_c_string_is_valid(a) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10794] CALL assume_abort_if_not((aws_c_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10794] RET assume_abort_if_not((aws_c_string_is_valid(a))) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str={9:0}] [L10795] RET, EXPR aws_c_string_is_valid(b) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] CALL assume_abort_if_not((aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] RET assume_abort_if_not((aws_c_string_is_valid(b))) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10797-L10798] _Bool rval = !strcmp(a, b); [L10799] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str={14:0}] [L10799] RET, EXPR aws_c_string_is_valid(a) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str={9:0}] [L10799] RET, EXPR aws_c_string_is_valid(b) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] CALL __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] RET __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] return rval; VAL [\result=1, a={14:0}, a={14:0}, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11322] RET, EXPR aws_hash_callback_c_str_eq(str1, str2) [L11321-L11322] _Bool rval = aws_hash_callback_c_str_eq(str1, str2); [L11323] COND TRUE \read(rval) [L11324] size_t len = strlen(str1); [L11325] CALL assert_bytes_match(str1, str2, len) [L7113] CALL __VERIFIER_assert(!a == !b) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7113] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7114-L7117] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7119] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L7119] RET, EXPR nondet_uint64_t() VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, len=1073741824, nondet_uint64_t()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7119] size_t i = nondet_uint64_t(); [L7120-L7122] CALL assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7120-L7122] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, i=0, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=1073741824, a={14:0}, a={14:0}, a[i]=48, b={9:0}, b={9:0}, b[i]=-80, i=0, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 5015 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4468 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 958 IncrementalHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 547 mSDtfsCounter, 958 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 636 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1351 SizeOfPredicates, 55 NumberOfNonLiveVariables, 3221 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 597/597 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-28 03:18:15,582 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample