./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f854806972984dce66ab6a9732a626450e69b31616f902ad254c217d61a95da2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:55:52,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:55:52,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:55:52,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:55:52,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:55:52,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:55:52,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:55:52,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:55:52,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:55:52,703 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:55:52,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:55:52,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:55:52,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:55:52,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:55:52,705 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:55:52,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:55:52,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:55:52,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:55:52,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:55:52,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:55:52,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:55:52,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:55:52,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:55:52,706 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:55:52,706 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:55:52,706 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:55:52,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:55:52,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:55:52,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:55:52,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:55:52,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:55:52,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:55:52,707 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:55:52,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:55:52,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:55:52,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:55:52,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:55:52,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:55:52,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:55:52,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:55:52,707 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/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 -> f854806972984dce66ab6a9732a626450e69b31616f902ad254c217d61a95da2 [2025-03-04 02:55:52,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:55:52,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:55:52,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:55:52,968 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:55:52,968 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:55:52,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i [2025-03-04 02:55:54,156 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da87c5bfd/cd4f1bc40a52408da04c95ce5db73e99/FLAGf9b816404 [2025-03-04 02:55:54,624 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:55:54,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i [2025-03-04 02:55:54,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da87c5bfd/cd4f1bc40a52408da04c95ce5db73e99/FLAGf9b816404 [2025-03-04 02:55:54,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da87c5bfd/cd4f1bc40a52408da04c95ce5db73e99 [2025-03-04 02:55:54,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:55:54,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:55:54,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:55:54,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:55:54,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:55:54,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:55:54" (1/1) ... [2025-03-04 02:55:54,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7994d33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:54, skipping insertion in model container [2025-03-04 02:55:54,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:55:54" (1/1) ... [2025-03-04 02:55:54,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:55:55,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i[4492,4505] [2025-03-04 02:55:55,033 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i[4552,4565] [2025-03-04 02:55:55,781 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:55,782 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:55,782 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:55,782 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:55,783 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:55,791 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:55,791 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:55,793 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:55,793 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:55,797 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:55,797 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:55,798 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:55,798 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,574 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,575 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,594 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,595 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,600 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,601 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,612 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,613 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,613 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,613 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,613 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,614 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,614 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i[229077,229090] [2025-03-04 02:55:56,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:55:56,673 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:55:56,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i[4492,4505] [2025-03-04 02:55:56,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i[4552,4565] [2025-03-04 02:55:56,721 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,722 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,722 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,722 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,722 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,726 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,726 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,727 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,727 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,727 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,728 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,728 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,728 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7576-7587] [2025-03-04 02:55:56,869 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,869 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,873 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,874 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,875 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,875 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,880 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,880 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,880 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,881 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,881 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,881 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,881 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:56,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i[229077,229090] [2025-03-04 02:55:56,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:55:57,060 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:55:57,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57 WrapperNode [2025-03-04 02:55:57,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:55:57,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:55:57,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:55:57,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:55:57,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57" (1/1) ... [2025-03-04 02:55:57,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57" (1/1) ... [2025-03-04 02:55:57,193 INFO L138 Inliner]: procedures = 764, calls = 2484, calls flagged for inlining = 71, calls inlined = 25, statements flattened = 1463 [2025-03-04 02:55:57,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:55:57,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:55:57,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:55:57,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:55:57,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57" (1/1) ... [2025-03-04 02:55:57,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57" (1/1) ... [2025-03-04 02:55:57,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57" (1/1) ... [2025-03-04 02:55:57,227 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 02:55:57,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57" (1/1) ... [2025-03-04 02:55:57,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57" (1/1) ... [2025-03-04 02:55:57,275 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57" (1/1) ... [2025-03-04 02:55:57,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57" (1/1) ... [2025-03-04 02:55:57,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57" (1/1) ... [2025-03-04 02:55:57,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57" (1/1) ... [2025-03-04 02:55:57,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:55:57,309 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:55:57,309 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:55:57,309 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:55:57,310 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57" (1/1) ... [2025-03-04 02:55:57,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:55:57,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:55:57,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:55:57,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:55:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-03-04 02:55:57,364 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-03-04 02:55:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 02:55:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2025-03-04 02:55:57,364 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2025-03-04 02:55:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2025-03-04 02:55:57,364 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2025-03-04 02:55:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:55:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-04 02:55:57,364 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-04 02:55:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-03-04 02:55:57,365 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-03-04 02:55:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2025-03-04 02:55:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 02:55:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-03-04 02:55:57,365 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-03-04 02:55:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 02:55:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 02:55:57,365 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 02:55:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:55:57,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:55:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 02:55:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-04 02:55:57,365 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-04 02:55:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:55:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:55:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-04 02:55:57,366 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-04 02:55:57,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 02:55:57,366 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 02:55:57,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 02:55:57,366 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2025-03-04 02:55:57,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2025-03-04 02:55:57,366 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2025-03-04 02:55:57,366 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2025-03-04 02:55:57,366 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2025-03-04 02:55:57,366 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2025-03-04 02:55:57,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:55:57,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:55:57,366 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 02:55:57,366 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 02:55:57,366 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 02:55:57,366 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 02:55:57,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 02:55:57,367 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2025-03-04 02:55:57,367 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2025-03-04 02:55:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-03-04 02:55:57,368 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-03-04 02:55:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:55:57,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:55:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:55:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-04 02:55:57,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-04 02:55:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 02:55:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-04 02:55:57,368 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-04 02:55:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 02:55:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-04 02:55:57,368 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-04 02:55:57,369 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 02:55:57,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 02:55:57,369 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-04 02:55:57,369 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-04 02:55:57,369 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:55:57,369 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:55:57,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 02:55:57,369 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2025-03-04 02:55:57,369 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2025-03-04 02:55:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-03-04 02:55:57,370 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-03-04 02:55:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 02:55:57,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 02:55:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 02:55:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-04 02:55:57,370 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-04 02:55:57,692 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:55:57,695 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:55:57,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6947: havoc #t~malloc588.base, #t~malloc588.offset; [2025-03-04 02:55:57,798 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10008: havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~short1492;havoc #t~mem1493.base, #t~mem1493.offset;havoc #t~ret1494;havoc #t~short1495; [2025-03-04 02:55:57,806 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-04 02:55:57,843 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10121: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-04 02:55:57,877 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6940: havoc bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset;call ULTIMATE.dealloc(bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset);havoc bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset; [2025-03-04 02:55:57,878 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6955: havoc #t~ret589#1;havoc #t~ite591#1.base, #t~ite591#1.offset;havoc #t~ret590#1.base, #t~ret590#1.offset; [2025-03-04 02:55:58,027 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-03-04 02:55:58,027 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9201: call ULTIMATE.dealloc(~#size~0#1.base, ~#size~0#1.offset);havoc ~#size~0#1.base, ~#size~0#1.offset; [2025-03-04 02:55:58,033 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6986: havoc #t~ret600.base, #t~ret600.offset; [2025-03-04 02:55:58,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9154-1: assume false; [2025-03-04 02:55:58,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9154-1: assume !false; [2025-03-04 02:55:58,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-04 02:55:58,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:55:58,089 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9115-1: assume false; [2025-03-04 02:55:58,089 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9115-1: assume !false; [2025-03-04 02:55:58,090 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7373: havoc uninterpreted_hasher_#t~ret689#1; [2025-03-04 02:55:58,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7356: havoc uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1; [2025-03-04 02:55:58,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7287: havoc nondet_compare_#t~ret677#1; [2025-03-04 02:55:58,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: havoc nondet_int_#t~nondet5#1; [2025-03-04 02:55:58,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9141: havoc #t~ret1142; [2025-03-04 02:55:58,390 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7009: call ULTIMATE.dealloc(aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset);havoc aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset; [2025-03-04 02:55:58,390 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9172: call ULTIMATE.dealloc(~#required_bytes~3#1.base, ~#required_bytes~3#1.offset);havoc ~#required_bytes~3#1.base, ~#required_bytes~3#1.offset; [2025-03-04 02:55:58,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9437-1: assume false; [2025-03-04 02:55:58,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9437-1: assume !false; [2025-03-04 02:55:58,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9478-1: assume false; [2025-03-04 02:55:58,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9478-1: assume !false; [2025-03-04 02:55:58,544 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9345: havoc #t~ret1203#1; [2025-03-04 02:55:58,566 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-04 02:55:58,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-04 02:56:04,566 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9524: call ULTIMATE.dealloc(aws_hash_table_create_~#entry~4#1.base, aws_hash_table_create_~#entry~4#1.offset);havoc aws_hash_table_create_~#entry~4#1.base, aws_hash_table_create_~#entry~4#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#probe_idx~1#1.base, aws_hash_table_create_~#probe_idx~1#1.offset);havoc aws_hash_table_create_~#probe_idx~1#1.base, aws_hash_table_create_~#probe_idx~1#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#ignored~0#1.base, aws_hash_table_create_~#ignored~0#1.offset);havoc aws_hash_table_create_~#ignored~0#1.base, aws_hash_table_create_~#ignored~0#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#incr_entry_count~0#1.base, aws_hash_table_create_~#incr_entry_count~0#1.offset);havoc aws_hash_table_create_~#incr_entry_count~0#1.base, aws_hash_table_create_~#incr_entry_count~0#1.offset;call ULTIMATE.dealloc(aws_hash_table_create_~#new_entry~0#1.base, aws_hash_table_create_~#new_entry~0#1.offset);havoc aws_hash_table_create_~#new_entry~0#1.base, aws_hash_table_create_~#new_entry~0#1.offset; [2025-03-04 02:56:04,566 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6833: havoc aws_hash_table_has_an_empty_slot_#t~mem566#1.base, aws_hash_table_has_an_empty_slot_#t~mem566#1.offset;havoc aws_hash_table_has_an_empty_slot_#t~ret567#1; [2025-03-04 02:56:04,566 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9584: call ULTIMATE.dealloc(aws_hash_table_put_~#p_elem~0#1.base, aws_hash_table_put_~#p_elem~0#1.offset);havoc aws_hash_table_put_~#p_elem~0#1.base, aws_hash_table_put_~#p_elem~0#1.offset;call ULTIMATE.dealloc(aws_hash_table_put_~#was_created_fallback~0#1.base, aws_hash_table_put_~#was_created_fallback~0#1.offset);havoc aws_hash_table_put_~#was_created_fallback~0#1.base, aws_hash_table_put_~#was_created_fallback~0#1.offset; [2025-03-04 02:56:04,566 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6843: havoc hash_table_state_has_an_empty_slot_#t~mem571#1; [2025-03-04 02:56:04,566 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9486: call ULTIMATE.dealloc(s_expand_table_~#template~1#1.base, s_expand_table_~#template~1#1.offset);havoc s_expand_table_~#template~1#1.base, s_expand_table_~#template~1#1.offset;call ULTIMATE.dealloc(s_expand_table_~#new_size~0#1.base, s_expand_table_~#new_size~0#1.offset);havoc s_expand_table_~#new_size~0#1.base, s_expand_table_~#new_size~0#1.offset; [2025-03-04 02:56:04,699 INFO L? ?]: Removed 447 outVars from TransFormulas that were not future-live. [2025-03-04 02:56:04,699 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:56:04,737 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:56:04,737 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:56:04,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:56:04 BoogieIcfgContainer [2025-03-04 02:56:04,738 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:56:04,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:56:04,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:56:04,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:56:04,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:55:54" (1/3) ... [2025-03-04 02:56:04,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419b3fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:56:04, skipping insertion in model container [2025-03-04 02:56:04,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:57" (2/3) ... [2025-03-04 02:56:04,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419b3fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:56:04, skipping insertion in model container [2025-03-04 02:56:04,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:56:04" (3/3) ... [2025-03-04 02:56:04,749 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_put_harness.i [2025-03-04 02:56:04,760 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:56:04,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_put_harness.i that has 30 procedures, 409 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-04 02:56:04,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:56:04,825 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;@2c985d00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:56:04,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:56:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 409 states, 296 states have (on average 1.3074324324324325) internal successors, (387), 293 states have internal predecessors, (387), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 02:56:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 02:56:04,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:56:04,843 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:56:04,843 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:56:04,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:56:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1440740924, now seen corresponding path program 1 times [2025-03-04 02:56:04,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:56:04,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191289914] [2025-03-04 02:56:04,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:56:09,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 02:56:09,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 02:56:09,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:09,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-04 02:56:10,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:56:10,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191289914] [2025-03-04 02:56:10,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191289914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:56:10,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655078497] [2025-03-04 02:56:10,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:10,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:56:10,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:56:10,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:56:10,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:56:14,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 02:56:14,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 02:56:14,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:14,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:14,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 4502 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:56:14,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:56:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-04 02:56:14,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:56:14,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655078497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:56:14,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:56:14,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:56:14,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726132164] [2025-03-04 02:56:14,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:56:14,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:56:14,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:56:14,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:56:14,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:56:14,647 INFO L87 Difference]: Start difference. First operand has 409 states, 296 states have (on average 1.3074324324324325) internal successors, (387), 293 states have internal predecessors, (387), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:56:14,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:56:14,842 INFO L93 Difference]: Finished difference Result 812 states and 1166 transitions. [2025-03-04 02:56:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:56:14,844 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2025-03-04 02:56:14,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:56:14,852 INFO L225 Difference]: With dead ends: 812 [2025-03-04 02:56:14,852 INFO L226 Difference]: Without dead ends: 403 [2025-03-04 02:56:14,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-03-04 02:56:14,859 INFO L435 NwaCegarLoop]: 536 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, 536 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-03-04 02:56:14,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:56:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-04 02:56:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-04 02:56:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 287 states have (on average 1.2961672473867596) internal successors, (372), 288 states have internal predecessors, (372), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 02:56:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 543 transitions. [2025-03-04 02:56:14,917 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 543 transitions. Word has length 134 [2025-03-04 02:56:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:56:14,917 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 543 transitions. [2025-03-04 02:56:14,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:56:14,918 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 543 transitions. [2025-03-04 02:56:14,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 02:56:14,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:56:14,920 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:56:14,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:56:15,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 02:56:15,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:56:15,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:56:15,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1163791975, now seen corresponding path program 1 times [2025-03-04 02:56:15,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:56:15,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346073971] [2025-03-04 02:56:15,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:15,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:56:18,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 02:56:18,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 02:56:18,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:18,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-04 02:56:20,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:56:20,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346073971] [2025-03-04 02:56:20,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346073971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:56:20,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:56:20,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:56:20,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14334920] [2025-03-04 02:56:20,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:56:20,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:56:20,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:56:20,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:56:20,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:56:20,039 INFO L87 Difference]: Start difference. First operand 403 states and 543 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:56:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:56:20,770 INFO L93 Difference]: Finished difference Result 802 states and 1084 transitions. [2025-03-04 02:56:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:56:20,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2025-03-04 02:56:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:56:20,778 INFO L225 Difference]: With dead ends: 802 [2025-03-04 02:56:20,779 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 02:56:20,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:56:20,781 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 0 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2108 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 02:56:20,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2108 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 02:56:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 02:56:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-03-04 02:56:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 291 states have (on average 1.2920962199312716) internal successors, (376), 292 states have internal predecessors, (376), 86 states have call successors, (86), 29 states have call predecessors, (86), 30 states have return successors, (89), 86 states have call predecessors, (89), 85 states have call successors, (89) [2025-03-04 02:56:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 551 transitions. [2025-03-04 02:56:20,801 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 551 transitions. Word has length 134 [2025-03-04 02:56:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:56:20,801 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 551 transitions. [2025-03-04 02:56:20,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:56:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 551 transitions. [2025-03-04 02:56:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 02:56:20,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:56:20,803 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:56:20,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:56:20,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:56:20,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:56:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1529507522, now seen corresponding path program 1 times [2025-03-04 02:56:20,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:56:20,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532600105] [2025-03-04 02:56:20,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:56:24,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 02:56:24,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 02:56:24,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:24,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-04 02:56:27,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:56:27,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532600105] [2025-03-04 02:56:27,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532600105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:56:27,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:56:27,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:56:27,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200822197] [2025-03-04 02:56:27,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:56:27,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:56:27,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:56:27,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:56:27,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:56:27,950 INFO L87 Difference]: Start difference. First operand 408 states and 551 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 02:56:32,005 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-03-04 02:56:36,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:56:40,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:56:45,243 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-03-04 02:56:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:56:52,132 INFO L93 Difference]: Finished difference Result 803 states and 1084 transitions. [2025-03-04 02:56:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:56:52,140 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 140 [2025-03-04 02:56:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:56:52,143 INFO L225 Difference]: With dead ends: 803 [2025-03-04 02:56:52,143 INFO L226 Difference]: Without dead ends: 416 [2025-03-04 02:56:52,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:56:52,144 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 11 mSDsluCounter, 3424 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3946 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2025-03-04 02:56:52,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3946 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 368 Invalid, 4 Unknown, 0 Unchecked, 23.6s Time] [2025-03-04 02:56:52,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-04 02:56:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 413. [2025-03-04 02:56:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 295 states have (on average 1.2915254237288136) internal successors, (381), 297 states have internal predecessors, (381), 86 states have call successors, (86), 29 states have call predecessors, (86), 31 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2025-03-04 02:56:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 557 transitions. [2025-03-04 02:56:52,169 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 557 transitions. Word has length 140 [2025-03-04 02:56:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:56:52,170 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 557 transitions. [2025-03-04 02:56:52,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 02:56:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 557 transitions. [2025-03-04 02:56:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 02:56:52,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:56:52,172 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:56:52,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:56:52,172 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:56:52,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:56:52,172 INFO L85 PathProgramCache]: Analyzing trace with hash 573986243, now seen corresponding path program 1 times [2025-03-04 02:56:52,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:56:52,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036081174] [2025-03-04 02:56:52,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:52,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:56:55,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 02:56:55,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 02:56:55,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:55,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-04 02:56:56,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:56:56,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036081174] [2025-03-04 02:56:56,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036081174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:56:56,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:56:56,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:56:56,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743304885] [2025-03-04 02:56:56,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:56:56,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:56:56,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:56:56,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:56:56,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:56:56,915 INFO L87 Difference]: Start difference. First operand 413 states and 557 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 02:56:58,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:56:58,324 INFO L93 Difference]: Finished difference Result 810 states and 1092 transitions. [2025-03-04 02:56:58,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:56:58,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 140 [2025-03-04 02:56:58,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:56:58,329 INFO L225 Difference]: With dead ends: 810 [2025-03-04 02:56:58,329 INFO L226 Difference]: Without dead ends: 411 [2025-03-04 02:56:58,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:56:58,331 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 80 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:56:58,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1979 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 02:56:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-04 02:56:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-03-04 02:56:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 293 states have (on average 1.286689419795222) internal successors, (377), 295 states have internal predecessors, (377), 86 states have call successors, (86), 29 states have call predecessors, (86), 31 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2025-03-04 02:56:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 553 transitions. [2025-03-04 02:56:58,349 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 553 transitions. Word has length 140 [2025-03-04 02:56:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:56:58,350 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 553 transitions. [2025-03-04 02:56:58,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 02:56:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 553 transitions. [2025-03-04 02:56:58,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 02:56:58,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:56:58,352 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:56:58,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:56:58,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:56:58,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:56:58,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1663627532, now seen corresponding path program 1 times [2025-03-04 02:56:58,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:56:58,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061641329] [2025-03-04 02:56:58,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:58,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:01,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 02:57:01,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 02:57:01,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:01,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-04 02:57:04,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:04,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061641329] [2025-03-04 02:57:04,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061641329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:04,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007956096] [2025-03-04 02:57:04,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:04,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:04,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:04,524 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:04,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:57:08,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 02:57:08,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 02:57:08,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:08,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:08,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 4530 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:57:09,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:14,807 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_aws_hash_table_is_valid_~map.base_4 Int) (v_aws_hash_table_is_valid_~map.offset_4 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_hash_table_is_valid_~map.base_4) v_aws_hash_table_is_valid_~map.offset_4) 0))) (exists ((v_aws_hash_table_is_valid_~map.base_4 Int) (v_aws_hash_table_is_valid_~map.offset_4 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_hash_table_is_valid_~map.base_4) v_aws_hash_table_is_valid_~map.offset_4) 0)))) is different from true [2025-03-04 02:57:23,844 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 02:57:23,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:23,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007956096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:23,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:23,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-04 02:57:23,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300047328] [2025-03-04 02:57:23,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:23,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:57:23,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:23,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:57:23,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=105, Unknown=3, NotChecked=20, Total=156 [2025-03-04 02:57:23,846 INFO L87 Difference]: Start difference. First operand 411 states and 553 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23)