./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_hash_iter_delete_harness.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/aws-c-common/aws_hash_iter_delete_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 --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 7608d8aa64807891206ad38b93db31434f261f46ffbbb3a8b8a4940e4ab5ce81 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:37:13,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:37:13,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:37:13,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:37:13,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:37:13,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:37:13,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:37:13,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:37:13,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:37:13,792 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:37:13,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:37:13,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:37:13,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:37:13,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:37:13,794 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:37:13,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:37:13,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:37:13,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:37:13,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:37:13,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:37:13,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:37:13,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:37:13,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:37:13,796 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:37:13,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:37:13,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:37:13,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:37:13,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:37:13,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:37:13,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:37:13,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:37:13,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:37:13,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:37:13,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:37:13,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:37:13,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:37:13,800 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:37:13,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:37:13,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:37:13,800 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> 7608d8aa64807891206ad38b93db31434f261f46ffbbb3a8b8a4940e4ab5ce81 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:37:14,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:37:14,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:37:14,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:37:14,053 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:37:14,053 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:37:14,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_hash_iter_delete_harness.i [2023-11-23 08:37:15,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:37:15,919 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:37:15,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_iter_delete_harness.i [2023-11-23 08:37:15,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/344cf8fa7/fb2a41fe293b403fb23679b0b2619d78/FLAG704583ca6 [2023-11-23 08:37:15,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/344cf8fa7/fb2a41fe293b403fb23679b0b2619d78 [2023-11-23 08:37:15,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:37:15,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:37:15,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:37:15,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:37:15,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:37:15,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:37:15" (1/1) ... [2023-11-23 08:37:15,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@189671cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:15, skipping insertion in model container [2023-11-23 08:37:15,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:37:15" (1/1) ... [2023-11-23 08:37:16,261 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:37:16,612 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_iter_delete_harness.i[4494,4507] [2023-11-23 08:37:16,621 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_iter_delete_harness.i[4554,4567] [2023-11-23 08:37:17,344 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:17,346 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:17,347 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:17,348 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:17,350 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:17,372 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:17,373 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:17,375 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:17,376 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:17,378 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:17,381 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:17,382 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:17,384 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:17,649 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:37:17,650 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:37:17,652 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:37:17,653 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:37:17,656 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:37:17,657 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:37:17,658 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:37:17,658 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:37:17,659 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:37:17,659 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:37:18,138 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,139 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,162 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,163 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,169 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,170 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,184 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,184 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,185 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,186 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,186 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,186 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,187 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:37:18,281 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:37:18,298 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_iter_delete_harness.i[4494,4507] [2023-11-23 08:37:18,300 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_iter_delete_harness.i[4554,4567] [2023-11-23 08:37:18,332 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,335 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,335 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,335 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,336 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,343 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,345 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,346 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,346 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,346 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,347 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,347 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,347 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,366 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:37:18,367 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:37:18,367 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:37:18,370 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:37:18,371 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:37:18,371 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:37:18,371 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:37:18,372 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:37:18,372 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:37:18,373 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:37:18,403 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7558-7569] [2023-11-23 08:37:18,464 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,465 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,469 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,471 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,473 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,473 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,482 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,482 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,482 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,483 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,483 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,483 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,483 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:18,498 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:37:18,795 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,795 WARN L675 CHandler]: The function equals_fn is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,795 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,795 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,796 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,796 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,796 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,796 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,796 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,796 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,796 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,796 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,796 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,797 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,797 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,797 WARN L675 CHandler]: The function callback is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,797 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,797 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:37:18,803 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:37:18,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:18 WrapperNode [2023-11-23 08:37:18,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:37:18,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:37:18,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:37:18,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:37:18,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:18" (1/1) ... [2023-11-23 08:37:18,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:18" (1/1) ... [2023-11-23 08:37:19,001 INFO L138 Inliner]: procedures = 772, calls = 2461, calls flagged for inlining = 66, calls inlined = 11, statements flattened = 749 [2023-11-23 08:37:19,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:37:19,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:37:19,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:37:19,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:37:19,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:18" (1/1) ... [2023-11-23 08:37:19,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:18" (1/1) ... [2023-11-23 08:37:19,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:18" (1/1) ... [2023-11-23 08:37:19,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:18" (1/1) ... [2023-11-23 08:37:19,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:18" (1/1) ... [2023-11-23 08:37:19,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:18" (1/1) ... [2023-11-23 08:37:19,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:18" (1/1) ... [2023-11-23 08:37:19,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:18" (1/1) ... [2023-11-23 08:37:19,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:37:19,102 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:37:19,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:37:19,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:37:19,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:18" (1/1) ... [2023-11-23 08:37:19,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:37:19,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:37:19,157 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) [2023-11-23 08:37:19,170 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 [2023-11-23 08:37:19,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-23 08:37:19,200 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 08:37:19,200 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 08:37:19,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 08:37:19,200 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2023-11-23 08:37:19,201 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2023-11-23 08:37:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:37:19,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:37:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2023-11-23 08:37:19,201 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2023-11-23 08:37:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:37:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:37:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:37:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:37:19,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:37:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 08:37:19,202 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 08:37:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2023-11-23 08:37:19,202 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2023-11-23 08:37:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-11-23 08:37:19,202 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-11-23 08:37:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:37:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2023-11-23 08:37:19,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2023-11-23 08:37:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:37:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:37:19,203 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:37:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 08:37:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2023-11-23 08:37:19,203 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2023-11-23 08:37:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:37:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2023-11-23 08:37:19,203 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2023-11-23 08:37:19,204 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-23 08:37:19,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-23 08:37:19,204 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:37:19,204 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:37:19,204 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_is_valid [2023-11-23 08:37:19,204 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_is_valid [2023-11-23 08:37:19,204 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2023-11-23 08:37:19,204 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2023-11-23 08:37:19,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:37:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2023-11-23 08:37:19,205 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2023-11-23 08:37:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2023-11-23 08:37:19,205 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2023-11-23 08:37:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure s_remove_entry [2023-11-23 08:37:19,205 INFO L138 BoogieDeclarations]: Found implementation of procedure s_remove_entry [2023-11-23 08:37:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_delete [2023-11-23 08:37:19,205 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_delete [2023-11-23 08:37:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:37:19,458 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:37:19,460 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:37:19,661 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2023-11-23 08:37:19,661 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !true; [2023-11-23 08:37:20,206 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:37:20,262 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:37:20,262 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2023-11-23 08:37:20,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:37:20 BoogieIcfgContainer [2023-11-23 08:37:20,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:37:20,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:37:20,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:37:20,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:37:20,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:37:15" (1/3) ... [2023-11-23 08:37:20,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185fee69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:37:20, skipping insertion in model container [2023-11-23 08:37:20,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:18" (2/3) ... [2023-11-23 08:37:20,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185fee69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:37:20, skipping insertion in model container [2023-11-23 08:37:20,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:37:20" (3/3) ... [2023-11-23 08:37:20,269 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_hash_iter_delete_harness.i [2023-11-23 08:37:20,281 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:37:20,282 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:37:20,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:37:20,320 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a032ec9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:37:20,320 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:37:20,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 197 states, 124 states have (on average 1.346774193548387) internal successors, (167), 123 states have internal predecessors, (167), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-23 08:37:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2023-11-23 08:37:20,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:37:20,350 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:37:20,351 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:37:20,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:37:20,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1756986890, now seen corresponding path program 1 times [2023-11-23 08:37:20,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:37:20,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059805786] [2023-11-23 08:37:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:37:20,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:37:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:20,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:37:20,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059805786] [2023-11-23 08:37:20,759 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-11-23 08:37:20,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614679100] [2023-11-23 08:37:20,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:37:20,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:37:20,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:37:20,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:37:20,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 08:37:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:21,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 08:37:21,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:37:21,305 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2023-11-23 08:37:21,306 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:37:21,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614679100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:37:21,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:37:21,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:37:21,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262485511] [2023-11-23 08:37:21,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:37:21,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:37:21,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:37:21,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:37:21,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:37:21,363 INFO L87 Difference]: Start difference. First operand has 197 states, 124 states have (on average 1.346774193548387) internal successors, (167), 123 states have internal predecessors, (167), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-23 08:37:21,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:37:21,475 INFO L93 Difference]: Finished difference Result 390 states and 585 transitions. [2023-11-23 08:37:21,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:37:21,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 191 [2023-11-23 08:37:21,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:37:21,488 INFO L225 Difference]: With dead ends: 390 [2023-11-23 08:37:21,489 INFO L226 Difference]: Without dead ends: 195 [2023-11-23 08:37:21,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:37:21,500 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:37:21,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:37:21,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-23 08:37:21,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2023-11-23 08:37:21,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 122 states have internal predecessors, (157), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-23 08:37:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2023-11-23 08:37:21,593 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 191 [2023-11-23 08:37:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:37:21,594 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2023-11-23 08:37:21,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-23 08:37:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2023-11-23 08:37:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2023-11-23 08:37:21,621 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:37:21,621 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:37:21,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 08:37:21,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-23 08:37:21,837 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:37:21,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:37:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash -758705024, now seen corresponding path program 1 times [2023-11-23 08:37:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:37:21,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142506141] [2023-11-23 08:37:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:37:21,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:37:21,966 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 08:37:21,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245144981] [2023-11-23 08:37:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:37:21,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:37:21,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:37:21,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:37:22,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 08:37:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:22,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 08:37:22,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:37:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2023-11-23 08:37:22,511 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:37:22,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:37:22,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142506141] [2023-11-23 08:37:22,512 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 08:37:22,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245144981] [2023-11-23 08:37:22,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245144981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:37:22,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:37:22,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 08:37:22,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496662500] [2023-11-23 08:37:22,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:37:22,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:37:22,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:37:22,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:37:22,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:37:22,515 INFO L87 Difference]: Start difference. First operand 195 states and 264 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-23 08:37:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:37:22,699 INFO L93 Difference]: Finished difference Result 359 states and 489 transitions. [2023-11-23 08:37:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:37:22,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 191 [2023-11-23 08:37:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:37:22,701 INFO L225 Difference]: With dead ends: 359 [2023-11-23 08:37:22,701 INFO L226 Difference]: Without dead ends: 199 [2023-11-23 08:37:22,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:37:22,703 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 1 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:37:22,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 976 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:37:22,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-11-23 08:37:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2023-11-23 08:37:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 124 states have (on average 1.2903225806451613) internal successors, (160), 125 states have internal predecessors, (160), 54 states have call successors, (54), 19 states have call predecessors, (54), 20 states have return successors, (54), 54 states have call predecessors, (54), 53 states have call successors, (54) [2023-11-23 08:37:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 268 transitions. [2023-11-23 08:37:22,714 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 268 transitions. Word has length 191 [2023-11-23 08:37:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:37:22,715 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 268 transitions. [2023-11-23 08:37:22,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-23 08:37:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 268 transitions. [2023-11-23 08:37:22,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2023-11-23 08:37:22,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:37:22,717 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:37:22,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 08:37:22,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-23 08:37:22,944 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:37:22,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:37:22,945 INFO L85 PathProgramCache]: Analyzing trace with hash 77721152, now seen corresponding path program 1 times [2023-11-23 08:37:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:37:22,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477941013] [2023-11-23 08:37:22,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:37:22,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:37:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:37:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:37:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:37:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 08:37:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:37:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:37:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:37:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:37:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:37:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:37:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:37:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:37:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:37:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:37:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 08:37:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-23 08:37:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 08:37:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:37:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:37:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:37:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:37:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-23 08:37:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-23 08:37:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-23 08:37:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-23 08:37:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-23 08:37:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-23 08:37:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-23 08:37:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-23 08:37:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-23 08:37:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-23 08:37:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-23 08:37:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-23 08:37:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2023-11-23 08:37:24,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:37:24,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477941013] [2023-11-23 08:37:24,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477941013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:37:24,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:37:24,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 08:37:24,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572168514] [2023-11-23 08:37:24,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:37:24,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 08:37:24,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:37:24,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 08:37:24,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:37:24,498 INFO L87 Difference]: Start difference. First operand 199 states and 268 transitions. Second operand has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2023-11-23 08:37:26,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:37:26,471 INFO L93 Difference]: Finished difference Result 363 states and 496 transitions. [2023-11-23 08:37:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 08:37:26,471 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 195 [2023-11-23 08:37:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:37:26,474 INFO L225 Difference]: With dead ends: 363 [2023-11-23 08:37:26,474 INFO L226 Difference]: Without dead ends: 215 [2023-11-23 08:37:26,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:37:26,475 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 207 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-23 08:37:26,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 507 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1834 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-23 08:37:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-23 08:37:26,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 203. [2023-11-23 08:37:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 129 states have internal predecessors, (164), 54 states have call successors, (54), 19 states have call predecessors, (54), 21 states have return successors, (55), 54 states have call predecessors, (55), 53 states have call successors, (55) [2023-11-23 08:37:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 273 transitions. [2023-11-23 08:37:26,498 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 273 transitions. Word has length 195 [2023-11-23 08:37:26,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:37:26,499 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 273 transitions. [2023-11-23 08:37:26,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2023-11-23 08:37:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 273 transitions. [2023-11-23 08:37:26,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2023-11-23 08:37:26,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:37:26,502 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:37:26,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 08:37:26,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:37:26,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:37:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash 147369026, now seen corresponding path program 1 times [2023-11-23 08:37:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:37:26,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270487502] [2023-11-23 08:37:26,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:37:26,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:37:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:26,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:37:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:26,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:37:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:26,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:37:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:26,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 08:37:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:26,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:37:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:26,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:37:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:26,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:37:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:26,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:37:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:26,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:37:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:26,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:37:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:26,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:37:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:26,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:37:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:37:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:37:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 08:37:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-23 08:37:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 08:37:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:37:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:37:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:37:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:37:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-23 08:37:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-23 08:37:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-23 08:37:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-23 08:37:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-23 08:37:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-23 08:37:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-23 08:37:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-23 08:37:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-23 08:37:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-23 08:37:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-23 08:37:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-23 08:37:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:27,195 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2023-11-23 08:37:27,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:37:27,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270487502] [2023-11-23 08:37:27,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270487502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:37:27,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:37:27,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 08:37:27,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930528485] [2023-11-23 08:37:27,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:37:27,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:37:27,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:37:27,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:37:27,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:37:27,197 INFO L87 Difference]: Start difference. First operand 203 states and 273 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2023-11-23 08:37:27,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:37:27,931 INFO L93 Difference]: Finished difference Result 368 states and 502 transitions. [2023-11-23 08:37:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:37:27,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 195 [2023-11-23 08:37:27,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:37:27,933 INFO L225 Difference]: With dead ends: 368 [2023-11-23 08:37:27,933 INFO L226 Difference]: Without dead ends: 216 [2023-11-23 08:37:27,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:37:27,934 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 353 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:37:27,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 231 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 08:37:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-23 08:37:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 205. [2023-11-23 08:37:27,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 128 states have (on average 1.2890625) internal successors, (165), 130 states have internal predecessors, (165), 55 states have call successors, (55), 19 states have call predecessors, (55), 21 states have return successors, (56), 55 states have call predecessors, (56), 54 states have call successors, (56) [2023-11-23 08:37:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 276 transitions. [2023-11-23 08:37:27,947 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 276 transitions. Word has length 195 [2023-11-23 08:37:27,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:37:27,947 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 276 transitions. [2023-11-23 08:37:27,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2023-11-23 08:37:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 276 transitions. [2023-11-23 08:37:27,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2023-11-23 08:37:27,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:37:27,949 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:37:27,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 08:37:27,950 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:37:27,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:37:27,950 INFO L85 PathProgramCache]: Analyzing trace with hash 73049905, now seen corresponding path program 1 times [2023-11-23 08:37:27,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:37:27,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716030410] [2023-11-23 08:37:27,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:37:27,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:37:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:37:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:37:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:37:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 08:37:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:37:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:37:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:37:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:37:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:37:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:37:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:37:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:37:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:37:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:37:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:37:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-23 08:37:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 08:37:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-23 08:37:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:37:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:37:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:37:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:37:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-23 08:37:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-23 08:37:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-23 08:37:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-23 08:37:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-23 08:37:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-23 08:37:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-23 08:37:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-23 08:37:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-23 08:37:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-23 08:37:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-11-23 08:37:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-23 08:37:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2023-11-23 08:37:28,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:37:28,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716030410] [2023-11-23 08:37:28,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716030410] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:37:28,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992690987] [2023-11-23 08:37:28,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:37:28,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:37:28,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:37:28,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:37:28,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 08:37:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:37:29,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 2536 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-23 08:37:29,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:37:29,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 08:37:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2023-11-23 08:37:29,570 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:37:29,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992690987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:37:29,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:37:29,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2023-11-23 08:37:29,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621326954] [2023-11-23 08:37:29,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:37:29,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 08:37:29,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:37:29,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 08:37:29,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:37:29,572 INFO L87 Difference]: Start difference. First operand 205 states and 276 transitions. Second operand has 12 states, 9 states have (on average 8.11111111111111) internal successors, (73), 10 states have internal predecessors, (73), 5 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (34), 5 states have call predecessors, (34), 5 states have call successors, (34) [2023-11-23 08:37:32,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2023-11-23 08:37:34,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:37:36,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:37:38,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:37:41,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:37:43,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:37:45,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:37:47,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:37:49,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:37:51,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:37:53,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:37:55,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:37:57,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:37:59,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:37:59,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:37:59,901 INFO L93 Difference]: Finished difference Result 424 states and 563 transitions. [2023-11-23 08:37:59,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 08:37:59,902 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 8.11111111111111) internal successors, (73), 10 states have internal predecessors, (73), 5 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (34), 5 states have call predecessors, (34), 5 states have call successors, (34) Word has length 201 [2023-11-23 08:37:59,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:37:59,903 INFO L225 Difference]: With dead ends: 424 [2023-11-23 08:37:59,903 INFO L226 Difference]: Without dead ends: 255 [2023-11-23 08:37:59,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2023-11-23 08:37:59,905 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 98 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 21 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:37:59,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1996 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 762 Invalid, 14 Unknown, 0 Unchecked, 30.2s Time] [2023-11-23 08:37:59,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-23 08:37:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 248. [2023-11-23 08:37:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 156 states have (on average 1.2564102564102564) internal successors, (196), 158 states have internal predecessors, (196), 62 states have call successors, (62), 27 states have call predecessors, (62), 29 states have return successors, (64), 62 states have call predecessors, (64), 61 states have call successors, (64) [2023-11-23 08:37:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 322 transitions. [2023-11-23 08:37:59,955 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 322 transitions. Word has length 201 [2023-11-23 08:37:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:37:59,955 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 322 transitions. [2023-11-23 08:37:59,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 8.11111111111111) internal successors, (73), 10 states have internal predecessors, (73), 5 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (34), 5 states have call predecessors, (34), 5 states have call successors, (34) [2023-11-23 08:37:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 322 transitions. [2023-11-23 08:37:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-11-23 08:37:59,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:37:59,957 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:37:59,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 08:38:00,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:38:00,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:38:00,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:38:00,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1244216693, now seen corresponding path program 1 times [2023-11-23 08:38:00,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:38:00,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936391333] [2023-11-23 08:38:00,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:38:00,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:38:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:38:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:38:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:38:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 08:38:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:38:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:38:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:38:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:38:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:38:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:38:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:38:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:38:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:38:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:38:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 08:38:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:38:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 08:38:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-23 08:38:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 08:38:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:38:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:38:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:38:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 08:38:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-23 08:38:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-23 08:38:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-23 08:38:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-23 08:38:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-23 08:38:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-23 08:38:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-23 08:38:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-23 08:38:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-23 08:38:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-11-23 08:38:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:00,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-23 08:38:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:01,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-23 08:38:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2023-11-23 08:38:01,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:38:01,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936391333] [2023-11-23 08:38:01,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936391333] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:38:01,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054100019] [2023-11-23 08:38:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:38:01,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:38:01,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:38:01,010 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:38:01,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 08:38:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:38:01,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 2567 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-23 08:38:01,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:38:01,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 08:38:01,848 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 08:38:01,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 08:38:01,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-11-23 08:38:02,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 14 treesize of output 3 [2023-11-23 08:38:02,366 INFO L349 Elim1Store]: treesize reduction 146, result has 31.5 percent of original size [2023-11-23 08:38:02,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 73 treesize of output 148 [2023-11-23 08:38:03,183 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-23 08:38:03,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2023-11-23 08:38:03,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-11-23 08:38:03,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:38:03,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 08:38:03,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 08:38:03,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 08:38:03,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 08:38:04,196 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 08:38:04,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 08:38:04,832 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-23 08:38:04,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-23 08:38:06,927 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16| Int)) (and (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) (<= (+ (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) 0) 2) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_20| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_20|) 0))) (and (not (= .cse0 0)) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_20|) (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_20|))))) is different from true [2023-11-23 08:38:09,055 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16| Int)) (and (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) (<= (+ (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) 0) 2) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_21|) 0))) (and (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_21|) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_21|) (not (= .cse0 0)))))) is different from true [2023-11-23 08:38:11,178 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16| Int)) (and (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) (<= (+ (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) 0) 2) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_22|) 0))) (and (not (= .cse0 0)) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_22|) (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_22|))))) is different from true [2023-11-23 08:38:11,344 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 08:38:11,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2023-11-23 08:38:13,417 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16| Int)) (and (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) (<= (+ (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) 0) 2) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|))) (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_23|) 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_23|) (not (= .cse0 0)) (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_23|))))) is different from true [2023-11-23 08:38:13,566 INFO L349 Elim1Store]: treesize reduction 40, result has 51.8 percent of original size [2023-11-23 08:38:13,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 61 [2023-11-23 08:38:13,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 08:38:17,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:38:17,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 71 [2023-11-23 08:38:17,060 INFO L378 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-11-23 08:38:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 248 proven. 208 refuted. 0 times theorem prover too weak. 92 trivial. 158 not checked. [2023-11-23 08:38:17,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:38:17,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054100019] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:38:17,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:38:17,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 37] total 44 [2023-11-23 08:38:17,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306493718] [2023-11-23 08:38:17,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:38:17,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-23 08:38:17,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:38:17,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-23 08:38:17,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1856, Unknown=4, NotChecked=356, Total=2352 [2023-11-23 08:38:17,608 INFO L87 Difference]: Start difference. First operand 248 states and 322 transitions. Second operand has 44 states, 38 states have (on average 4.2368421052631575) internal successors, (161), 37 states have internal predecessors, (161), 18 states have call successors, (75), 17 states have call predecessors, (75), 19 states have return successors, (70), 16 states have call predecessors, (70), 17 states have call successors, (70) [2023-11-23 08:38:21,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:38:24,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:39:12,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:39:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:39:18,452 INFO L93 Difference]: Finished difference Result 458 states and 599 transitions. [2023-11-23 08:39:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-11-23 08:39:18,453 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 38 states have (on average 4.2368421052631575) internal successors, (161), 37 states have internal predecessors, (161), 18 states have call successors, (75), 17 states have call predecessors, (75), 19 states have return successors, (70), 16 states have call predecessors, (70), 17 states have call successors, (70) Word has length 207 [2023-11-23 08:39:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:39:18,458 INFO L225 Difference]: With dead ends: 458 [2023-11-23 08:39:18,458 INFO L226 Difference]: Without dead ends: 331 [2023-11-23 08:39:18,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 309 SyntacticMatches, 37 SemanticMatches, 109 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3247 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=1054, Invalid=10300, Unknown=4, NotChecked=852, Total=12210 [2023-11-23 08:39:18,462 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 1133 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 7913 mSolverCounterSat, 662 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 10186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 662 IncrementalHoareTripleChecker+Valid, 7913 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 1607 IncrementalHoareTripleChecker+Unchecked, 42.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:39:18,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 1043 Invalid, 10186 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [662 Valid, 7913 Invalid, 4 Unknown, 1607 Unchecked, 42.0s Time] [2023-11-23 08:39:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-23 08:39:18,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 319. [2023-11-23 08:39:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 210 states have (on average 1.2666666666666666) internal successors, (266), 215 states have internal predecessors, (266), 65 states have call successors, (65), 38 states have call predecessors, (65), 43 states have return successors, (73), 65 states have call predecessors, (73), 64 states have call successors, (73) [2023-11-23 08:39:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 404 transitions. [2023-11-23 08:39:18,493 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 404 transitions. Word has length 207 [2023-11-23 08:39:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:39:18,494 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 404 transitions. [2023-11-23 08:39:18,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 38 states have (on average 4.2368421052631575) internal successors, (161), 37 states have internal predecessors, (161), 18 states have call successors, (75), 17 states have call predecessors, (75), 19 states have return successors, (70), 16 states have call predecessors, (70), 17 states have call successors, (70) [2023-11-23 08:39:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 404 transitions. [2023-11-23 08:39:18,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-11-23 08:39:18,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:39:18,496 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:39:18,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-23 08:39:18,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:39:18,712 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:39:18,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:39:18,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1476847948, now seen corresponding path program 1 times [2023-11-23 08:39:18,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:39:18,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3898863] [2023-11-23 08:39:18,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:39:18,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:39:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:39:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:39:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:39:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 08:39:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:39:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:39:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:39:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:39:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:39:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:39:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:39:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:39:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:39:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:39:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 08:39:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:39:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 08:39:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-23 08:39:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 08:39:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:39:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:39:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:39:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 08:39:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 08:39:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-23 08:39:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-23 08:39:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-23 08:39:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-23 08:39:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-23 08:39:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-23 08:39:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-23 08:39:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:39:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-23 08:39:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-23 08:39:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-23 08:39:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-23 08:39:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-11-23 08:39:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2023-11-23 08:39:19,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:39:19,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3898863] [2023-11-23 08:39:19,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3898863] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:39:19,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216904851] [2023-11-23 08:39:19,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:39:19,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:39:19,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:39:19,425 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:39:19,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 08:39:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:39:19,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 2655 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 08:39:19,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:39:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 374 proven. 46 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2023-11-23 08:39:20,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:39:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2023-11-23 08:39:21,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216904851] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:39:21,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:39:21,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-11-23 08:39:21,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290415369] [2023-11-23 08:39:21,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:39:21,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 08:39:21,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:39:21,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 08:39:21,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:39:21,470 INFO L87 Difference]: Start difference. First operand 319 states and 404 transitions. Second operand has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 12 states have internal predecessors, (166), 9 states have call successors, (96), 6 states have call predecessors, (96), 5 states have return successors, (90), 9 states have call predecessors, (90), 9 states have call successors, (90) [2023-11-23 08:39:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:39:24,520 INFO L93 Difference]: Finished difference Result 373 states and 468 transitions. [2023-11-23 08:39:24,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:39:24,520 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 12 states have internal predecessors, (166), 9 states have call successors, (96), 6 states have call predecessors, (96), 5 states have return successors, (90), 9 states have call predecessors, (90), 9 states have call successors, (90) Word has length 224 [2023-11-23 08:39:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:39:24,521 INFO L225 Difference]: With dead ends: 373 [2023-11-23 08:39:24,521 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 08:39:24,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 513 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2023-11-23 08:39:24,522 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 205 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:39:24,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 441 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-23 08:39:24,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 08:39:24,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 08:39:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 08:39:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 08:39:24,525 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2023-11-23 08:39:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:39:24,526 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 08:39:24,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 12 states have internal predecessors, (166), 9 states have call successors, (96), 6 states have call predecessors, (96), 5 states have return successors, (90), 9 states have call predecessors, (90), 9 states have call successors, (90) [2023-11-23 08:39:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 08:39:24,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 08:39:24,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 08:39:24,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 08:39:24,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:39:24,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 08:39:34,855 INFO L899 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2023-11-23 08:39:34,856 INFO L895 garLoopResultBuilder]: At program point L6944(lines 6944 6946) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< |#StackHeapBarrier| 1) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))))) [2023-11-23 08:39:34,856 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6943 6948) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< |#StackHeapBarrier| 1) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))))) [2023-11-23 08:39:34,856 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2023-11-23 08:39:34,856 INFO L899 garLoopResultBuilder]: For program point L9990-5(line 9990) no Hoare annotation was computed. [2023-11-23 08:39:34,856 INFO L899 garLoopResultBuilder]: For program point L9990-7(line 9990) no Hoare annotation was computed. [2023-11-23 08:39:34,856 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 9988 9991) no Hoare annotation was computed. [2023-11-23 08:39:34,856 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9988 9991) the Hoare annotation is: true [2023-11-23 08:39:34,856 INFO L899 garLoopResultBuilder]: For program point L9990-2(line 9990) no Hoare annotation was computed. [2023-11-23 08:39:34,856 INFO L899 garLoopResultBuilder]: For program point L9990-3(line 9990) no Hoare annotation was computed. [2023-11-23 08:39:34,856 INFO L895 garLoopResultBuilder]: At program point L9990-4(line 9990) the Hoare annotation is: (let ((.cse3 (select (select |#memory_$Pointer$.base| |aws_hash_table_is_valid_#in~map.base|) |aws_hash_table_is_valid_#in~map.offset|))) (let ((.cse0 (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1)) (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1))))) (.cse1 (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16| Int)) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) 0) 0)) (not (= (select |#valid| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) 1)) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16| 2) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16| (+ 2 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) 0)))))) (.cse2 (= |aws_hash_table_is_valid_#t~mem1488.base| .cse3)) (.cse5 (= |aws_hash_table_is_valid_#t~mem1488.offset| (select (select |#memory_$Pointer$.offset| |aws_hash_table_is_valid_#in~map.base|) |aws_hash_table_is_valid_#in~map.offset|))) (.cse6 (< |#StackHeapBarrier| 1))) (and (let ((.cse4 (= aws_hash_table_is_valid_~map.offset |aws_hash_table_is_valid_#in~map.offset|))) (or .cse0 (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset_BEFORE_CALL_8| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset_BEFORE_CALL_8|) 0)) .cse1 (and .cse2 (or (= .cse3 0) |aws_hash_table_is_valid_#t~short1490|) .cse4 (= |aws_hash_table_is_valid_#in~map.base| aws_hash_table_is_valid_~map.base) .cse5) .cse6 (and (= |aws_hash_table_is_valid_#in~map.base| 0) (= aws_hash_table_is_valid_~map.base 0) (or (= (select (select |#memory_$Pointer$.base| 0) |aws_hash_table_is_valid_#in~map.offset|) 0) |aws_hash_table_is_valid_#t~short1490|) .cse4))) (or .cse0 .cse1 (and .cse2 .cse5) (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse7 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (or (not (= (select |#valid| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1)) (= .cse7 0) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| (+ .cse7 2)) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| 2)))) .cse6 (and (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse9 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base_BEFORE_CALL_1|) 0))) (let ((.cse8 (select (select |#memory_$Pointer$.base| .cse9) 0))) (or (= .cse8 0) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base_BEFORE_CALL_1|) 0) 0)) (< .cse9 2) (< .cse9 (+ 2 .cse8)))))) (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse10 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base_BEFORE_CALL_1|) 0))) (or (not (= .cse10 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base_BEFORE_CALL_1|)) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base_BEFORE_CALL_1|) 0) 0)) (< .cse10 2))))))))) [2023-11-23 08:39:34,857 INFO L899 garLoopResultBuilder]: For program point L9990(line 9990) no Hoare annotation was computed. [2023-11-23 08:39:34,857 INFO L902 garLoopResultBuilder]: At program point L9640-3(line 9640) the Hoare annotation is: true [2023-11-23 08:39:34,857 INFO L899 garLoopResultBuilder]: For program point L9640-4(line 9640) no Hoare annotation was computed. [2023-11-23 08:39:34,857 INFO L902 garLoopResultBuilder]: At program point L9640-5(line 9640) the Hoare annotation is: true [2023-11-23 08:39:34,857 INFO L899 garLoopResultBuilder]: For program point L9640-6(lines 9603 9641) no Hoare annotation was computed. [2023-11-23 08:39:34,857 INFO L899 garLoopResultBuilder]: For program point L9640(line 9640) no Hoare annotation was computed. [2023-11-23 08:39:34,857 INFO L899 garLoopResultBuilder]: For program point L9640-1(line 9640) no Hoare annotation was computed. [2023-11-23 08:39:34,857 INFO L902 garLoopResultBuilder]: At program point L9617-2(lines 9617 9636) the Hoare annotation is: true [2023-11-23 08:39:34,857 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9603 9641) the Hoare annotation is: true [2023-11-23 08:39:34,857 INFO L899 garLoopResultBuilder]: For program point L9139(lines 9139 9143) no Hoare annotation was computed. [2023-11-23 08:39:34,857 INFO L899 garLoopResultBuilder]: For program point L9618(line 9618) no Hoare annotation was computed. [2023-11-23 08:39:34,857 INFO L899 garLoopResultBuilder]: For program point L9618-2(line 9618) no Hoare annotation was computed. [2023-11-23 08:39:34,857 INFO L899 garLoopResultBuilder]: For program point L9618-4(line 9618) no Hoare annotation was computed. [2023-11-23 08:39:34,857 INFO L902 garLoopResultBuilder]: At program point L9140(line 9140) the Hoare annotation is: true [2023-11-23 08:39:34,857 INFO L902 garLoopResultBuilder]: At program point L9140-1(line 9140) the Hoare annotation is: true [2023-11-23 08:39:34,857 INFO L899 garLoopResultBuilder]: For program point L9140-2(line 9140) no Hoare annotation was computed. [2023-11-23 08:39:34,863 INFO L902 garLoopResultBuilder]: At program point L9604(line 9604) the Hoare annotation is: true [2023-11-23 08:39:34,863 INFO L902 garLoopResultBuilder]: At program point L9604-1(line 9604) the Hoare annotation is: true [2023-11-23 08:39:34,863 INFO L899 garLoopResultBuilder]: For program point L9604-2(line 9604) no Hoare annotation was computed. [2023-11-23 08:39:34,863 INFO L899 garLoopResultBuilder]: For program point L9629(line 9629) no Hoare annotation was computed. [2023-11-23 08:39:34,863 INFO L899 garLoopResultBuilder]: For program point L9629-2(line 9629) no Hoare annotation was computed. [2023-11-23 08:39:34,863 INFO L899 garLoopResultBuilder]: For program point L9142-1(line 9142) no Hoare annotation was computed. [2023-11-23 08:39:34,864 INFO L899 garLoopResultBuilder]: For program point L9621(lines 9621 9623) no Hoare annotation was computed. [2023-11-23 08:39:34,864 INFO L902 garLoopResultBuilder]: At program point L9142-2(line 9142) the Hoare annotation is: true [2023-11-23 08:39:34,864 INFO L899 garLoopResultBuilder]: For program point L9142-3(line 9142) no Hoare annotation was computed. [2023-11-23 08:39:34,864 INFO L899 garLoopResultBuilder]: For program point L9629-4(lines 9629 9631) no Hoare annotation was computed. [2023-11-23 08:39:34,864 INFO L902 garLoopResultBuilder]: At program point L9142-5(line 9142) the Hoare annotation is: true [2023-11-23 08:39:34,864 INFO L899 garLoopResultBuilder]: For program point L9142-6(line 9142) no Hoare annotation was computed. [2023-11-23 08:39:34,864 INFO L902 garLoopResultBuilder]: At program point L9142-8(line 9142) the Hoare annotation is: true [2023-11-23 08:39:34,864 INFO L902 garLoopResultBuilder]: At program point L9605(line 9605) the Hoare annotation is: true [2023-11-23 08:39:34,864 INFO L899 garLoopResultBuilder]: For program point L9605-1(line 9605) no Hoare annotation was computed. [2023-11-23 08:39:34,864 INFO L899 garLoopResultBuilder]: For program point s_remove_entryEXIT(lines 9603 9641) no Hoare annotation was computed. [2023-11-23 08:39:34,864 INFO L902 garLoopResultBuilder]: At program point L9639-2(line 9639) the Hoare annotation is: true [2023-11-23 08:39:34,864 INFO L902 garLoopResultBuilder]: At program point L9606-2(line 9606) the Hoare annotation is: true [2023-11-23 08:39:34,864 INFO L899 garLoopResultBuilder]: For program point L9606-3(line 9606) no Hoare annotation was computed. [2023-11-23 08:39:34,864 INFO L899 garLoopResultBuilder]: For program point L9639(line 9639) no Hoare annotation was computed. [2023-11-23 08:39:34,864 INFO L899 garLoopResultBuilder]: For program point L9606(line 9606) no Hoare annotation was computed. [2023-11-23 08:39:34,864 INFO L899 garLoopResultBuilder]: For program point L9639-1(line 9639) no Hoare annotation was computed. [2023-11-23 08:39:34,864 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2023-11-23 08:39:34,864 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 261) the Hoare annotation is: true [2023-11-23 08:39:34,865 INFO L895 garLoopResultBuilder]: At program point L10108(line 10108) the Hoare annotation is: (let ((.cse1 (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0)) (.cse2 (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| (select |#valid| |hash_table_state_required_bytes_~#elemsize~0.base|)) |#valid|))) (or (and (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (= (select |#valid| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1) (not (= .cse0 0))))) .cse1 .cse2) (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse3 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (or (= 0 .cse3) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| (+ 2 .cse3)) (not (= (select |old(#valid)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1)) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| 2)))) (< |#StackHeapBarrier| 1) (and .cse1 .cse2 (= ~tl_last_error~0 |old(~tl_last_error~0)|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1)))))) [2023-11-23 08:39:34,865 INFO L899 garLoopResultBuilder]: For program point L10108-1(line 10108) no Hoare annotation was computed. [2023-11-23 08:39:34,865 INFO L899 garLoopResultBuilder]: For program point L10108-2(lines 10108 10110) no Hoare annotation was computed. [2023-11-23 08:39:34,865 INFO L895 garLoopResultBuilder]: At program point L10104(line 10104) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (or (= 0 .cse0) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| (+ 2 .cse0)) (not (= (select |old(#valid)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1)) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| 2)))) (and (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (and (<= (+ .cse1 2) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (= (select |#valid| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1) (not (= .cse1 0))))) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| (select |#valid| |hash_table_state_required_bytes_~#elemsize~0.base|)) |#valid|) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) (< |#StackHeapBarrier| 1) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))))) [2023-11-23 08:39:34,865 INFO L899 garLoopResultBuilder]: For program point L10104-1(line 10104) no Hoare annotation was computed. [2023-11-23 08:39:34,865 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10101 10113) no Hoare annotation was computed. [2023-11-23 08:39:34,865 INFO L899 garLoopResultBuilder]: For program point L10104-2(lines 10104 10106) no Hoare annotation was computed. [2023-11-23 08:39:34,865 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 10101 10113) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (or (= 0 .cse0) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| (+ 2 .cse0)) (not (= (select |old(#valid)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1)) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| 2)))) (< |#StackHeapBarrier| 1) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))))) [2023-11-23 08:39:34,865 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10101 10113) no Hoare annotation was computed. [2023-11-23 08:39:34,865 INFO L899 garLoopResultBuilder]: For program point L10079-3(line 10079) no Hoare annotation was computed. [2023-11-23 08:39:34,865 INFO L899 garLoopResultBuilder]: For program point L10079(line 10079) no Hoare annotation was computed. [2023-11-23 08:39:34,865 INFO L899 garLoopResultBuilder]: For program point L10079-1(line 10079) no Hoare annotation was computed. [2023-11-23 08:39:34,865 INFO L899 garLoopResultBuilder]: For program point L10069(lines 10069 10073) no Hoare annotation was computed. [2023-11-23 08:39:34,865 INFO L899 garLoopResultBuilder]: For program point L10059(lines 10059 10063) no Hoare annotation was computed. [2023-11-23 08:39:34,865 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 10052 10093) the Hoare annotation is: true [2023-11-23 08:39:34,865 INFO L899 garLoopResultBuilder]: For program point L10076(line 10076) no Hoare annotation was computed. [2023-11-23 08:39:34,865 INFO L899 garLoopResultBuilder]: For program point aws_hash_iter_is_validEXIT(lines 10052 10093) no Hoare annotation was computed. [2023-11-23 08:39:34,866 INFO L895 garLoopResultBuilder]: At program point L10064(line 10064) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1)) (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)))) (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16| Int)) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) 0) 0)) (not (= (select |#valid| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) 1)) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16| 2) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16| (+ 2 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) 0))))) (and (= |aws_hash_iter_is_valid_#in~iter.base| 0) (= aws_hash_iter_is_valid_~iter.base 0)) (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (or (not (= (select |#valid| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1)) (= .cse0 0) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| (+ .cse0 2)) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| 2)))) (< |#StackHeapBarrier| 1) (and (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse2 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base_BEFORE_CALL_1|) 0))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse2) 0))) (or (= .cse1 0) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base_BEFORE_CALL_1|) 0) 0)) (< .cse2 2) (< .cse2 (+ 2 .cse1)))))) (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse3 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base_BEFORE_CALL_1|) 0))) (or (not (= .cse3 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base_BEFORE_CALL_1|)) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base_BEFORE_CALL_1|) 0) 0)) (< .cse3 2)))))) [2023-11-23 08:39:34,866 INFO L899 garLoopResultBuilder]: For program point L10064-1(lines 10064 10068) no Hoare annotation was computed. [2023-11-23 08:39:34,866 INFO L899 garLoopResultBuilder]: For program point L10085(line 10085) no Hoare annotation was computed. [2023-11-23 08:39:34,866 INFO L899 garLoopResultBuilder]: For program point L10085-1(line 10085) no Hoare annotation was computed. [2023-11-23 08:39:34,866 INFO L899 garLoopResultBuilder]: For program point L10085-3(line 10085) no Hoare annotation was computed. [2023-11-23 08:39:34,866 INFO L899 garLoopResultBuilder]: For program point aws_hash_iter_is_validFINAL(lines 10052 10093) no Hoare annotation was computed. [2023-11-23 08:39:34,866 INFO L899 garLoopResultBuilder]: For program point L10054(lines 10054 10058) no Hoare annotation was computed. [2023-11-23 08:39:34,866 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2023-11-23 08:39:34,866 INFO L899 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2023-11-23 08:39:34,866 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2586 2594) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (or (= 0 .cse0) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| (+ 2 .cse0)) (not (= (select |old(#valid)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1)) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| 2)))) (< |#StackHeapBarrier| 1) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))))) [2023-11-23 08:39:34,866 INFO L899 garLoopResultBuilder]: For program point aws_mul_u64_checked_returnLabel#1(lines 2497 2502) no Hoare annotation was computed. [2023-11-23 08:39:34,866 INFO L895 garLoopResultBuilder]: At program point L2498(line 2498) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (or (= 0 .cse0) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| (+ 2 .cse0)) (not (= (select |old(#valid)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1)) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| 2)))) (< |#StackHeapBarrier| 1) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))))) [2023-11-23 08:39:34,866 INFO L899 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2023-11-23 08:39:34,866 INFO L895 garLoopResultBuilder]: At program point L2499(line 2499) the Hoare annotation is: (or (and (exists ((|v___CPROVER_overflow_mult_~#c~1.base_30| Int)) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_30|) 0)) (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (= (select |#valid| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1) (not (= .cse0 0))))) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse1 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (or (= 0 .cse1) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| (+ 2 .cse1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1)) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| 2)))) (< |#StackHeapBarrier| 1) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))))) [2023-11-23 08:39:34,866 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2023-11-23 08:39:34,866 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 266) the Hoare annotation is: true [2023-11-23 08:39:34,866 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2023-11-23 08:39:34,866 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-11-23 08:39:34,867 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 248 251) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< |#StackHeapBarrier| 1) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))))) [2023-11-23 08:39:34,867 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2023-11-23 08:39:34,867 INFO L895 garLoopResultBuilder]: At program point L10027(line 10027) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset_BEFORE_CALL_8| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset_BEFORE_CALL_8|) 0)))) (and (or .cse0 (= |hash_table_state_is_valid_#in~map.base| hash_table_state_is_valid_~map.base)) (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1)) (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)))) .cse0 (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16| Int)) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) 0) 0)) (not (= (select |#valid| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) 1)) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16| 2) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16| (+ 2 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_16|) 0))))) (and (or (not (= |hash_table_state_is_valid_#in~map.offset| 0)) (not (= |hash_table_state_is_valid_#in~map.base| 0))) (= hash_table_state_is_valid_~map.offset |hash_table_state_is_valid_#in~map.offset|)) (< |#StackHeapBarrier| 1)))) [2023-11-23 08:39:34,867 INFO L899 garLoopResultBuilder]: For program point L10027-1(line 10027) no Hoare annotation was computed. [2023-11-23 08:39:34,867 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 9999 10046) no Hoare annotation was computed. [2023-11-23 08:39:34,867 INFO L899 garLoopResultBuilder]: For program point L10001(lines 10001 10005) no Hoare annotation was computed. [2023-11-23 08:39:34,867 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 9999 10046) no Hoare annotation was computed. [2023-11-23 08:39:34,867 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9999 10046) the Hoare annotation is: true [2023-11-23 08:39:34,867 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2023-11-23 08:39:34,867 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2023-11-23 08:39:34,867 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-11-23 08:39:34,867 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-23 08:39:34,867 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-23 08:39:34,867 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-23 08:39:34,867 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-23 08:39:34,867 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1988 1999) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1)) (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)))) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (< |#StackHeapBarrier| 1) (forall ((|v___CPROVER_overflow_mult_~#c~1.base_30| Int)) (not (= (select |#valid| |v___CPROVER_overflow_mult_~#c~1.base_30|) 0)))) [2023-11-23 08:39:34,867 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2023-11-23 08:39:34,867 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2023-11-23 08:39:34,868 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 253 256) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (or (= .cse0 0) (not (= (select |old(#valid)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1)) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| (+ .cse0 2)) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| 2)))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< |#StackHeapBarrier| 1) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))))) [2023-11-23 08:39:34,868 INFO L899 garLoopResultBuilder]: For program point L2630-5(line 2630) no Hoare annotation was computed. [2023-11-23 08:39:34,868 INFO L899 garLoopResultBuilder]: For program point L2630-7(line 2630) no Hoare annotation was computed. [2023-11-23 08:39:34,868 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2023-11-23 08:39:34,868 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2626 2631) the Hoare annotation is: true [2023-11-23 08:39:34,868 INFO L899 garLoopResultBuilder]: For program point L2630(line 2630) no Hoare annotation was computed. [2023-11-23 08:39:34,868 INFO L899 garLoopResultBuilder]: For program point L2630-1(line 2630) no Hoare annotation was computed. [2023-11-23 08:39:34,868 INFO L899 garLoopResultBuilder]: For program point L2630-3(line 2630) no Hoare annotation was computed. [2023-11-23 08:39:34,868 INFO L895 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (< |#StackHeapBarrier| 1) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))))) [2023-11-23 08:39:34,868 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2023-11-23 08:39:34,868 INFO L895 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (let ((.cse2 (< |#StackHeapBarrier| 1)) (.cse3 (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1)))))) (and (or (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (= (select |#valid| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1) (not (= .cse0 0))))) (forall ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse1 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (or (= 0 .cse1) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| (+ 2 .cse1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1)) (< |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| 2)))) .cse2 .cse3) (or (and (exists ((|v___CPROVER_overflow_mult_~#c~1.base_30| Int)) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_30|) 0)) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) .cse2 .cse3))) [2023-11-23 08:39:34,868 INFO L899 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2023-11-23 08:39:34,868 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2613 2621) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (< |#StackHeapBarrier| 1) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (or (< |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| (+ |#StackHeapBarrier| 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))))) [2023-11-23 08:39:34,868 INFO L899 garLoopResultBuilder]: For program point aws_add_u64_checked_returnLabel#1(lines 2541 2546) no Hoare annotation was computed. [2023-11-23 08:39:34,868 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2023-11-23 08:39:34,868 INFO L899 garLoopResultBuilder]: For program point L9883(lines 9883 9885) no Hoare annotation was computed. [2023-11-23 08:39:34,868 INFO L902 garLoopResultBuilder]: At program point L9887(line 9887) the Hoare annotation is: true [2023-11-23 08:39:34,868 INFO L899 garLoopResultBuilder]: For program point L9887-1(line 9887) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L899 garLoopResultBuilder]: For program point L9883-2(lines 9883 9885) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L902 garLoopResultBuilder]: At program point L9900(line 9900) the Hoare annotation is: true [2023-11-23 08:39:34,869 INFO L899 garLoopResultBuilder]: For program point L9900-1(line 9900) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L899 garLoopResultBuilder]: For program point L9892(line 9892) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L899 garLoopResultBuilder]: For program point L9892-2(lines 9892 9894) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L902 garLoopResultBuilder]: At program point L9884(line 9884) the Hoare annotation is: true [2023-11-23 08:39:34,869 INFO L899 garLoopResultBuilder]: For program point L9884-1(line 9884) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L899 garLoopResultBuilder]: For program point L9892-4(lines 9892 9894) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L902 garLoopResultBuilder]: At program point L9876(line 9876) the Hoare annotation is: true [2023-11-23 08:39:34,869 INFO L902 garLoopResultBuilder]: At program point L9876-1(line 9876) the Hoare annotation is: true [2023-11-23 08:39:34,869 INFO L899 garLoopResultBuilder]: For program point L9876-2(line 9876) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L899 garLoopResultBuilder]: For program point aws_hash_iter_deleteEXIT(lines 9871 9904) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L902 garLoopResultBuilder]: At program point L9877(line 9877) the Hoare annotation is: true [2023-11-23 08:39:34,869 INFO L899 garLoopResultBuilder]: For program point L9877-1(line 9877) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9871 9904) the Hoare annotation is: true [2023-11-23 08:39:34,869 INFO L899 garLoopResultBuilder]: For program point L9882(lines 9882 9889) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L899 garLoopResultBuilder]: For program point L9886(lines 9886 9888) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L902 garLoopResultBuilder]: At program point L9874(line 9874) the Hoare annotation is: true [2023-11-23 08:39:34,869 INFO L899 garLoopResultBuilder]: For program point L9882-1(lines 9882 9889) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L899 garLoopResultBuilder]: For program point L9903-2(line 9903) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L899 garLoopResultBuilder]: For program point L9874-1(line 9874) no Hoare annotation was computed. [2023-11-23 08:39:34,869 INFO L902 garLoopResultBuilder]: At program point L9903(line 9903) the Hoare annotation is: true [2023-11-23 08:39:34,870 INFO L902 garLoopResultBuilder]: At program point L9903-1(line 9903) the Hoare annotation is: true [2023-11-23 08:39:34,870 INFO L902 garLoopResultBuilder]: At program point L9891(line 9891) the Hoare annotation is: true [2023-11-23 08:39:34,870 INFO L899 garLoopResultBuilder]: For program point L9891-1(line 9891) no Hoare annotation was computed. [2023-11-23 08:39:34,870 INFO L899 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2023-11-23 08:39:34,870 INFO L895 garLoopResultBuilder]: At program point L6815(line 6815) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (= (select |#valid| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1) (not (= .cse0 0))))) (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|)) [2023-11-23 08:39:34,870 INFO L895 garLoopResultBuilder]: At program point L6811-1(line 6811) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (= (select |#valid| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1) (not (= .cse0 0))))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|)) [2023-11-23 08:39:34,870 INFO L895 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (= (select |#valid| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1) (not (= .cse0 0))))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|)) [2023-11-23 08:39:34,870 INFO L899 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2023-11-23 08:39:34,870 INFO L895 garLoopResultBuilder]: At program point L6815-2(line 6815) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|)) [2023-11-23 08:39:34,870 INFO L899 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2023-11-23 08:39:34,870 INFO L895 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0))) (and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base|)) (<= (+ .cse0 2) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (<= 2 |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (not (= .cse0 0)) (exists ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0))) [2023-11-23 08:39:34,870 INFO L895 garLoopResultBuilder]: At program point L10131(line 10131) the Hoare annotation is: false [2023-11-23 08:39:34,870 INFO L899 garLoopResultBuilder]: For program point L10131-1(line 10131) no Hoare annotation was computed. [2023-11-23 08:39:34,870 INFO L895 garLoopResultBuilder]: At program point L10127(line 10127) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) 0))) (and (<= 1 |#StackHeapBarrier|) (<= 2 .cse0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) 0) 0) (<= (+ .cse1 2) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (<= 2 |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (not (= .cse1 0)) (<= 2 |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) (or (= .cse0 |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) (let ((.cse2 (select (select |#memory_$Pointer$.base| .cse0) 0))) (and (<= (+ .cse2 2) .cse0) (not (= .cse2 0))))) (exists ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.offset| 0))) [2023-11-23 08:39:34,870 INFO L899 garLoopResultBuilder]: For program point L10127-1(line 10127) no Hoare annotation was computed. [2023-11-23 08:39:34,871 INFO L895 garLoopResultBuilder]: At program point L10119-2(line 10119) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0))) (and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0) 0) (<= (+ .cse0 2) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (<= 2 |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (not (= .cse0 0)) (exists ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0))) [2023-11-23 08:39:34,871 INFO L899 garLoopResultBuilder]: For program point L10119-3(line 10119) no Hoare annotation was computed. [2023-11-23 08:39:34,871 INFO L899 garLoopResultBuilder]: For program point L10119(line 10119) no Hoare annotation was computed. [2023-11-23 08:39:34,871 INFO L899 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2023-11-23 08:39:34,871 INFO L895 garLoopResultBuilder]: At program point L6816(line 6816) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|)) [2023-11-23 08:39:34,871 INFO L899 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2023-11-23 08:39:34,871 INFO L895 garLoopResultBuilder]: At program point L6812(line 6812) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (= (select |#valid| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1) (not (= .cse0 0))))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|)) [2023-11-23 08:39:34,871 INFO L895 garLoopResultBuilder]: At program point L10132(line 10132) the Hoare annotation is: false [2023-11-23 08:39:34,871 INFO L899 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2023-11-23 08:39:34,871 INFO L895 garLoopResultBuilder]: At program point L10132-1(line 10132) the Hoare annotation is: false [2023-11-23 08:39:34,871 INFO L895 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0))) (and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base|)) (<= (+ .cse0 2) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (<= 2 |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (not (= .cse0 0)) (exists ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0))) [2023-11-23 08:39:34,871 INFO L899 garLoopResultBuilder]: For program point L10132-2(line 10132) no Hoare annotation was computed. [2023-11-23 08:39:34,871 INFO L895 garLoopResultBuilder]: At program point L10128(line 10128) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) 0))) (and (<= 1 |#StackHeapBarrier|) (<= 2 .cse0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) 0) 0) (<= (+ .cse1 2) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (<= 2 |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (not (= .cse1 0)) (<= 2 |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) (or (= .cse0 |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) (let ((.cse2 (select (select |#memory_$Pointer$.base| .cse0) 0))) (and (<= (+ .cse2 2) .cse0) (not (= .cse2 0))))) (exists ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.offset| 0))) [2023-11-23 08:39:34,871 INFO L895 garLoopResultBuilder]: At program point L10128-1(line 10128) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) 0))) (and (<= 1 |#StackHeapBarrier|) (<= 2 .cse0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0) 0) (= 0 |ULTIMATE.start_aws_hash_iter_delete_harness_#t~ret1547#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) 0) 0) (<= (+ .cse1 2) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (<= 2 |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (not (= .cse1 0)) (or (= .cse0 |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) (let ((.cse2 (select (select |#memory_$Pointer$.base| .cse0) 0))) (and (<= (+ .cse2 2) .cse0) (not (= .cse2 0))))) (exists ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.offset| 0))) [2023-11-23 08:39:34,871 INFO L899 garLoopResultBuilder]: For program point L10128-2(line 10128) no Hoare annotation was computed. [2023-11-23 08:39:34,871 INFO L899 garLoopResultBuilder]: For program point L10120-3(line 10120) no Hoare annotation was computed. [2023-11-23 08:39:34,872 INFO L899 garLoopResultBuilder]: For program point L10120(line 10120) no Hoare annotation was computed. [2023-11-23 08:39:34,872 INFO L895 garLoopResultBuilder]: At program point L10120-2(line 10120) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0))) (and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0) 0) (<= (+ .cse0 2) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (<= 2 |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (not (= .cse0 0)) (exists ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0))) [2023-11-23 08:39:34,872 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 08:39:34,872 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 08:39:34,872 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (<= 2 |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) (= (select |#valid| |v_ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base_BEFORE_CALL_17|) 1) (not (= .cse0 0))))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|)) [2023-11-23 08:39:34,872 INFO L899 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2023-11-23 08:39:34,872 INFO L895 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0))) (and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base|)) (<= (+ .cse0 2) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (<= 2 |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (not (= .cse0 0)) (exists ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0))) [2023-11-23 08:39:34,872 INFO L899 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2023-11-23 08:39:34,872 INFO L895 garLoopResultBuilder]: At program point L10130(line 10130) the Hoare annotation is: false [2023-11-23 08:39:34,872 INFO L895 garLoopResultBuilder]: At program point L10122(line 10122) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0))) (and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0) 0) (<= (+ .cse0 2) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (<= 2 |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (not (= .cse0 0)) (exists ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0))) [2023-11-23 08:39:34,872 INFO L895 garLoopResultBuilder]: At program point L10130-1(line 10130) the Hoare annotation is: false [2023-11-23 08:39:34,872 INFO L899 garLoopResultBuilder]: For program point L10130-2(line 10130) no Hoare annotation was computed. [2023-11-23 08:39:34,872 INFO L895 garLoopResultBuilder]: At program point L10118-1(line 10118) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0))) (and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0) 0) (<= (+ .cse0 2) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (<= 2 |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (not (= .cse0 0)) (exists ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0))) [2023-11-23 08:39:34,872 INFO L899 garLoopResultBuilder]: For program point L10118-2(line 10118) no Hoare annotation was computed. [2023-11-23 08:39:34,872 INFO L899 garLoopResultBuilder]: For program point L10122-1(line 10122) no Hoare annotation was computed. [2023-11-23 08:39:34,872 INFO L895 garLoopResultBuilder]: At program point L10118(line 10118) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0))) (and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 0) 0) (<= (+ .cse0 2) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (<= 2 |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) 1) (not (= .cse0 0)) (exists ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8| Int)) (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_8|) 1))) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset| 0))) [2023-11-23 08:39:34,872 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-23 08:39:34,873 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-23 08:39:34,873 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-23 08:39:34,873 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-23 08:39:34,873 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-23 08:39:34,873 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-23 08:39:34,875 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:39:34,889 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 08:39:34,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:39:34 BoogieIcfgContainer [2023-11-23 08:39:34,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 08:39:34,915 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 08:39:34,915 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 08:39:34,915 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 08:39:34,916 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:37:20" (3/4) ... [2023-11-23 08:39:34,917 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 08:39:34,920 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2023-11-23 08:39:34,920 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2023-11-23 08:39:34,920 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2023-11-23 08:39:34,920 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2023-11-23 08:39:34,920 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_remove_entry [2023-11-23 08:39:34,920 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2023-11-23 08:39:34,921 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2023-11-23 08:39:34,921 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-23 08:39:34,921 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2023-11-23 08:39:34,921 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2023-11-23 08:39:34,921 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2023-11-23 08:39:34,921 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_iter_is_valid [2023-11-23 08:39:34,921 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2023-11-23 08:39:34,921 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2023-11-23 08:39:34,921 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2023-11-23 08:39:34,921 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2023-11-23 08:39:34,921 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_iter_delete [2023-11-23 08:39:34,922 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-23 08:39:34,922 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2023-11-23 08:39:34,940 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 172 nodes and edges [2023-11-23 08:39:34,941 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 82 nodes and edges [2023-11-23 08:39:34,942 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2023-11-23 08:39:34,943 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-23 08:39:34,944 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-23 08:39:34,945 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-23 08:39:34,946 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-23 08:39:34,946 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 08:39:35,281 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 08:39:35,282 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 08:39:35,282 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 08:39:35,282 INFO L158 Benchmark]: Toolchain (without parser) took 139308.44ms. Allocated memory was 155.2MB in the beginning and 557.8MB in the end (delta: 402.7MB). Free memory was 86.6MB in the beginning and 339.3MB in the end (delta: -252.8MB). Peak memory consumption was 149.0MB. Max. memory is 16.1GB. [2023-11-23 08:39:35,283 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:39:35,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2828.48ms. Allocated memory was 155.2MB in the beginning and 222.3MB in the end (delta: 67.1MB). Free memory was 86.6MB in the beginning and 88.0MB in the end (delta: -1.4MB). Peak memory consumption was 122.5MB. Max. memory is 16.1GB. [2023-11-23 08:39:35,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 198.51ms. Allocated memory is still 222.3MB. Free memory was 88.0MB in the beginning and 153.1MB in the end (delta: -65.1MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2023-11-23 08:39:35,284 INFO L158 Benchmark]: Boogie Preprocessor took 96.35ms. Allocated memory is still 222.3MB. Free memory was 153.1MB in the beginning and 145.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 08:39:35,284 INFO L158 Benchmark]: RCFGBuilder took 1160.61ms. Allocated memory is still 222.3MB. Free memory was 144.7MB in the beginning and 97.6MB in the end (delta: 47.1MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2023-11-23 08:39:35,284 INFO L158 Benchmark]: TraceAbstraction took 134650.20ms. Allocated memory was 222.3MB in the beginning and 557.8MB in the end (delta: 335.5MB). Free memory was 96.5MB in the beginning and 467.3MB in the end (delta: -370.7MB). Peak memory consumption was 280.5MB. Max. memory is 16.1GB. [2023-11-23 08:39:35,284 INFO L158 Benchmark]: Witness Printer took 366.88ms. Allocated memory is still 557.8MB. Free memory was 467.3MB in the beginning and 339.3MB in the end (delta: 127.9MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. [2023-11-23 08:39:35,286 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2828.48ms. Allocated memory was 155.2MB in the beginning and 222.3MB in the end (delta: 67.1MB). Free memory was 86.6MB in the beginning and 88.0MB in the end (delta: -1.4MB). Peak memory consumption was 122.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 198.51ms. Allocated memory is still 222.3MB. Free memory was 88.0MB in the beginning and 153.1MB in the end (delta: -65.1MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.35ms. Allocated memory is still 222.3MB. Free memory was 153.1MB in the beginning and 145.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1160.61ms. Allocated memory is still 222.3MB. Free memory was 144.7MB in the beginning and 97.6MB in the end (delta: 47.1MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * TraceAbstraction took 134650.20ms. Allocated memory was 222.3MB in the beginning and 557.8MB in the end (delta: 335.5MB). Free memory was 96.5MB in the beginning and 467.3MB in the end (delta: -370.7MB). Peak memory consumption was 280.5MB. Max. memory is 16.1GB. * Witness Printer took 366.88ms. Allocated memory is still 557.8MB. Free memory was 467.3MB in the beginning and 339.3MB in the end (delta: 127.9MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 7558]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7558-7569] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 20 procedures, 197 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 134.6s, OverallIterations: 7, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 97.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 2059 SdHoareTripleChecker+Valid, 77.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1997 mSDsluCounter, 5442 SdHoareTripleChecker+Invalid, 75.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1607 IncrementalHoareTripleChecker+Unchecked, 4422 mSDsCounter, 1043 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11973 IncrementalHoareTripleChecker+Invalid, 14641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1043 mSolverCounterUnsat, 1020 mSDtfsCounter, 11973 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1804 GetRequests, 1582 SyntacticMatches, 38 SemanticMatches, 184 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3433 ImplicationChecksByTransitivity, 31.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=6, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 42 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 600 PreInvPairs, 621 NumberOfFragments, 2388 HoareAnnotationTreeSize, 600 FomulaSimplifications, 568 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 76 FomulaSimplificationsInter, 7115 FormulaSimplificationTreeSizeReductionInter, 10.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 2227 NumberOfCodeBlocks, 2227 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2249 ConstructedInterpolants, 145 QuantifiedInterpolants, 12313 SizeOfPredicates, 35 NumberOfNonLiveVariables, 12784 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 7311/7758 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9142]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9617]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9639]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9640]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-23 08:39:35,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE