./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_string_eq_c_str_ignore_case_harness.i --full-output --preprocessor.use.memory.slicer true --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_string_eq_c_str_ignore_case_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 6334acf6662f715682aa436867bb49f37f46bbf05c989a8d5c50953f6022f7ef --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:48:19,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:48:19,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:48:19,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:48:19,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:48:19,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:48:19,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:48:19,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:48:19,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:48:19,847 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:48:19,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:48:19,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:48:19,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:48:19,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:48:19,849 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:48:19,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:48:19,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:48:19,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:48:19,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:48:19,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:48:19,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:48:19,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:48:19,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:48:19,851 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:48:19,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:48:19,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:48:19,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:48:19,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:48:19,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:48:19,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:48:19,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:48:19,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:48:19,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:48:19,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:48:19,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:48:19,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:48:19,854 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:48:19,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:48:19,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:48:19,855 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 -> 6334acf6662f715682aa436867bb49f37f46bbf05c989a8d5c50953f6022f7ef Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:48:20,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:48:20,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:48:20,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:48:20,118 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:48:20,119 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:48:20,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_string_eq_c_str_ignore_case_harness.i [2023-11-23 07:48:21,129 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:48:21,524 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:48:21,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_c_str_ignore_case_harness.i [2023-11-23 07:48:21,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86341e96/a8f7d6c153f3411abf3af1fe2f7d18a6/FLAG4373ef47d [2023-11-23 07:48:21,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86341e96/a8f7d6c153f3411abf3af1fe2f7d18a6 [2023-11-23 07:48:21,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:48:21,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:48:21,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:48:21,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:48:21,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:48:21,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:48:21" (1/1) ... [2023-11-23 07:48:21,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c8a038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:21, skipping insertion in model container [2023-11-23 07:48:21,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:48:21" (1/1) ... [2023-11-23 07:48:21,698 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:48:21,947 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_string_eq_c_str_ignore_case_harness.i[4505,4518] [2023-11-23 07:48:21,953 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_string_eq_c_str_ignore_case_harness.i[4565,4578] [2023-11-23 07:48:22,530 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:22,532 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:22,534 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:22,535 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:22,536 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:22,558 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:22,558 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:22,559 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:22,560 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:22,773 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:48:22,774 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:48:22,774 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:48:22,775 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:48:22,776 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:48:22,777 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:48:22,777 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:48:22,779 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:48:22,780 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:48:22,781 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:48:22,994 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:22,995 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:23,005 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:48:23,045 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:48:23,061 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_string_eq_c_str_ignore_case_harness.i[4505,4518] [2023-11-23 07:48:23,062 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_string_eq_c_str_ignore_case_harness.i[4565,4578] [2023-11-23 07:48:23,093 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:23,093 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:23,094 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:23,094 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:23,095 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:23,110 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:23,110 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:23,111 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:23,112 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:23,180 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:48:23,182 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:48:23,182 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:48:23,183 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:48:23,184 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:48:23,184 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:48:23,185 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:48:23,185 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:48:23,186 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:48:23,186 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:48:23,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8588] [2023-11-23 07:48:23,258 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:23,259 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:48:23,271 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:48:23,423 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,423 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,423 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,423 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,424 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,424 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,424 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,424 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,425 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,425 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,425 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,425 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,425 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,425 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,426 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,426 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,426 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:48:23,432 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:48:23,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:23 WrapperNode [2023-11-23 07:48:23,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:48:23,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:48:23,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:48:23,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:48:23,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:23" (1/1) ... [2023-11-23 07:48:23,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:23" (1/1) ... [2023-11-23 07:48:23,593 INFO L138 Inliner]: procedures = 680, calls = 2272, calls flagged for inlining = 59, calls inlined = 7, statements flattened = 372 [2023-11-23 07:48:23,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:48:23,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:48:23,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:48:23,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:48:23,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:23" (1/1) ... [2023-11-23 07:48:23,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:23" (1/1) ... [2023-11-23 07:48:23,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:23" (1/1) ... [2023-11-23 07:48:23,653 INFO L188 MemorySlicer]: Split 277 memory accesses to 4 slices as follows [2, 12, 5, 258]. 93 percent of accesses are in the largest equivalence class. The 263 initializations are split as follows [2, 0, 5, 256]. The 3 writes are split as follows [0, 3, 0, 0]. [2023-11-23 07:48:23,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:23" (1/1) ... [2023-11-23 07:48:23,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:23" (1/1) ... [2023-11-23 07:48:23,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:23" (1/1) ... [2023-11-23 07:48:23,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:23" (1/1) ... [2023-11-23 07:48:23,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:23" (1/1) ... [2023-11-23 07:48:23,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:23" (1/1) ... [2023-11-23 07:48:23,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:48:23,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:48:23,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:48:23,712 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:48:23,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:23" (1/1) ... [2023-11-23 07:48:23,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:48:23,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:48:23,736 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 07:48:23,774 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 07:48:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2023-11-23 07:48:23,796 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2023-11-23 07:48:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2023-11-23 07:48:23,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2023-11-23 07:48:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 07:48:23,797 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 07:48:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 07:48:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 07:48:23,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 07:48:23,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 07:48:23,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:48:23,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:48:23,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:48:23,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:48:23,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:48:23,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:48:23,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:48:23,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 07:48:23,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:48:23,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:48:23,799 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 07:48:23,799 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 07:48:23,799 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:48:23,800 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:48:23,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:48:23,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:48:23,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:48:23,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 07:48:23,800 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-23 07:48:23,801 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-23 07:48:23,801 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:48:23,801 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:48:23,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 07:48:23,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 07:48:23,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 07:48:23,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 07:48:23,801 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_c_str_ignore_case [2023-11-23 07:48:23,801 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_c_str_ignore_case [2023-11-23 07:48:23,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:48:23,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:48:23,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:48:23,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 07:48:24,022 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:48:24,023 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:48:24,291 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:48:24,389 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:48:24,408 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 07:48:24,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:48:24 BoogieIcfgContainer [2023-11-23 07:48:24,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:48:24,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:48:24,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:48:24,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:48:24,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:48:21" (1/3) ... [2023-11-23 07:48:24,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c516848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:48:24, skipping insertion in model container [2023-11-23 07:48:24,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:48:23" (2/3) ... [2023-11-23 07:48:24,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c516848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:48:24, skipping insertion in model container [2023-11-23 07:48:24,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:48:24" (3/3) ... [2023-11-23 07:48:24,416 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_eq_c_str_ignore_case_harness.i [2023-11-23 07:48:24,429 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:48:24,444 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:48:24,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:48:24,498 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;@3009dce5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:48:24,498 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:48:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 53 states have internal predecessors, (68), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 07:48:24,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 07:48:24,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:48:24,512 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:48:24,513 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:48:24,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:48:24,517 INFO L85 PathProgramCache]: Analyzing trace with hash 197895842, now seen corresponding path program 1 times [2023-11-23 07:48:24,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:48:24,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802348739] [2023-11-23 07:48:24,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:48:24,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:48:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:24,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:24,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 07:48:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:48:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:24,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:48:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 07:48:25,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:48:25,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802348739] [2023-11-23 07:48:25,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802348739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:48:25,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:48:25,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 07:48:25,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508762703] [2023-11-23 07:48:25,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:48:25,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:48:25,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:48:25,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:48:25,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:48:25,051 INFO L87 Difference]: Start difference. First operand has 85 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 53 states have internal predecessors, (68), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 07:48:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:48:25,102 INFO L93 Difference]: Finished difference Result 162 states and 225 transitions. [2023-11-23 07:48:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:48:25,104 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2023-11-23 07:48:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:48:25,110 INFO L225 Difference]: With dead ends: 162 [2023-11-23 07:48:25,110 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 07:48:25,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:48:25,114 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:48:25,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:48:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 07:48:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-23 07:48:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 07:48:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2023-11-23 07:48:25,175 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 32 [2023-11-23 07:48:25,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:48:25,177 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2023-11-23 07:48:25,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 07:48:25,177 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2023-11-23 07:48:25,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 07:48:25,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:48:25,179 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:48:25,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:48:25,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:48:25,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:48:25,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1796248864, now seen corresponding path program 1 times [2023-11-23 07:48:25,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:48:25,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717581271] [2023-11-23 07:48:25,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:48:25,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:48:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:25,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:25,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 07:48:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:25,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:48:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:25,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:48:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 07:48:25,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:48:25,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717581271] [2023-11-23 07:48:25,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717581271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:48:25,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:48:25,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 07:48:25,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960293175] [2023-11-23 07:48:25,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:48:25,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:48:25,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:48:25,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:48:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:48:25,483 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 07:48:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:48:25,576 INFO L93 Difference]: Finished difference Result 122 states and 160 transitions. [2023-11-23 07:48:25,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 07:48:25,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2023-11-23 07:48:25,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:48:25,579 INFO L225 Difference]: With dead ends: 122 [2023-11-23 07:48:25,579 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 07:48:25,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:48:25,582 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:48:25,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 275 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:48:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 07:48:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-23 07:48:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 51 states have internal predecessors, (61), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 07:48:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2023-11-23 07:48:25,596 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 32 [2023-11-23 07:48:25,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:48:25,596 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2023-11-23 07:48:25,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 07:48:25,597 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2023-11-23 07:48:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-23 07:48:25,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:48:25,599 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:48:25,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 07:48:25,600 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:48:25,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:48:25,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1356894865, now seen corresponding path program 1 times [2023-11-23 07:48:25,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:48:25,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414737439] [2023-11-23 07:48:25,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:48:25,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:48:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:25,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:25,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:48:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:26,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:26,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:48:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:26,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:48:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:26,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:26,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:48:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:26,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:48:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:26,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:48:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:26,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 07:48:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-23 07:48:26,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:48:26,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414737439] [2023-11-23 07:48:26,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414737439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:48:26,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:48:26,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 07:48:26,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369934440] [2023-11-23 07:48:26,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:48:26,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 07:48:26,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:48:26,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 07:48:26,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:48:26,173 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 07:48:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:48:26,585 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2023-11-23 07:48:26,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:48:26,586 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 61 [2023-11-23 07:48:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:48:26,591 INFO L225 Difference]: With dead ends: 122 [2023-11-23 07:48:26,591 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 07:48:26,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:48:26,599 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 393 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.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:48:26,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 393 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 07:48:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 07:48:26,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-23 07:48:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 07:48:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2023-11-23 07:48:26,617 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 61 [2023-11-23 07:48:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:48:26,618 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2023-11-23 07:48:26,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 07:48:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2023-11-23 07:48:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 07:48:26,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:48:26,622 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:48:26,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 07:48:26,622 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:48:26,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:48:26,623 INFO L85 PathProgramCache]: Analyzing trace with hash 132856046, now seen corresponding path program 1 times [2023-11-23 07:48:26,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:48:26,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215161468] [2023-11-23 07:48:26,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:48:26,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:48:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:26,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:48:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:48:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:48:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:48:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:48:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:48:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:48:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:48:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-23 07:48:27,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:48:27,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215161468] [2023-11-23 07:48:27,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215161468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:48:27,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:48:27,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 07:48:27,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026139922] [2023-11-23 07:48:27,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:48:27,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 07:48:27,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:48:27,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 07:48:27,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:48:27,235 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand has 13 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-23 07:48:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:48:27,626 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2023-11-23 07:48:27,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:48:27,627 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) Word has length 69 [2023-11-23 07:48:27,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:48:27,628 INFO L225 Difference]: With dead ends: 102 [2023-11-23 07:48:27,631 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 07:48:27,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:48:27,633 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:48:27,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 373 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:48:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 07:48:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-23 07:48:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.18) internal successors, (59), 51 states have internal predecessors, (59), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 07:48:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2023-11-23 07:48:27,641 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 69 [2023-11-23 07:48:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:48:27,642 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2023-11-23 07:48:27,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-23 07:48:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2023-11-23 07:48:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 07:48:27,643 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:48:27,643 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:48:27,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 07:48:27,644 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:48:27,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:48:27,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1017150792, now seen corresponding path program 1 times [2023-11-23 07:48:27,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:48:27,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329444928] [2023-11-23 07:48:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:48:27,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:48:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:48:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:48:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:48:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:48:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:48:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:48:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:48:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:48:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-23 07:48:27,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:48:27,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329444928] [2023-11-23 07:48:27,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329444928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:48:27,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:48:27,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:48:27,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793637588] [2023-11-23 07:48:27,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:48:27,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:48:27,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:48:27,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:48:27,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:48:27,911 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-23 07:48:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:48:28,132 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2023-11-23 07:48:28,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:48:28,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 70 [2023-11-23 07:48:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:48:28,134 INFO L225 Difference]: With dead ends: 112 [2023-11-23 07:48:28,134 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 07:48:28,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:48:28,135 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:48:28,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 192 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:48:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 07:48:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-23 07:48:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 07:48:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2023-11-23 07:48:28,143 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 70 [2023-11-23 07:48:28,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:48:28,143 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2023-11-23 07:48:28,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-23 07:48:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2023-11-23 07:48:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-23 07:48:28,144 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:48:28,144 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:48:28,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 07:48:28,145 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:48:28,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:48:28,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1726300381, now seen corresponding path program 1 times [2023-11-23 07:48:28,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:48:28,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629942216] [2023-11-23 07:48:28,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:48:28,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:48:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:48:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:48:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:48:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:48:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:48:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 07:48:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:48:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:48:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:48:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:48:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 07:48:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 07:48:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-11-23 07:48:28,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:48:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629942216] [2023-11-23 07:48:28,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629942216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:48:28,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:48:28,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-23 07:48:28,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823045510] [2023-11-23 07:48:28,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:48:28,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 07:48:28,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:48:28,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 07:48:28,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:48:28,821 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 16 states, 14 states have (on average 2.642857142857143) internal successors, (37), 11 states have internal predecessors, (37), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 9 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-23 07:48:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:48:29,242 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2023-11-23 07:48:29,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 07:48:29,243 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.642857142857143) internal successors, (37), 11 states have internal predecessors, (37), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 9 states have call predecessors, (15), 6 states have call successors, (15) Word has length 95 [2023-11-23 07:48:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:48:29,243 INFO L225 Difference]: With dead ends: 102 [2023-11-23 07:48:29,244 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 07:48:29,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2023-11-23 07:48:29,244 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 80 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:48:29,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 355 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 07:48:29,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 07:48:29,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-23 07:48:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.14) internal successors, (57), 51 states have internal predecessors, (57), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 07:48:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2023-11-23 07:48:29,251 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 95 [2023-11-23 07:48:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:48:29,252 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2023-11-23 07:48:29,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.642857142857143) internal successors, (37), 11 states have internal predecessors, (37), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 9 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-23 07:48:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2023-11-23 07:48:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 07:48:29,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:48:29,253 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:48:29,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 07:48:29,253 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:48:29,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:48:29,253 INFO L85 PathProgramCache]: Analyzing trace with hash 884702758, now seen corresponding path program 1 times [2023-11-23 07:48:29,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:48:29,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797562892] [2023-11-23 07:48:29,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:48:29,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:48:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:48:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:48:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:48:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:48:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:48:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 07:48:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:48:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:48:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:48:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:48:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 07:48:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 07:48:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 07:48:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 07:48:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:29,574 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2023-11-23 07:48:29,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:48:29,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797562892] [2023-11-23 07:48:29,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797562892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:48:29,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:48:29,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 07:48:29,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343516186] [2023-11-23 07:48:29,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:48:29,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:48:29,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:48:29,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:48:29,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:48:29,576 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-23 07:48:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:48:29,893 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2023-11-23 07:48:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:48:29,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2023-11-23 07:48:29,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:48:29,894 INFO L225 Difference]: With dead ends: 105 [2023-11-23 07:48:29,894 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 07:48:29,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:48:29,895 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:48:29,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 262 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:48:29,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 07:48:29,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-23 07:48:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 07:48:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2023-11-23 07:48:29,902 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 113 [2023-11-23 07:48:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:48:29,902 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2023-11-23 07:48:29,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-23 07:48:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2023-11-23 07:48:29,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 07:48:29,903 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:48:29,903 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:48:29,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 07:48:29,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:48:29,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:48:29,904 INFO L85 PathProgramCache]: Analyzing trace with hash 585384947, now seen corresponding path program 1 times [2023-11-23 07:48:29,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:48:29,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328368682] [2023-11-23 07:48:29,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:48:29,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:48:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:48:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:48:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:48:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:48:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:48:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 07:48:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:48:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:48:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:48:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:48:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 07:48:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:33,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 07:48:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:34,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:48:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:34,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 07:48:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:34,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 07:48:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-11-23 07:48:34,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:48:34,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328368682] [2023-11-23 07:48:34,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328368682] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:48:34,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472627872] [2023-11-23 07:48:34,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:48:34,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:48:34,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:48:34,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:48:34,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 07:48:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:48:34,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-23 07:48:34,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:48:34,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 43 [2023-11-23 07:48:34,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:48:34,913 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-23 07:48:34,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2023-11-23 07:48:34,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-23 07:48:34,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:48:34,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-11-23 07:48:55,009 WARN L293 SmtUtils]: Spent 11.60s on a formula simplification. DAG size of input: 552 DAG size of output: 356 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-23 07:48:55,011 INFO L349 Elim1Store]: treesize reduction 984, result has 44.6 percent of original size [2023-11-23 07:48:55,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 1 disjoint index pairs (out of 171 index pairs), introduced 29 new quantified variables, introduced 171 case distinctions, treesize of input 455 treesize of output 1080 [2023-11-23 07:49:37,302 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:49:39,596 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:49:40,145 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-23 07:49:40,278 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:49:40,436 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:49:40,720 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:49:41,241 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:49:42,471 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:49:44,242 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:49:47,613 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:49:55,000 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:49:59,731 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:02,803 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:04,827 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:05,873 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:06,122 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:06,359 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-23 07:50:06,390 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:06,620 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:06,954 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:09,796 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:17,682 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:23,908 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:25,023 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:25,513 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-23 07:50:25,661 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:25,804 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:26,072 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:26,836 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:29,732 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:33,216 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:41,089 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:50:48,924 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-23 07:52:45,968 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-23 07:52:45,970 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-23 07:52:45,974 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 101 [2023-11-23 07:52:45,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 07:52:46,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:52:46,174 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 67 more [2023-11-23 07:52:46,183 INFO L158 Benchmark]: Toolchain (without parser) took 264610.91ms. Allocated memory was 178.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 101.5MB in the beginning and 843.8MB in the end (delta: -742.3MB). Peak memory consumption was 820.4MB. Max. memory is 16.1GB. [2023-11-23 07:52:46,184 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 07:52:46,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1857.99ms. Allocated memory is still 178.3MB. Free memory was 101.3MB in the beginning and 114.2MB in the end (delta: -12.9MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2023-11-23 07:52:46,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 159.47ms. Allocated memory is still 178.3MB. Free memory was 114.2MB in the beginning and 105.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-23 07:52:46,184 INFO L158 Benchmark]: Boogie Preprocessor took 116.48ms. Allocated memory is still 178.3MB. Free memory was 105.8MB in the beginning and 98.4MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 07:52:46,184 INFO L158 Benchmark]: RCFGBuilder took 697.34ms. Allocated memory was 178.3MB in the beginning and 283.1MB in the end (delta: 104.9MB). Free memory was 98.4MB in the beginning and 215.1MB in the end (delta: -116.6MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. [2023-11-23 07:52:46,184 INFO L158 Benchmark]: TraceAbstraction took 261772.66ms. Allocated memory was 283.1MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 215.1MB in the beginning and 843.8MB in the end (delta: -628.8MB). Peak memory consumption was 828.7MB. Max. memory is 16.1GB. [2023-11-23 07:52:46,185 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.14ms. Allocated memory is still 104.9MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1857.99ms. Allocated memory is still 178.3MB. Free memory was 101.3MB in the beginning and 114.2MB in the end (delta: -12.9MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 159.47ms. Allocated memory is still 178.3MB. Free memory was 114.2MB in the beginning and 105.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.48ms. Allocated memory is still 178.3MB. Free memory was 105.8MB in the beginning and 98.4MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 697.34ms. Allocated memory was 178.3MB in the beginning and 283.1MB in the end (delta: 104.9MB). Free memory was 98.4MB in the beginning and 215.1MB in the end (delta: -116.6MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. * TraceAbstraction took 261772.66ms. Allocated memory was 283.1MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 215.1MB in the beginning and 843.8MB in the end (delta: -628.8MB). Peak memory consumption was 828.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8588]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8588] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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_string_eq_c_str_ignore_case_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 6334acf6662f715682aa436867bb49f37f46bbf05c989a8d5c50953f6022f7ef --preprocessor.use.memory.slicer true --- Real Ultimate output --- Killed by 15