./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_hash_callback_c_str_eq_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_callback_c_str_eq_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:36:44,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:36:44,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:36:44,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:36:44,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:36:44,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:36:44,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:36:44,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:36:44,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:36:44,777 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:36:44,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:36:44,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:36:44,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:36:44,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:36:44,779 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:36:44,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:36:44,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:36:44,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:36:44,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:36:44,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:36:44,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:36:44,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:36:44,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:36:44,781 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:36:44,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:36:44,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:36:44,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:36:44,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:36:44,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:36:44,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:36:44,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:36:44,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:36:44,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:36:44,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:36:44,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:36:44,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:36:44,784 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:36:44,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:36:44,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:36:44,785 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 -> e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:36:44,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:36:45,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:36:45,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:36:45,006 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:36:45,006 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:36:45,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2023-11-23 08:36:46,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:36:46,580 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:36:46,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2023-11-23 08:36:46,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/786b648f5/0cf1c7c7b45b41d7bf329cac9b782918/FLAG905d16866 [2023-11-23 08:36:46,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/786b648f5/0cf1c7c7b45b41d7bf329cac9b782918 [2023-11-23 08:36:46,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:36:46,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:36:46,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:36:46,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:36:46,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:36:46,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:46" (1/1) ... [2023-11-23 08:36:46,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fd4ce36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:46, skipping insertion in model container [2023-11-23 08:36:46,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:46" (1/1) ... [2023-11-23 08:36:46,761 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:36:47,010 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_callback_c_str_eq_harness.i[4500,4513] [2023-11-23 08:36:47,017 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_callback_c_str_eq_harness.i[4560,4573] [2023-11-23 08:36:47,847 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:47,848 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:47,848 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:47,849 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:47,849 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:47,858 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:47,859 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:47,860 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:47,861 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,292 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:36:48,293 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:36:48,294 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:36:48,297 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:36:48,301 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:36:48,302 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:36:48,302 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:36:48,303 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:36:48,305 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:36:48,307 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:36:48,562 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,565 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,776 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,777 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,796 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,796 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,800 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,801 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,812 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,813 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,813 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,814 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,814 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,815 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,816 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:36:48,893 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:36:48,910 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_callback_c_str_eq_harness.i[4500,4513] [2023-11-23 08:36:48,910 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_callback_c_str_eq_harness.i[4560,4573] [2023-11-23 08:36:48,945 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,945 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,945 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,946 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,946 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,952 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,952 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,954 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:48,954 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,039 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:36:49,040 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:36:49,040 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:36:49,041 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:36:49,041 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:36:49,041 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:36:49,041 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:36:49,042 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:36:49,042 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:36:49,042 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:36:49,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8255] [2023-11-23 08:36:49,150 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,151 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,188 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,188 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,192 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,192 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,194 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,194 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,198 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,199 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,199 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,199 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,199 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,200 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,200 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:36:49,220 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:36:49,396 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,397 WARN L675 CHandler]: The function equals_fn is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,397 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,397 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,397 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,397 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,397 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,397 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,397 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,398 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,398 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,398 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,398 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,398 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,398 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,398 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,398 WARN L675 CHandler]: The function callback is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,398 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,398 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:36:49,406 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:36:49,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:49 WrapperNode [2023-11-23 08:36:49,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:36:49,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:36:49,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:36:49,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:36:49,413 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:36:49" (1/1) ... [2023-11-23 08:36:49,505 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:36:49" (1/1) ... [2023-11-23 08:36:49,566 INFO L138 Inliner]: procedures = 766, calls = 3255, calls flagged for inlining = 78, calls inlined = 5, statements flattened = 337 [2023-11-23 08:36:49,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:36:49,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:36:49,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:36:49,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:36:49,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:49" (1/1) ... [2023-11-23 08:36:49,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:49" (1/1) ... [2023-11-23 08:36:49,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:49" (1/1) ... [2023-11-23 08:36:49,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:49" (1/1) ... [2023-11-23 08:36:49,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:49" (1/1) ... [2023-11-23 08:36:49,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:49" (1/1) ... [2023-11-23 08:36:49,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:49" (1/1) ... [2023-11-23 08:36:49,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:49" (1/1) ... [2023-11-23 08:36:49,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:36:49,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:36:49,635 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:36:49,635 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:36:49,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:49" (1/1) ... [2023-11-23 08:36:49,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:36:49,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:36:49,680 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:36:49,729 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:36:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 08:36:49,775 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 08:36:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 08:36:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:36:49,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:36:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:36:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:36:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:36:49,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:36:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 08:36:49,776 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 08:36:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:36:49,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:36:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:36:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:36:49,777 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:36:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2023-11-23 08:36:49,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2023-11-23 08:36:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2023-11-23 08:36:49,778 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2023-11-23 08:36:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:36:49,952 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:36:49,953 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:36:50,196 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2023-11-23 08:36:50,206 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:36:50,250 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:36:50,250 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 08:36:50,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:50 BoogieIcfgContainer [2023-11-23 08:36:50,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:36:50,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:36:50,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:36:50,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:36:50,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:36:46" (1/3) ... [2023-11-23 08:36:50,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c674f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:36:50, skipping insertion in model container [2023-11-23 08:36:50,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:49" (2/3) ... [2023-11-23 08:36:50,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c674f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:36:50, skipping insertion in model container [2023-11-23 08:36:50,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:50" (3/3) ... [2023-11-23 08:36:50,259 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2023-11-23 08:36:50,271 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:36:50,272 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:36:50,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:36:50,321 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;@4b02e768, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:36:50,322 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:36:50,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-23 08:36:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-23 08:36:50,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:36:50,335 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-23 08:36:50,337 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:36:50,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:36:50,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1088117072, now seen corresponding path program 1 times [2023-11-23 08:36:50,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:36:50,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478030275] [2023-11-23 08:36:50,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:36:50,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:36:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:50,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:50,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:50,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:36:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:50,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:36:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:50,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:50,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:36:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:50,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:36:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:36:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:50,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:36:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:50,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:36:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:50,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:36:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-23 08:36:50,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:36:50,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478030275] [2023-11-23 08:36:50,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478030275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:36:50,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:36:50,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 08:36:50,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180105571] [2023-11-23 08:36:50,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:36:50,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 08:36:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:36:50,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 08:36:50,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 08:36:50,911 INFO L87 Difference]: Start difference. First operand has 63 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-23 08:36:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:36:51,030 INFO L93 Difference]: Finished difference Result 124 states and 171 transitions. [2023-11-23 08:36:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 08:36:51,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 60 [2023-11-23 08:36:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:36:51,042 INFO L225 Difference]: With dead ends: 124 [2023-11-23 08:36:51,042 INFO L226 Difference]: Without dead ends: 59 [2023-11-23 08:36:51,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 08:36:51,051 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:36:51,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 84 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:36:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-23 08:36:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-23 08:36:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-23 08:36:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2023-11-23 08:36:51,092 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 60 [2023-11-23 08:36:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:36:51,093 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2023-11-23 08:36:51,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-23 08:36:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2023-11-23 08:36:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-23 08:36:51,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:36:51,098 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:36:51,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:36:51,098 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:36:51,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:36:51,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1083176190, now seen corresponding path program 1 times [2023-11-23 08:36:51,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:36:51,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593570153] [2023-11-23 08:36:51,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:36:51,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:36:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:51,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:51,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:51,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:36:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:51,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:36:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:51,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:51,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:36:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:51,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:36:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:51,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:36:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:51,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:36:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:51,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:36:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:52,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:36:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:52,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:36:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-23 08:36:52,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:36:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593570153] [2023-11-23 08:36:52,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593570153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:36:52,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:36:52,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 08:36:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339668773] [2023-11-23 08:36:52,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:36:52,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 08:36:52,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:36:52,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 08:36:52,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:36:52,127 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 13 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-23 08:36:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:36:52,474 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2023-11-23 08:36:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 08:36:52,474 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 62 [2023-11-23 08:36:52,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:36:52,476 INFO L225 Difference]: With dead ends: 82 [2023-11-23 08:36:52,476 INFO L226 Difference]: Without dead ends: 59 [2023-11-23 08:36:52,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:36:52,479 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 37 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:36:52,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 377 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:36:52,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-23 08:36:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-23 08:36:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.0625) internal successors, (34), 33 states have internal predecessors, (34), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-23 08:36:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2023-11-23 08:36:52,496 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 62 [2023-11-23 08:36:52,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:36:52,497 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2023-11-23 08:36:52,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-23 08:36:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2023-11-23 08:36:52,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-23 08:36:52,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:36:52,500 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:36:52,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 08:36:52,500 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:36:52,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:36:52,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1900894622, now seen corresponding path program 1 times [2023-11-23 08:36:52,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:36:52,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074785396] [2023-11-23 08:36:52,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:36:52,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:36:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:53,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:53,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:53,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:36:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:53,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:36:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:53,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:53,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:36:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:53,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:36:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:53,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:36:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:53,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:36:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:53,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:36:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:53,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:36:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:53,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:36:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:53,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:36:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-23 08:36:53,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:36:53,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074785396] [2023-11-23 08:36:53,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074785396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:36:53,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:36:53,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-23 08:36:53,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685230437] [2023-11-23 08:36:53,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:36:53,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 08:36:53,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:36:53,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 08:36:53,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2023-11-23 08:36:53,268 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 16 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-23 08:36:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:36:53,700 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2023-11-23 08:36:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-23 08:36:53,700 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) Word has length 66 [2023-11-23 08:36:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:36:53,701 INFO L225 Difference]: With dead ends: 80 [2023-11-23 08:36:53,701 INFO L226 Difference]: Without dead ends: 78 [2023-11-23 08:36:53,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2023-11-23 08:36:53,702 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 49 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:36:53,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 496 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:36:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-23 08:36:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-11-23 08:36:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 1.048780487804878) internal successors, (43), 43 states have internal predecessors, (43), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-23 08:36:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2023-11-23 08:36:53,710 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 66 [2023-11-23 08:36:53,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:36:53,710 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2023-11-23 08:36:53,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-23 08:36:53,711 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2023-11-23 08:36:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-23 08:36:53,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:36:53,712 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:36:53,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 08:36:53,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:36:53,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:36:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash -687008936, now seen corresponding path program 1 times [2023-11-23 08:36:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:36:53,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49716895] [2023-11-23 08:36:53,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:36:53,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:36:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:36:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:36:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:36:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:36:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:36:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:36:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:36:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:36:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:36:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:36:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:36:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-23 08:36:54,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:36:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49716895] [2023-11-23 08:36:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49716895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:36:54,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:36:54,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 08:36:54,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195379957] [2023-11-23 08:36:54,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:36:54,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 08:36:54,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:36:54,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 08:36:54,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:36:54,661 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2023-11-23 08:36:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:36:54,994 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2023-11-23 08:36:54,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 08:36:54,994 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 74 [2023-11-23 08:36:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:36:54,996 INFO L225 Difference]: With dead ends: 92 [2023-11-23 08:36:54,996 INFO L226 Difference]: Without dead ends: 90 [2023-11-23 08:36:54,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:36:54,997 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 41 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:36:54,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 426 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:36:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-23 08:36:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2023-11-23 08:36:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-23 08:36:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2023-11-23 08:36:55,005 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 74 [2023-11-23 08:36:55,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:36:55,005 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2023-11-23 08:36:55,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2023-11-23 08:36:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2023-11-23 08:36:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-23 08:36:55,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:36:55,007 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:36:55,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 08:36:55,007 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:36:55,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:36:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2043788151, now seen corresponding path program 1 times [2023-11-23 08:36:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:36:55,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182651444] [2023-11-23 08:36:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:36:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:36:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:36:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:36:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:36:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:36:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:36:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:36:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:36:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:36:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:36:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 08:36:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:36:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:36:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:36:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 08:36:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2023-11-23 08:36:55,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:36:55,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182651444] [2023-11-23 08:36:55,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182651444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:36:55,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:36:55,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-23 08:36:55,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361857639] [2023-11-23 08:36:55,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:36:55,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 08:36:55,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:36:55,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 08:36:55,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:36:55,808 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 15 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-23 08:36:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:36:56,155 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2023-11-23 08:36:56,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 08:36:56,156 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 95 [2023-11-23 08:36:56,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:36:56,158 INFO L225 Difference]: With dead ends: 90 [2023-11-23 08:36:56,158 INFO L226 Difference]: Without dead ends: 88 [2023-11-23 08:36:56,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2023-11-23 08:36:56,159 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 24 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:36:56,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 681 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:36:56,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-23 08:36:56,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-23 08:36:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.04) internal successors, (52), 52 states have internal predecessors, (52), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-23 08:36:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2023-11-23 08:36:56,166 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 95 [2023-11-23 08:36:56,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:36:56,167 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2023-11-23 08:36:56,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-23 08:36:56,167 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2023-11-23 08:36:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-23 08:36:56,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:36:56,168 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:36:56,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 08:36:56,169 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:36:56,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:36:56,169 INFO L85 PathProgramCache]: Analyzing trace with hash -102481043, now seen corresponding path program 1 times [2023-11-23 08:36:56,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:36:56,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651653478] [2023-11-23 08:36:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:36:56,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:36:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:36:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:36:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:36:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:36:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:36:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:36:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:36:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:36:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:36:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 08:36:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:36:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:56,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:36:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:57,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:36:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:57,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 08:36:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:57,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 08:36:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2023-11-23 08:36:57,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:36:57,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651653478] [2023-11-23 08:36:57,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651653478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:36:57,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:36:57,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-23 08:36:57,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909078258] [2023-11-23 08:36:57,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:36:57,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 08:36:57,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:36:57,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 08:36:57,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:36:57,020 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand has 15 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-23 08:36:57,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:36:57,306 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2023-11-23 08:36:57,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 08:36:57,307 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 103 [2023-11-23 08:36:57,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:36:57,308 INFO L225 Difference]: With dead ends: 94 [2023-11-23 08:36:57,308 INFO L226 Difference]: Without dead ends: 90 [2023-11-23 08:36:57,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:36:57,309 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:36:57,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 437 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:36:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-23 08:36:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2023-11-23 08:36:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-23 08:36:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2023-11-23 08:36:57,316 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 103 [2023-11-23 08:36:57,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:36:57,317 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2023-11-23 08:36:57,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-23 08:36:57,317 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2023-11-23 08:36:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-23 08:36:57,318 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:36:57,318 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 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] [2023-11-23 08:36:57,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 08:36:57,318 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:36:57,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:36:57,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2068456099, now seen corresponding path program 1 times [2023-11-23 08:36:57,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:36:57,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636113636] [2023-11-23 08:36:57,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:36:57,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:36:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:36:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:36:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:36:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:36:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:36:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:36:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:36:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:36:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:36:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:36:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:36:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:36:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:36:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:36:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 08:36:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:36:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-11-23 08:36:58,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:36:58,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636113636] [2023-11-23 08:36:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636113636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:36:58,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:36:58,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-23 08:36:58,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392789072] [2023-11-23 08:36:58,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:36:58,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 08:36:58,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:36:58,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 08:36:58,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:36:58,266 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 15 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) [2023-11-23 08:36:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:36:58,611 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2023-11-23 08:36:58,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 08:36:58,611 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) Word has length 90 [2023-11-23 08:36:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:36:58,612 INFO L225 Difference]: With dead ends: 96 [2023-11-23 08:36:58,612 INFO L226 Difference]: Without dead ends: 65 [2023-11-23 08:36:58,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:36:58,614 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 43 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:36:58,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 437 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:36:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-23 08:36:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-23 08:36:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.0) internal successors, (37), 37 states have internal predecessors, (37), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-23 08:36:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2023-11-23 08:36:58,630 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 90 [2023-11-23 08:36:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:36:58,630 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2023-11-23 08:36:58,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) [2023-11-23 08:36:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2023-11-23 08:36:58,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-23 08:36:58,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:36:58,632 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:36:58,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 08:36:58,633 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:36:58,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:36:58,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2018473800, now seen corresponding path program 1 times [2023-11-23 08:36:58,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:36:58,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92649982] [2023-11-23 08:36:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:36:58,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:36:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 08:36:58,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 08:36:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 08:36:58,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 08:36:58,946 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 08:36:58,947 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 08:36:58,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 08:36:58,950 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:36:58,953 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 08:36:58,977 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret551 could not be translated [2023-11-23 08:36:58,978 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret552 [2023-11-23 08:36:58,978 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem553 could not be translated [2023-11-23 08:36:58,979 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem553 could not be translated [2023-11-23 08:36:58,979 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret2169 [2023-11-23 08:36:58,979 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2170 could not be translated [2023-11-23 08:36:58,979 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2170 could not be translated [2023-11-23 08:36:58,980 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret551 could not be translated [2023-11-23 08:36:58,980 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret552 [2023-11-23 08:36:58,980 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem553 could not be translated [2023-11-23 08:36:58,981 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem553 could not be translated [2023-11-23 08:36:58,981 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2170 could not be translated [2023-11-23 08:36:58,981 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret2171 [2023-11-23 08:36:58,981 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2170 could not be translated [2023-11-23 08:36:58,981 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ite2172 [2023-11-23 08:36:58,982 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret2171 [2023-11-23 08:36:58,982 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2012 could not be translated [2023-11-23 08:36:58,982 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2012 could not be translated [2023-11-23 08:36:58,982 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2013 could not be translated [2023-11-23 08:36:58,983 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2013 could not be translated [2023-11-23 08:36:58,983 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2015 could not be translated [2023-11-23 08:36:58,983 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short2017 could not be translated [2023-11-23 08:36:58,983 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2015 could not be translated [2023-11-23 08:36:58,984 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2015 could not be translated [2023-11-23 08:36:58,984 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short2017 could not be translated [2023-11-23 08:36:58,984 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2016 could not be translated [2023-11-23 08:36:58,984 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2015 could not be translated [2023-11-23 08:36:58,984 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short2017 could not be translated [2023-11-23 08:36:58,984 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2016 could not be translated [2023-11-23 08:36:58,985 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2015 could not be translated [2023-11-23 08:36:58,985 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short2017 could not be translated [2023-11-23 08:36:58,985 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret2016 could not be translated [2023-11-23 08:36:58,986 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret597 could not be translated [2023-11-23 08:36:58,986 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem598 could not be translated [2023-11-23 08:36:58,986 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem599 could not be translated [2023-11-23 08:36:58,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:36:58 BoogieIcfgContainer [2023-11-23 08:36:58,997 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 08:36:58,997 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 08:36:58,997 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 08:36:58,997 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 08:36:58,998 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:50" (3/4) ... [2023-11-23 08:36:58,999 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 08:36:59,000 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 08:36:59,001 INFO L158 Benchmark]: Toolchain (without parser) took 12356.27ms. Allocated memory was 155.2MB in the beginning and 620.8MB in the end (delta: 465.6MB). Free memory was 69.7MB in the beginning and 323.0MB in the end (delta: -253.3MB). Peak memory consumption was 213.3MB. Max. memory is 16.1GB. [2023-11-23 08:36:59,001 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:36:59,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2760.15ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 69.4MB in the beginning and 109.1MB in the end (delta: -39.7MB). Peak memory consumption was 109.4MB. Max. memory is 16.1GB. [2023-11-23 08:36:59,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 160.35ms. Allocated memory is still 213.9MB. Free memory was 109.1MB in the beginning and 98.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-23 08:36:59,002 INFO L158 Benchmark]: Boogie Preprocessor took 65.72ms. Allocated memory is still 213.9MB. Free memory was 98.6MB in the beginning and 93.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 08:36:59,002 INFO L158 Benchmark]: RCFGBuilder took 617.28ms. Allocated memory is still 213.9MB. Free memory was 93.4MB in the beginning and 116.4MB in the end (delta: -23.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-11-23 08:36:59,002 INFO L158 Benchmark]: TraceAbstraction took 8743.94ms. Allocated memory was 213.9MB in the beginning and 620.8MB in the end (delta: 406.8MB). Free memory was 115.3MB in the beginning and 323.0MB in the end (delta: -207.6MB). Peak memory consumption was 198.2MB. Max. memory is 16.1GB. [2023-11-23 08:36:59,002 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 620.8MB. Free memory is still 323.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:36:59,003 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.16ms. Allocated memory is still 155.2MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2760.15ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 69.4MB in the beginning and 109.1MB in the end (delta: -39.7MB). Peak memory consumption was 109.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 160.35ms. Allocated memory is still 213.9MB. Free memory was 109.1MB in the beginning and 98.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.72ms. Allocated memory is still 213.9MB. Free memory was 98.6MB in the beginning and 93.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 617.28ms. Allocated memory is still 213.9MB. Free memory was 93.4MB in the beginning and 116.4MB in the end (delta: -23.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8743.94ms. Allocated memory was 213.9MB in the beginning and 620.8MB in the end (delta: 406.8MB). Free memory was 115.3MB in the beginning and 323.0MB in the end (delta: -207.6MB). Peak memory consumption was 198.2MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 620.8MB. Free memory is still 323.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8255]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8255] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret551 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret552 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem553 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem553 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret2169 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2170 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2170 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret551 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret552 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem553 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem553 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2170 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret2171 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2170 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ite2172 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret2171 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2012 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2012 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2013 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2013 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2015 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short2017 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2015 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2015 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short2017 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2016 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2015 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short2017 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2016 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2015 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short2017 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret2016 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret597 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem598 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem599 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 223]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of strcmp at line 10798, overapproximation of strlen at line 11324. Possible FailurePath: [L6879-L6884] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7634-L7646] static const uint8_t s_tolower_table[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 91, 92, 93, 94, 95, 96, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255}; [L11328] CALL aws_hash_callback_c_str_eq_harness() [L11318] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, size=1] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L6839] return str; [L11318] RET, EXPR ensure_c_str_is_allocated(64) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L11318] const char *str1 = ensure_c_str_is_allocated(64); [L11319] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L261] return __VERIFIER_nondet_bool(); [L11319] RET, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={-2:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={-2:0}] [L11319] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, size=1] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}] [L6839] return str; [L11319] RET, EXPR ensure_c_str_is_allocated(64) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={-2:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={-2:0}] [L11319] const char *str2 = nondet_bool() ? str1 : ensure_c_str_is_allocated(64); [L11322] CALL, EXPR aws_hash_callback_c_str_eq(str1, str2) [L10794] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); [L10794] RET, EXPR aws_c_string_is_valid(a) VAL [a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10794] CALL assume_abort_if_not((aws_c_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10794] RET assume_abort_if_not((aws_c_string_is_valid(a))) VAL [a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10795] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); [L10795] RET, EXPR aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10795] CALL assume_abort_if_not((aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10795] RET assume_abort_if_not((aws_c_string_is_valid(b))) VAL [a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10797-L10798] _Bool rval = !strcmp(a, b); [L10799] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); [L10799] RET, EXPR aws_c_string_is_valid(a) VAL [a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); [L10799] RET, EXPR aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] CALL __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] RET __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] return rval; VAL [\result=1, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L11322] RET, EXPR aws_hash_callback_c_str_eq(str1, str2) [L11321-L11322] _Bool rval = aws_hash_callback_c_str_eq(str1, str2); [L11323] COND TRUE \read(rval) [L11324] size_t len = strlen(str1); [L11325] CALL assert_bytes_match(str1, str2, len) [L7113] CALL __VERIFIER_assert(!a == !b) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7113] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7114-L7117] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7119] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L7119] RET, EXPR nondet_uint64_t() VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7119] size_t i = nondet_uint64_t(); [L7120-L7122] CALL assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7120-L7122] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, i=36028797018963965, len=36028797018963966, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, i=36028797018963965, len=36028797018963966, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7123] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 294 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 2938 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2592 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2911 IncrementalHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 346 mSDtfsCounter, 2911 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=5, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 669 NumberOfCodeBlocks, 669 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 543 ConstructedInterpolants, 0 QuantifiedInterpolants, 1565 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 556/556 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-23 08:36:59,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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_callback_c_str_eq_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:37:01,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:37:01,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-23 08:37:01,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:37:01,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:37:01,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:37:01,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:37:01,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:37:01,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:37:01,226 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:37:01,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:37:01,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:37:01,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:37:01,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:37:01,228 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:37:01,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:37:01,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:37:01,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:37:01,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:37:01,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:37:01,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:37:01,230 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 08:37:01,230 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 08:37:01,230 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 08:37:01,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:37:01,231 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:37:01,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:37:01,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:37:01,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:37:01,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:37:01,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:37:01,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:37:01,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:37:01,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:37:01,237 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 08:37:01,237 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 08:37:01,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:37:01,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:37:01,238 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:37:01,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:37:01,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:37:01,238 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 08:37:01,239 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 -> e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:37:01,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:37:01,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:37:01,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:37:01,549 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:37:01,549 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:37:01,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2023-11-23 08:37:02,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:37:03,112 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:37:03,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2023-11-23 08:37:03,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f9f62af1/a34c185364c1475fb521c10561941946/FLAGa5a75a06b [2023-11-23 08:37:03,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f9f62af1/a34c185364c1475fb521c10561941946 [2023-11-23 08:37:03,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:37:03,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:37:03,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:37:03,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:37:03,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:37:03,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:37:03" (1/1) ... [2023-11-23 08:37:03,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62597e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:03, skipping insertion in model container [2023-11-23 08:37:03,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:37:03" (1/1) ... [2023-11-23 08:37:03,331 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:37:03,569 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_callback_c_str_eq_harness.i[4500,4513] [2023-11-23 08:37:03,577 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_callback_c_str_eq_harness.i[4560,4573] [2023-11-23 08:37:04,342 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:04,345 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:04,346 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:04,347 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:04,348 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:04,360 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:04,360 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:04,362 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:04,362 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:04,727 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:37:04,728 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:37:04,728 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:37:04,729 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:37:04,730 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:37:04,730 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:37:04,731 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:37:04,731 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:37:04,731 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:37:04,732 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:37:04,891 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:04,891 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,125 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,126 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,150 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,150 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,158 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,158 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,172 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,173 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,174 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,174 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,174 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,175 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,175 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,242 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:37:05,288 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-23 08:37:05,350 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:37:05,354 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_callback_c_str_eq_harness.i[4500,4513] [2023-11-23 08:37:05,355 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_callback_c_str_eq_harness.i[4560,4573] [2023-11-23 08:37:05,393 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,393 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,396 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,396 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,396 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,402 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,402 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,402 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,403 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,440 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:37:05,441 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:37:05,441 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:37:05,442 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:37:05,442 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:37:05,442 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:37:05,443 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:37:05,443 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:37:05,443 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:37:05,444 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:37:05,530 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,533 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,579 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,580 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,584 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,585 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,587 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,588 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,593 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,594 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,594 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,595 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,595 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,595 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,595 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:37:05,684 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:37:05,700 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_callback_c_str_eq_harness.i[4500,4513] [2023-11-23 08:37:05,700 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_callback_c_str_eq_harness.i[4560,4573] [2023-11-23 08:37:05,731 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,731 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,731 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,731 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,732 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,738 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,739 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,739 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,739 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,756 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:37:05,757 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:37:05,758 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:37:05,758 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:37:05,758 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:37:05,759 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:37:05,759 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:37:05,759 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:37:05,760 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:37:05,760 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:37:05,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8255] [2023-11-23 08:37:05,803 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,803 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,899 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,899 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,903 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,903 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,921 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,922 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:37:05,924 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.countNumberOfPrimitiveElementInType(InitializationHandler.java:1056) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.lambda$3(InitializationHandler.java:1046) at java.base/java.util.stream.ReferencePipeline$5$1.accept(ReferencePipeline.java:229) at java.base/java.util.Spliterators$ArraySpliterator.forEachRemaining(Spliterators.java:948) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:913) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.LongPipeline.reduce(LongPipeline.java:474) at java.base/java.util.stream.LongPipeline.sum(LongPipeline.java:432) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.countNumberOfPrimitiveElementInType(InitializationHandler.java:1046) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.useConstArrayInitialization(InitializationHandler.java:1022) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:262) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:208) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleIASTDeclarator(CHandler.java:3027) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2209) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1156) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:306) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java:1088) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1073) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:320) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:383) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1512) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:275) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3421) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2441) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:611) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:258) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:242) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:204) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:147) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 08:37:05,930 INFO L158 Benchmark]: Toolchain (without parser) took 2756.70ms. Allocated memory was 60.8MB in the beginning and 123.7MB in the end (delta: 62.9MB). Free memory was 28.1MB in the beginning and 41.9MB in the end (delta: -13.9MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2023-11-23 08:37:05,930 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 50.3MB. Free memory was 25.2MB in the beginning and 25.1MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:37:05,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2752.48ms. Allocated memory was 60.8MB in the beginning and 123.7MB in the end (delta: 62.9MB). Free memory was 27.9MB in the beginning and 41.9MB in the end (delta: -14.0MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2023-11-23 08:37:05,934 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.19ms. Allocated memory is still 50.3MB. Free memory was 25.2MB in the beginning and 25.1MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2752.48ms. Allocated memory was 60.8MB in the beginning and 123.7MB in the end (delta: 62.9MB). Free memory was 27.9MB in the beginning and 41.9MB in the end (delta: -14.0MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8255]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8255] - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range