./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 74836a87661fce5875ab1ae94a73cbe51ee04e76d05fc1828decf2341972d635 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:12:12,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:12:12,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 05:12:12,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:12:12,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:12:12,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:12:12,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:12:12,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:12:12,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:12:12,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:12:12,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:12:12,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:12:12,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:12:12,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:12:12,164 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:12:12,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:12:12,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:12:12,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:12:12,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:12:12,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:12:12,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:12:12,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:12:12,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:12:12,165 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:12:12,165 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:12:12,165 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:12:12,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:12:12,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:12:12,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:12:12,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:12:12,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:12:12,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:12:12,166 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:12:12,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:12:12,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:12:12,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:12:12,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:12:12,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:12:12,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:12:12,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:12:12,167 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 74836a87661fce5875ab1ae94a73cbe51ee04e76d05fc1828decf2341972d635 [2025-02-06 05:12:12,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:12:12,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:12:12,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:12:12,411 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:12:12,411 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:12:12,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i [2025-02-06 05:12:13,599 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d565995ae/e4a7a175dfe442f09181620005c40401/FLAGaa3b15ba7 [2025-02-06 05:12:14,044 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:12:14,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i [2025-02-06 05:12:14,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d565995ae/e4a7a175dfe442f09181620005c40401/FLAGaa3b15ba7 [2025-02-06 05:12:14,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d565995ae/e4a7a175dfe442f09181620005c40401 [2025-02-06 05:12:14,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:12:14,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:12:14,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:12:14,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:12:14,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:12:14,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:12:14" (1/1) ... [2025-02-06 05:12:14,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3c5206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:14, skipping insertion in model container [2025-02-06 05:12:14,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:12:14" (1/1) ... [2025-02-06 05:12:14,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:12:14,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4495,4508] [2025-02-06 05:12:14,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4555,4568] [2025-02-06 05:12:14,951 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:14,952 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:14,952 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:14,952 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:14,953 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:14,961 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:14,962 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:14,963 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:14,963 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:14,964 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:14,965 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:14,965 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:14,966 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,668 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,669 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,703 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,703 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,714 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,715 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,732 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,733 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,734 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,735 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,735 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,735 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,736 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[229089,229102] [2025-02-06 05:12:15,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:12:15,803 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:12:15,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4495,4508] [2025-02-06 05:12:15,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4555,4568] [2025-02-06 05:12:15,846 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,846 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,847 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,847 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,847 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,853 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,854 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,854 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,855 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,855 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,856 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,856 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,856 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:15,970 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7576-7587] [2025-02-06 05:12:16,029 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:16,030 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:16,037 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:16,037 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:16,039 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:16,039 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:16,046 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:16,047 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:16,047 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:16,048 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:16,048 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:16,049 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:16,049 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:12:16,066 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[229089,229102] [2025-02-06 05:12:16,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:12:16,249 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:12:16,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:16 WrapperNode [2025-02-06 05:12:16,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:12:16,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:12:16,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:12:16,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:12:16,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:16" (1/1) ... [2025-02-06 05:12:16,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:16" (1/1) ... [2025-02-06 05:12:16,406 INFO L138 Inliner]: procedures = 764, calls = 2484, calls flagged for inlining = 68, calls inlined = 21, statements flattened = 1368 [2025-02-06 05:12:16,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:12:16,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:12:16,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:12:16,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:12:16,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:16" (1/1) ... [2025-02-06 05:12:16,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:16" (1/1) ... [2025-02-06 05:12:16,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:16" (1/1) ... [2025-02-06 05:12:16,443 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 05:12:16,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:16" (1/1) ... [2025-02-06 05:12:16,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:16" (1/1) ... [2025-02-06 05:12:16,491 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:16" (1/1) ... [2025-02-06 05:12:16,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:16" (1/1) ... [2025-02-06 05:12:16,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:16" (1/1) ... [2025-02-06 05:12:16,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:16" (1/1) ... [2025-02-06 05:12:16,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:12:16,537 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:12:16,538 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:12:16,538 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:12:16,538 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:16" (1/1) ... [2025-02-06 05:12:16,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:12:16,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:12:16,575 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 05:12:16,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 05:12:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-02-06 05:12:16,609 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-02-06 05:12:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 05:12:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2025-02-06 05:12:16,610 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2025-02-06 05:12:16,610 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2025-02-06 05:12:16,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2025-02-06 05:12:16,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:12:16,610 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-06 05:12:16,610 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-02-06 05:12:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-02-06 05:12:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-06 05:12:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 05:12:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_create [2025-02-06 05:12:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_create [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-02-06 05:12:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-02-06 05:12:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2025-02-06 05:12:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2025-02-06 05:12:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2025-02-06 05:12:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:12:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-02-06 05:12:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-02-06 05:12:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-06 05:12:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2025-02-06 05:12:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-02-06 05:12:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 05:12:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-02-06 05:12:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-02-06 05:12:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-06 05:12:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-06 05:12:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-02-06 05:12:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-06 05:12:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2025-02-06 05:12:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-02-06 05:12:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure uninterpreted_equals [2025-02-06 05:12:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure uninterpreted_equals [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-06 05:12:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 05:12:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-02-06 05:12:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-02-06 05:12:16,892 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:12:16,894 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:12:17,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6947: havoc #t~malloc588.base, #t~malloc588.offset; [2025-02-06 05:12:17,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10008: havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~short1492;havoc #t~mem1493.base, #t~mem1493.offset;havoc #t~ret1494;havoc #t~short1495; [2025-02-06 05:12:17,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-06 05:12:17,078 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10121: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-02-06 05:12:17,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6940: havoc bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset;call ULTIMATE.dealloc(bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset);havoc bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset; [2025-02-06 05:12:17,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6955: havoc #t~ret589#1;havoc #t~ite591#1.base, #t~ite591#1.offset;havoc #t~ret590#1.base, #t~ret590#1.offset; [2025-02-06 05:12:17,265 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-02-06 05:12:17,265 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9201: call ULTIMATE.dealloc(~#size~0#1.base, ~#size~0#1.offset);havoc ~#size~0#1.base, ~#size~0#1.offset; [2025-02-06 05:12:17,273 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6986: havoc #t~ret600.base, #t~ret600.offset; [2025-02-06 05:12:17,297 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9154-1: assume false; [2025-02-06 05:12:17,298 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9154-1: assume !false; [2025-02-06 05:12:17,312 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-02-06 05:12:17,316 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-06 05:12:17,334 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9115-1: assume false; [2025-02-06 05:12:17,335 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9115-1: assume !false; [2025-02-06 05:12:17,335 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7373: havoc uninterpreted_hasher_#t~ret689#1; [2025-02-06 05:12:17,359 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7356: havoc uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1; [2025-02-06 05:12:17,359 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7287: havoc nondet_compare_#t~ret677#1; [2025-02-06 05:12:17,359 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: havoc nondet_int_#t~nondet5#1; [2025-02-06 05:12:17,505 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9524: call ULTIMATE.dealloc(~#entry~4#1.base, ~#entry~4#1.offset);havoc ~#entry~4#1.base, ~#entry~4#1.offset;call ULTIMATE.dealloc(~#probe_idx~1#1.base, ~#probe_idx~1#1.offset);havoc ~#probe_idx~1#1.base, ~#probe_idx~1#1.offset;call ULTIMATE.dealloc(~#ignored~0#1.base, ~#ignored~0#1.offset);havoc ~#ignored~0#1.base, ~#ignored~0#1.offset;call ULTIMATE.dealloc(~#incr_entry_count~0#1.base, ~#incr_entry_count~0#1.offset);havoc ~#incr_entry_count~0#1.base, ~#incr_entry_count~0#1.offset;call ULTIMATE.dealloc(~#new_entry~0#1.base, ~#new_entry~0#1.offset);havoc ~#new_entry~0#1.base, ~#new_entry~0#1.offset; [2025-02-06 05:12:17,506 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9486: call ULTIMATE.dealloc(s_expand_table_~#template~1#1.base, s_expand_table_~#template~1#1.offset);havoc s_expand_table_~#template~1#1.base, s_expand_table_~#template~1#1.offset;call ULTIMATE.dealloc(s_expand_table_~#new_size~0#1.base, s_expand_table_~#new_size~0#1.offset);havoc s_expand_table_~#new_size~0#1.base, s_expand_table_~#new_size~0#1.offset; [2025-02-06 05:12:17,532 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9141: havoc #t~ret1142; [2025-02-06 05:12:17,701 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7009: call ULTIMATE.dealloc(aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset);havoc aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset; [2025-02-06 05:12:17,702 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9172: call ULTIMATE.dealloc(~#required_bytes~3#1.base, ~#required_bytes~3#1.offset);havoc ~#required_bytes~3#1.base, ~#required_bytes~3#1.offset; [2025-02-06 05:12:17,793 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9437-1: assume false; [2025-02-06 05:12:17,793 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9437-1: assume !false; [2025-02-06 05:12:17,793 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9478-1: assume false; [2025-02-06 05:12:17,793 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9478-1: assume !false; [2025-02-06 05:12:17,849 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9345: havoc #t~ret1203#1; [2025-02-06 05:12:17,865 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-02-06 05:12:17,874 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-02-06 05:12:23,001 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6833: havoc aws_hash_table_has_an_empty_slot_#t~mem566#1.base, aws_hash_table_has_an_empty_slot_#t~mem566#1.offset;havoc aws_hash_table_has_an_empty_slot_#t~ret567#1; [2025-02-06 05:12:23,001 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6843: havoc hash_table_state_has_an_empty_slot_#t~mem571#1; [2025-02-06 05:12:23,134 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2025-02-06 05:12:23,135 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:12:23,179 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:12:23,179 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:12:23,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:12:23 BoogieIcfgContainer [2025-02-06 05:12:23,180 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:12:23,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:12:23,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:12:23,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:12:23,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:12:14" (1/3) ... [2025-02-06 05:12:23,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6eb35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:12:23, skipping insertion in model container [2025-02-06 05:12:23,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:12:16" (2/3) ... [2025-02-06 05:12:23,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6eb35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:12:23, skipping insertion in model container [2025-02-06 05:12:23,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:12:23" (3/3) ... [2025-02-06 05:12:23,187 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_create_harness.i [2025-02-06 05:12:23,200 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:12:23,202 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_create_harness.i that has 31 procedures, 403 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-02-06 05:12:23,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:12:23,260 INFO L333 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, 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;@2c590641, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:12:23,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:12:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 403 states, 285 states have (on average 1.3157894736842106) internal successors, (375), 286 states have internal predecessors, (375), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-06 05:12:23,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 05:12:23,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:12:23,280 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:12:23,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:12:23,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:12:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash -359143993, now seen corresponding path program 1 times [2025-02-06 05:12:23,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:12:23,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361876111] [2025-02-06 05:12:23,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:12:23,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:12:27,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 05:12:28,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 05:12:28,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:12:28,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:12:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-02-06 05:12:28,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:12:28,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361876111] [2025-02-06 05:12:28,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361876111] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:12:28,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901062506] [2025-02-06 05:12:28,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:12:28,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:12:28,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:12:28,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:12:28,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 05:12:32,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 05:12:33,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 05:12:33,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:12:33,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:12:33,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 4407 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 05:12:33,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:12:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-06 05:12:33,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:12:33,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901062506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:12:33,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:12:33,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 05:12:33,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572828230] [2025-02-06 05:12:33,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:12:33,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 05:12:33,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:12:33,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 05:12:33,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:12:33,352 INFO L87 Difference]: Start difference. First operand has 403 states, 285 states have (on average 1.3157894736842106) internal successors, (375), 286 states have internal predecessors, (375), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 05:12:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:12:33,542 INFO L93 Difference]: Finished difference Result 800 states and 1146 transitions. [2025-02-06 05:12:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 05:12:33,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2025-02-06 05:12:33,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:12:33,561 INFO L225 Difference]: With dead ends: 800 [2025-02-06 05:12:33,561 INFO L226 Difference]: Without dead ends: 395 [2025-02-06 05:12:33,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:12:33,573 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:12:33,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 524 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:12:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-02-06 05:12:33,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2025-02-06 05:12:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 278 states have (on average 1.2841726618705036) internal successors, (357), 280 states have internal predecessors, (357), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 05:12:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 527 transitions. [2025-02-06 05:12:33,651 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 527 transitions. Word has length 124 [2025-02-06 05:12:33,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:12:33,654 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 527 transitions. [2025-02-06 05:12:33,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 05:12:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 527 transitions. [2025-02-06 05:12:33,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 05:12:33,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:12:33,659 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:12:33,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 05:12:33,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 05:12:33,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:12:33,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:12:33,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1469278762, now seen corresponding path program 1 times [2025-02-06 05:12:33,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:12:33,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646649906] [2025-02-06 05:12:33,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:12:33,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:12:37,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 05:12:37,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 05:12:37,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:12:37,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:12:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 05:12:38,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:12:38,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646649906] [2025-02-06 05:12:38,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646649906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:12:38,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:12:38,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:12:38,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515775345] [2025-02-06 05:12:38,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:12:38,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:12:38,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:12:38,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:12:38,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:12:38,739 INFO L87 Difference]: Start difference. First operand 395 states and 527 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 05:12:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:12:39,386 INFO L93 Difference]: Finished difference Result 786 states and 1053 transitions. [2025-02-06 05:12:39,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:12:39,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2025-02-06 05:12:39,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:12:39,390 INFO L225 Difference]: With dead ends: 786 [2025-02-06 05:12:39,390 INFO L226 Difference]: Without dead ends: 400 [2025-02-06 05:12:39,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:12:39,395 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 0 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 05:12:39,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2044 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 05:12:39,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-02-06 05:12:39,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-02-06 05:12:39,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 282 states have (on average 1.2801418439716312) internal successors, (361), 284 states have internal predecessors, (361), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (88), 85 states have call predecessors, (88), 84 states have call successors, (88) [2025-02-06 05:12:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 535 transitions. [2025-02-06 05:12:39,414 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 535 transitions. Word has length 124 [2025-02-06 05:12:39,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:12:39,414 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 535 transitions. [2025-02-06 05:12:39,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 05:12:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 535 transitions. [2025-02-06 05:12:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 05:12:39,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:12:39,416 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:12:39,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 05:12:39,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:12:39,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:12:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash -65078272, now seen corresponding path program 1 times [2025-02-06 05:12:39,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:12:39,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380073770] [2025-02-06 05:12:39,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:12:39,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:12:43,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 05:12:43,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 05:12:43,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:12:43,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:12:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 05:12:44,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:12:44,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380073770] [2025-02-06 05:12:44,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380073770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:12:44,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:12:44,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:12:44,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383718816] [2025-02-06 05:12:44,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:12:44,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:12:44,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:12:44,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:12:44,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:12:44,516 INFO L87 Difference]: Start difference. First operand 400 states and 535 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 05:12:45,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:12:45,182 INFO L93 Difference]: Finished difference Result 786 states and 1051 transitions. [2025-02-06 05:12:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:12:45,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 130 [2025-02-06 05:12:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:12:45,190 INFO L225 Difference]: With dead ends: 786 [2025-02-06 05:12:45,190 INFO L226 Difference]: Without dead ends: 400 [2025-02-06 05:12:45,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:12:45,191 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 23 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 05:12:45,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1474 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 05:12:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-02-06 05:12:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-02-06 05:12:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 282 states have (on average 1.2765957446808511) internal successors, (360), 284 states have internal predecessors, (360), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (88), 85 states have call predecessors, (88), 84 states have call successors, (88) [2025-02-06 05:12:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 534 transitions. [2025-02-06 05:12:45,210 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 534 transitions. Word has length 130 [2025-02-06 05:12:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:12:45,210 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 534 transitions. [2025-02-06 05:12:45,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 05:12:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 534 transitions. [2025-02-06 05:12:45,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 05:12:45,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:12:45,212 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:12:45,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 05:12:45,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:12:45,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:12:45,212 INFO L85 PathProgramCache]: Analyzing trace with hash 143620031, now seen corresponding path program 1 times [2025-02-06 05:12:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:12:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135094157] [2025-02-06 05:12:45,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:12:45,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:12:49,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 05:12:49,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 05:12:49,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:12:49,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:12:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 05:12:52,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:12:52,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135094157] [2025-02-06 05:12:52,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135094157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:12:52,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:12:52,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 05:12:52,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866575170] [2025-02-06 05:12:52,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:12:52,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 05:12:52,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:12:52,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 05:12:52,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 05:12:52,656 INFO L87 Difference]: Start difference. First operand 400 states and 534 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-02-06 05:12:56,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:13:01,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:13:05,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:13:09,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:13:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:13:16,198 INFO L93 Difference]: Finished difference Result 782 states and 1043 transitions. [2025-02-06 05:13:16,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 05:13:16,204 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 130 [2025-02-06 05:13:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:13:16,211 INFO L225 Difference]: With dead ends: 782 [2025-02-06 05:13:16,211 INFO L226 Difference]: Without dead ends: 403 [2025-02-06 05:13:16,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 05:13:16,214 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 5 mSDsluCounter, 2851 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3357 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2025-02-06 05:13:16,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3357 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 4 Unknown, 0 Unchecked, 22.9s Time] [2025-02-06 05:13:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-02-06 05:13:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-02-06 05:13:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 284 states have (on average 1.2746478873239437) internal successors, (362), 287 states have internal predecessors, (362), 86 states have call successors, (86), 30 states have call predecessors, (86), 32 states have return successors, (89), 85 states have call predecessors, (89), 84 states have call successors, (89) [2025-02-06 05:13:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 537 transitions. [2025-02-06 05:13:16,290 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 537 transitions. Word has length 130 [2025-02-06 05:13:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:13:16,291 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 537 transitions. [2025-02-06 05:13:16,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-02-06 05:13:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 537 transitions. [2025-02-06 05:13:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 05:13:16,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:13:16,297 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:13:16,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 05:13:16,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:13:16,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:13:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1509345130, now seen corresponding path program 1 times [2025-02-06 05:13:16,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:13:16,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997351505] [2025-02-06 05:13:16,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:13:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:13:19,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 05:13:19,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 05:13:19,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:13:19,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:13:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 05:13:22,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:13:22,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997351505] [2025-02-06 05:13:22,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997351505] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:13:22,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144121374] [2025-02-06 05:13:22,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:13:22,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:13:22,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:13:22,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:13:22,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 05:13:26,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 05:13:27,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 05:13:27,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:13:27,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:13:27,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 4440 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 05:13:27,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:13:32,827 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_aws_hash_table_is_valid_~map.base_4 Int) (v_aws_hash_table_is_valid_~map.offset_4 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_hash_table_is_valid_~map.base_4) v_aws_hash_table_is_valid_~map.offset_4) 0))) (exists ((v_aws_hash_table_is_valid_~map.base_4 Int) (v_aws_hash_table_is_valid_~map.offset_4 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_hash_table_is_valid_~map.base_4) v_aws_hash_table_is_valid_~map.offset_4) 0)))) is different from true [2025-02-06 05:13:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-06 05:13:41,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:13:41,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144121374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:13:41,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:13:41,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-02-06 05:13:41,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576313871] [2025-02-06 05:13:41,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:13:41,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 05:13:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:13:41,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 05:13:41,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=105, Unknown=3, NotChecked=20, Total=156 [2025-02-06 05:13:41,986 INFO L87 Difference]: Start difference. First operand 403 states and 537 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-06 05:13:46,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []