./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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_negated.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 83589103d63582ab3e264b6d8e730d62c6eb0b101bb611ea588c172c43990d87 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:48:53,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:48:53,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:48:53,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:48:53,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:48:53,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:48:53,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:48:53,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:48:53,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:48:53,223 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:48:53,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:48:53,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:48:53,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:48:53,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:48:53,224 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:48:53,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:48:53,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:48:53,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:48:53,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:48:53,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:48:53,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:48:53,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:48:53,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:48:53,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:48:53,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:48:53,227 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 -> 83589103d63582ab3e264b6d8e730d62c6eb0b101bb611ea588c172c43990d87 [2025-02-08 01:48:53,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:48:53,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:48:53,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:48:53,484 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:48:53,485 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:48:53,491 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_negated.i [2025-02-08 01:48:54,794 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9997778f4/5fdc17fb61454d638149d49c2a6b3b12/FLAG39c5c8033 [2025-02-08 01:48:55,332 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:48:55,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness_negated.i [2025-02-08 01:48:55,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9997778f4/5fdc17fb61454d638149d49c2a6b3b12/FLAG39c5c8033 [2025-02-08 01:48:55,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9997778f4/5fdc17fb61454d638149d49c2a6b3b12 [2025-02-08 01:48:55,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:48:55,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:48:55,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:48:55,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:48:55,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:48:55,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:48:55" (1/1) ... [2025-02-08 01:48:55,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795d8fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:55, skipping insertion in model container [2025-02-08 01:48:55,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:48:55" (1/1) ... [2025-02-08 01:48:55,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:48:56,173 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_negated.i[4495,4508] [2025-02-08 01:48:56,178 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_negated.i[4555,4568] [2025-02-08 01:48:56,879 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,879 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,880 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,880 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,881 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,889 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,890 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,891 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,891 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,892 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,893 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,893 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,893 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,492 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,493 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,521 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,522 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,548 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,549 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,549 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,549 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,549 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,549 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,550 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,597 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_negated.i[229394,229407] [2025-02-08 01:48:57,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:48:57,623 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:48:57,635 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_negated.i[4495,4508] [2025-02-08 01:48:57,636 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_negated.i[4555,4568] [2025-02-08 01:48:57,681 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,682 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,682 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,682 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,682 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,687 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,687 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,688 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,689 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,689 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,689 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,690 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,690 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,756 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7544-7555] [2025-02-08 01:48:57,874 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,875 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,883 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,884 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,885 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,885 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,894 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,895 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,895 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,895 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,895 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,895 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,895 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,915 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_negated.i[229394,229407] [2025-02-08 01:48:57,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:48:58,065 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:48:58,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:58 WrapperNode [2025-02-08 01:48:58,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:48:58,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:48:58,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:48:58,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:48:58,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:58" (1/1) ... [2025-02-08 01:48:58,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:58" (1/1) ... [2025-02-08 01:48:58,211 INFO L138 Inliner]: procedures = 764, calls = 2484, calls flagged for inlining = 68, calls inlined = 21, statements flattened = 1368 [2025-02-08 01:48:58,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:48:58,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:48:58,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:48:58,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:48:58,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:58" (1/1) ... [2025-02-08 01:48:58,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:58" (1/1) ... [2025-02-08 01:48:58,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:58" (1/1) ... [2025-02-08 01:48:58,247 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 01:48:58,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:58" (1/1) ... [2025-02-08 01:48:58,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:58" (1/1) ... [2025-02-08 01:48:58,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:58" (1/1) ... [2025-02-08 01:48:58,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:58" (1/1) ... [2025-02-08 01:48:58,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:58" (1/1) ... [2025-02-08 01:48:58,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:58" (1/1) ... [2025-02-08 01:48:58,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:48:58,305 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:48:58,305 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:48:58,305 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:48:58,308 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:58" (1/1) ... [2025-02-08 01:48:58,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:48:58,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:48:58,333 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-08 01:48:58,338 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-08 01:48:58,353 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-02-08 01:48:58,354 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-02-08 01:48:58,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-08 01:48:58,354 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2025-02-08 01:48:58,354 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2025-02-08 01:48:58,354 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2025-02-08 01:48:58,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2025-02-08 01:48:58,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:48:58,354 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-08 01:48:58,354 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-08 01:48:58,354 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-02-08 01:48:58,354 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-02-08 01:48:58,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2025-02-08 01:48:58,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 01:48:58,355 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-02-08 01:48:58,355 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-02-08 01:48:58,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 01:48:58,355 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-08 01:48:58,356 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-08 01:48:58,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:48:58,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:48:58,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-08 01:48:58,356 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_create [2025-02-08 01:48:58,356 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_create [2025-02-08 01:48:58,356 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-02-08 01:48:58,356 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-02-08 01:48:58,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:48:58,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:48:58,356 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-02-08 01:48:58,356 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-02-08 01:48:58,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 01:48:58,356 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2025-02-08 01:48:58,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2025-02-08 01:48:58,356 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2025-02-08 01:48:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2025-02-08 01:48:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:48:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-02-08 01:48:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-08 01:48:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2025-02-08 01:48:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-02-08 01:48:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:48:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-02-08 01:48:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-02-08 01:48:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-08 01:48:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-08 01:48:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-02-08 01:48:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-02-08 01:48:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-08 01:48:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-08 01:48:58,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 01:48:58,359 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2025-02-08 01:48:58,359 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2025-02-08 01:48:58,359 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-02-08 01:48:58,359 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-02-08 01:48:58,359 INFO L130 BoogieDeclarations]: Found specification of procedure uninterpreted_equals [2025-02-08 01:48:58,359 INFO L138 BoogieDeclarations]: Found implementation of procedure uninterpreted_equals [2025-02-08 01:48:58,359 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-08 01:48:58,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-08 01:48:58,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 01:48:58,359 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-02-08 01:48:58,359 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-02-08 01:48:58,659 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:48:58,660 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:48:58,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6935: havoc #t~malloc588.base, #t~malloc588.offset; [2025-02-08 01:48:58,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9974: 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-08 01:48:58,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-08 01:48:58,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L10087: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-02-08 01:48:58,818 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6943: havoc #t~ret589#1;havoc #t~ite591#1.base, #t~ite591#1.offset;havoc #t~ret590#1.base, #t~ret590#1.offset; [2025-02-08 01:48:58,818 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6928: 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;#t~ret590#1.base, #t~ret590#1.offset := bounded_calloc_#res#1.base, bounded_calloc_#res#1.offset;havoc bounded_calloc_#t~ret585#1, bounded_calloc_#t~mem586#1, bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset, bounded_calloc_~num#1, bounded_calloc_~size#1, bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset;havoc bounded_calloc_#in~num#1, bounded_calloc_#in~size#1;assume { :end_inline_bounded_calloc } true;#t~ite591#1.base, #t~ite591#1.offset := #t~ret590#1.base, #t~ret590#1.offset; [2025-02-08 01:48:58,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-02-08 01:48:58,916 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9169: call ULTIMATE.dealloc(~#size~0#1.base, ~#size~0#1.offset);havoc ~#size~0#1.base, ~#size~0#1.offset; [2025-02-08 01:48:58,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6974: havoc #t~ret600.base, #t~ret600.offset; [2025-02-08 01:48:58,937 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9122-1: assume false; [2025-02-08 01:48:58,937 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9122-1: assume !false; [2025-02-08 01:48:58,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-02-08 01:48:58,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-08 01:48:58,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9083-1: assume false; [2025-02-08 01:48:58,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9083-1: assume !false; [2025-02-08 01:48:58,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7341: havoc uninterpreted_hasher_#t~ret689#1; [2025-02-08 01:48:59,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #res#1 := #t~funptrres1575#1;havoc #t~funptrres1575#1;havoc #t~ret1576#1;havoc #t~ret1577#1; [2025-02-08 01:48:59,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7328: havoc uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1;#t~ret1577#1 := uninterpreted_equals_assert_inputs_nonnull_#res#1;havoc uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1, uninterpreted_equals_assert_inputs_nonnull_~a#1.base, uninterpreted_equals_assert_inputs_nonnull_~a#1.offset, uninterpreted_equals_assert_inputs_nonnull_~b#1.base, uninterpreted_equals_assert_inputs_nonnull_~b#1.offset;havoc uninterpreted_equals_assert_inputs_nonnull_#in~a#1.base, uninterpreted_equals_assert_inputs_nonnull_#in~a#1.offset, uninterpreted_equals_assert_inputs_nonnull_#in~b#1.base, uninterpreted_equals_assert_inputs_nonnull_#in~b#1.offset;assume { :end_inline_uninterpreted_equals_assert_inputs_nonnull } true;#t~funptrres1575#1 := #t~ret1577#1; [2025-02-08 01:48:59,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ##fun~$Pointer$~X~$Pointer$~TO~intFINAL: assume true; [2025-02-08 01:48:59,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7271: havoc nondet_compare_#t~ret677#1;#t~ret1576#1 := nondet_compare_#res#1;havoc nondet_compare_#t~ret677#1, nondet_compare_~a#1.base, nondet_compare_~a#1.offset, nondet_compare_~b#1.base, nondet_compare_~b#1.offset;havoc nondet_compare_#in~a#1.base, nondet_compare_#in~a#1.offset, nondet_compare_#in~b#1.base, nondet_compare_#in~b#1.offset;assume { :end_inline_nondet_compare } true;assume -2147483648 <= #t~ret1576#1 && #t~ret1576#1 <= 2147483647;#t~funptrres1575#1 := #t~ret1576#1; [2025-02-08 01:48:59,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: havoc nondet_int_#t~nondet5#1;nondet_compare_#t~ret677#1 := nondet_int_#res#1;havoc nondet_int_#t~nondet5#1;assume { :end_inline_nondet_int } true;assume -2147483648 <= nondet_compare_#t~ret677#1 && nondet_compare_#t~ret677#1 <= 2147483647;nondet_compare_#res#1 := nondet_compare_#t~ret677#1;havoc nondet_compare_#t~ret677#1; [2025-02-08 01:48:59,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9452: 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;#t~ret1281#1 := s_expand_table_#res#1;havoc s_expand_table_#t~mem1245#1.base, s_expand_table_#t~mem1245#1.offset, s_expand_table_#t~mem1246#1.base, s_expand_table_#t~mem1246#1.offset, s_expand_table_#t~mem1247#1.base, s_expand_table_#t~mem1247#1.offset, s_expand_table_#t~mem1248#1.base, s_expand_table_#t~mem1248#1.offset, s_expand_table_#t~mem1249#1.base, s_expand_table_#t~mem1249#1.offset, s_expand_table_#t~mem1250#1.base, s_expand_table_#t~mem1250#1.offset, s_expand_table_#t~mem1251#1, s_expand_table_#t~mem1252#1, s_expand_table_#t~mem1253#1, s_expand_table_#t~mem1254#1, s_expand_table_#t~mem1255#1, s_expand_table_#t~arrayCopy1256#1.element.key.base, s_expand_table_#t~arrayCopy1256#1.element.key.offset, s_expand_table_#t~arrayCopy1256#1.element.value.base, s_expand_table_#t~arrayCopy1256#1.element.value.offset, s_expand_table_#t~arrayCopy1256#1.hash_code, s_expand_table_#t~mem1257#1, s_expand_table_#t~ret1258#1, s_expand_table_#t~mem1259#1, s_expand_table_#t~ret1260#1, s_expand_table_#t~ret1261#1.base, s_expand_table_#t~ret1261#1.offset, s_expand_table_#t~mem1262#1, s_expand_table_#t~mem1263#1.base, s_expand_table_#t~mem1263#1.offset, s_expand_table_#t~mem1264#1.base, s_expand_table_#t~mem1264#1.offset, s_expand_table_#t~mem1265#1, s_expand_table_#t~mem1266#1, s_expand_table_#t~mem1267#1.base, s_expand_table_#t~mem1267#1.offset, s_expand_table_#t~mem1268#1.base, s_expand_table_#t~mem1268#1.offset, s_expand_table_#t~mem1269#1, s_expand_table_#t~ret1270#1.base, s_expand_table_#t~ret1270#1.offset, s_expand_table_~#entry~3#1.base, s_expand_table_~#entry~3#1.offset, s_expand_table_#t~post1271#1, s_expand_table_~i~6#1, s_expand_table_#t~mem1272#1.base, s_expand_table_#t~mem1272#1.offset, s_expand_table_~map#1.base, s_expand_table_~map#1.offset, s_expand_table_~old_state~0#1.base, s_expand_table_~old_state~0#1.offset, s_expand_table_~#template~1#1.base, s_expand_table_~#template~1#1.offset, s_expand_table_~#new_size~0#1.base, s_expand_table_~#new_size~0#1.offset, s_expand_table_~new_state~0#1.base, s_expand_table_~new_state~0#1.offset;havoc s_expand_table_#in~map#1.base, s_expand_table_#in~map#1.offset;assume { :end_inline_s_expand_table } true;assume -2147483648 <= #t~ret1281#1 && #t~ret1281#1 <= 2147483647;~rv~2#1 := #t~ret1281#1;havoc #t~ret1281#1; [2025-02-08 01:48:59,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9514: assume 0 != ~rv~2#1;#res#1 := ~rv~2#1;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; [2025-02-08 01:48:59,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9514: assume !(0 != ~rv~2#1);call #t~mem1282#1.base, #t~mem1282#1.offset := read~$Pointer$(~map#1.base, ~map#1.offset, 8);~state~6#1.base, ~state~6#1.offset := #t~mem1282#1.base, #t~mem1282#1.offset;havoc #t~mem1282#1.base, #t~mem1282#1.offset;call write~int(0, ~#probe_idx~1#1.base, ~#probe_idx~1#1.offset, 8); [2025-02-08 01:48:59,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9490: 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-08 01:48:59,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9109: havoc #t~ret1142; [2025-02-08 01:48:59,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9140: 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-08 01:48:59,240 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6997: 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-08 01:48:59,307 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9444-1: assume false; [2025-02-08 01:48:59,307 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9444-1: assume !false; [2025-02-08 01:48:59,308 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9403-1: assume false; [2025-02-08 01:48:59,308 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9403-1: assume !false; [2025-02-08 01:48:59,377 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9311: havoc #t~ret1203#1; [2025-02-08 01:48:59,394 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-02-08 01:48:59,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-02-08 01:49:04,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6821: 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-08 01:49:04,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6831: havoc hash_table_state_has_an_empty_slot_#t~mem571#1; [2025-02-08 01:49:04,909 INFO L? ?]: Removed 369 outVars from TransFormulas that were not future-live. [2025-02-08 01:49:04,909 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:49:04,948 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:49:04,948 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:49:04,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:49:04 BoogieIcfgContainer [2025-02-08 01:49:04,948 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:49:04,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:49:04,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:49:04,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:49:04,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:48:55" (1/3) ... [2025-02-08 01:49:04,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d132a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:49:04, skipping insertion in model container [2025-02-08 01:49:04,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:58" (2/3) ... [2025-02-08 01:49:04,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d132a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:49:04, skipping insertion in model container [2025-02-08 01:49:04,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:49:04" (3/3) ... [2025-02-08 01:49:04,959 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_create_harness_negated.i [2025-02-08 01:49:04,971 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:49:04,972 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_create_harness_negated.i that has 31 procedures, 390 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-02-08 01:49:05,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:49:05,036 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;@61c52157, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:49:05,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:49:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 389 states, 265 states have (on average 1.3358490566037735) internal successors, (354), 272 states have internal predecessors, (354), 86 states have call successors, (86), 30 states have call predecessors, (86), 29 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-08 01:49:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-08 01:49:05,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:49:05,052 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] [2025-02-08 01:49:05,052 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:49:05,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:49:05,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1401641881, now seen corresponding path program 1 times [2025-02-08 01:49:05,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:49:05,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664412705] [2025-02-08 01:49:05,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:05,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:49:09,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-08 01:49:09,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 01:49:09,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:09,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:10,027 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-08 01:49:10,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:49:10,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664412705] [2025-02-08 01:49:10,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664412705] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:49:10,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721980652] [2025-02-08 01:49:10,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:10,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:49:10,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:49:10,031 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-08 01:49:10,034 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-08 01:49:14,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-08 01:49:14,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 01:49:14,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:14,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:14,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 4401 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:49:14,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:49:14,960 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-08 01:49:14,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:49:14,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721980652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:49:14,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:49:14,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:49:14,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462965960] [2025-02-08 01:49:14,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:49:14,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:49:14,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:49:14,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:49:14,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:49:14,981 INFO L87 Difference]: Start difference. First operand has 389 states, 265 states have (on average 1.3358490566037735) internal successors, (354), 272 states have internal predecessors, (354), 86 states have call successors, (86), 30 states have call predecessors, (86), 29 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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-08 01:49:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:49:15,189 INFO L93 Difference]: Finished difference Result 771 states and 1098 transitions. [2025-02-08 01:49:15,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:49:15,191 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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 120 [2025-02-08 01:49:15,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:49:15,201 INFO L225 Difference]: With dead ends: 771 [2025-02-08 01:49:15,201 INFO L226 Difference]: Without dead ends: 349 [2025-02-08 01:49:15,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 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-08 01:49:15,209 INFO L435 NwaCegarLoop]: 501 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, 501 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-08 01:49:15,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 501 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:49:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-02-08 01:49:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-02-08 01:49:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 244 states have (on average 1.278688524590164) internal successors, (312), 248 states have internal predecessors, (312), 76 states have call successors, (76), 29 states have call predecessors, (76), 28 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-08 01:49:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 459 transitions. [2025-02-08 01:49:15,261 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 459 transitions. Word has length 120 [2025-02-08 01:49:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:49:15,262 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 459 transitions. [2025-02-08 01:49:15,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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-08 01:49:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 459 transitions. [2025-02-08 01:49:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-08 01:49:15,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:49:15,266 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] [2025-02-08 01:49:15,281 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-08 01:49:15,467 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-08 01:49:15,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:49:15,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:49:15,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1127575142, now seen corresponding path program 1 times [2025-02-08 01:49:15,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:49:15,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481281097] [2025-02-08 01:49:15,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:15,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:49:19,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-08 01:49:19,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 01:49:19,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:19,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:20,279 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-08 01:49:20,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:49:20,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481281097] [2025-02-08 01:49:20,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481281097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:49:20,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:49:20,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:49:20,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009203228] [2025-02-08 01:49:20,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:49:20,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:49:20,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:49:20,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:49:20,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:49:20,284 INFO L87 Difference]: Start difference. First operand 349 states and 459 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-08 01:49:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:49:20,811 INFO L93 Difference]: Finished difference Result 690 states and 908 transitions. [2025-02-08 01:49:20,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:49:20,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 120 [2025-02-08 01:49:20,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:49:20,817 INFO L225 Difference]: With dead ends: 690 [2025-02-08 01:49:20,817 INFO L226 Difference]: Without dead ends: 349 [2025-02-08 01:49:20,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:49:20,819 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 0 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 01:49:20,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1329 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 01:49:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-02-08 01:49:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-02-08 01:49:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 244 states have (on average 1.2745901639344261) internal successors, (311), 248 states have internal predecessors, (311), 76 states have call successors, (76), 29 states have call predecessors, (76), 28 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-08 01:49:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 458 transitions. [2025-02-08 01:49:20,861 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 458 transitions. Word has length 120 [2025-02-08 01:49:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:49:20,861 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 458 transitions. [2025-02-08 01:49:20,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-08 01:49:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 458 transitions. [2025-02-08 01:49:20,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-08 01:49:20,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:49:20,863 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, 1] [2025-02-08 01:49:20,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:49:20,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:49:20,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:49:20,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1827267451, now seen corresponding path program 1 times [2025-02-08 01:49:20,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:49:20,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859001533] [2025-02-08 01:49:20,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:20,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:49:24,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-08 01:49:25,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-08 01:49:25,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:25,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:25,666 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-08 01:49:25,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:49:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859001533] [2025-02-08 01:49:25,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859001533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:49:25,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:49:25,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:49:25,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706758192] [2025-02-08 01:49:25,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:49:25,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:49:25,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:49:25,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:49:25,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:49:25,667 INFO L87 Difference]: Start difference. First operand 349 states and 458 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-08 01:49:26,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:49:26,127 INFO L93 Difference]: Finished difference Result 690 states and 906 transitions. [2025-02-08 01:49:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:49:26,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2025-02-08 01:49:26,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:49:26,132 INFO L225 Difference]: With dead ends: 690 [2025-02-08 01:49:26,134 INFO L226 Difference]: Without dead ends: 349 [2025-02-08 01:49:26,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:49:26,135 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 0 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 01:49:26,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1326 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 01:49:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-02-08 01:49:26,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-02-08 01:49:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 244 states have (on average 1.2704918032786885) internal successors, (310), 248 states have internal predecessors, (310), 76 states have call successors, (76), 29 states have call predecessors, (76), 28 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-08 01:49:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 457 transitions. [2025-02-08 01:49:26,155 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 457 transitions. Word has length 131 [2025-02-08 01:49:26,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:49:26,155 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 457 transitions. [2025-02-08 01:49:26,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-08 01:49:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 457 transitions. [2025-02-08 01:49:26,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-08 01:49:26,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:49:26,157 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, 1] [2025-02-08 01:49:26,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:49:26,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:49:26,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:49:26,158 INFO L85 PathProgramCache]: Analyzing trace with hash 49215367, now seen corresponding path program 1 times [2025-02-08 01:49:26,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:49:26,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724572544] [2025-02-08 01:49:26,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:26,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:49:30,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-08 01:49:30,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-08 01:49:30,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:30,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:31,122 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-08 01:49:31,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:49:31,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724572544] [2025-02-08 01:49:31,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724572544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:49:31,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:49:31,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:49:31,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197122412] [2025-02-08 01:49:31,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:49:31,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:49:31,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:49:31,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:49:31,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:49:31,124 INFO L87 Difference]: Start difference. First operand 349 states and 457 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-08 01:49:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:49:32,069 INFO L93 Difference]: Finished difference Result 686 states and 897 transitions. [2025-02-08 01:49:32,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:49:32,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 131 [2025-02-08 01:49:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:49:32,072 INFO L225 Difference]: With dead ends: 686 [2025-02-08 01:49:32,072 INFO L226 Difference]: Without dead ends: 349 [2025-02-08 01:49:32,073 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-08 01:49:32,074 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 21 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 01:49:32,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1702 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 01:49:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-02-08 01:49:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-02-08 01:49:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 244 states have (on average 1.2663934426229508) internal successors, (309), 248 states have internal predecessors, (309), 76 states have call successors, (76), 29 states have call predecessors, (76), 28 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-08 01:49:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 456 transitions. [2025-02-08 01:49:32,087 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 456 transitions. Word has length 131 [2025-02-08 01:49:32,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:49:32,087 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 456 transitions. [2025-02-08 01:49:32,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-08 01:49:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 456 transitions. [2025-02-08 01:49:32,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-08 01:49:32,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:49:32,089 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, 1] [2025-02-08 01:49:32,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:49:32,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:49:32,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:49:32,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1857062888, now seen corresponding path program 1 times [2025-02-08 01:49:32,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:49:32,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738319457] [2025-02-08 01:49:32,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:32,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:49:35,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-08 01:49:36,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-08 01:49:36,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:36,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:39,258 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-08 01:49:39,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:49:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738319457] [2025-02-08 01:49:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738319457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:49:39,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:49:39,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:49:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182837024] [2025-02-08 01:49:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:49:39,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:49:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:49:39,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:49:39,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:49:39,261 INFO L87 Difference]: Start difference. First operand 349 states and 456 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2025-02-08 01:49:43,318 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 [] [2025-02-08 01:49:47,774 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-08 01:49:52,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:49:56,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:50:00,947 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-08 01:50:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:50:07,391 INFO L93 Difference]: Finished difference Result 682 states and 889 transitions. [2025-02-08 01:50:07,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:50:07,397 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 131 [2025-02-08 01:50:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:50:07,401 INFO L225 Difference]: With dead ends: 682 [2025-02-08 01:50:07,401 INFO L226 Difference]: Without dead ends: 352 [2025-02-08 01:50:07,403 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-08 01:50:07,405 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 5 mSDsluCounter, 2446 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2882 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.4s IncrementalHoareTripleChecker+Time [2025-02-08 01:50:07,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2882 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 5 Unknown, 0 Unchecked, 27.4s Time] [2025-02-08 01:50:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-08 01:50:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-02-08 01:50:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 246 states have (on average 1.2642276422764227) internal successors, (311), 251 states have internal predecessors, (311), 76 states have call successors, (76), 29 states have call predecessors, (76), 29 states have return successors, (72), 71 states have call predecessors, (72), 71 states have call successors, (72) [2025-02-08 01:50:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 459 transitions. [2025-02-08 01:50:07,426 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 459 transitions. Word has length 131 [2025-02-08 01:50:07,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:50:07,426 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 459 transitions. [2025-02-08 01:50:07,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2025-02-08 01:50:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 459 transitions. [2025-02-08 01:50:07,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-08 01:50:07,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:07,429 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, 1] [2025-02-08 01:50:07,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:50:07,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:07,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:07,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1144722576, now seen corresponding path program 1 times [2025-02-08 01:50:07,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:07,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952821058] [2025-02-08 01:50:07,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:07,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:11,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 01:50:11,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 01:50:11,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:11,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:13,717 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-08 01:50:13,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:13,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952821058] [2025-02-08 01:50:13,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952821058] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:50:13,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671601604] [2025-02-08 01:50:13,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:13,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:50:13,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:50:13,719 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-08 01:50:13,721 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-08 01:50:18,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 01:50:18,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 01:50:18,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:18,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:18,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 4525 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 01:50:18,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:50:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 102 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:50:22,181 INFO L312 TraceCheckSpWp]: Computing backward predicates...