./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.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_init_bounded_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 658cf0e5cfa8ff565239cc21b84be4a008587cc5aba3b9c9a0b23efea938ab87 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:50:13,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:50:13,878 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:50:13,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:50:13,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:50:13,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:50:13,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:50:13,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:50:13,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:50:13,908 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:50:13,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:50:13,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:50:13,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:50:13,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:50:13,910 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:50:13,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:50:13,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:50:13,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:50:13,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:50:13,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:50:13,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:50:13,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:50:13,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:50:13,910 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:50:13,911 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:50:13,911 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:50:13,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:50:13,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:50:13,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:50:13,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:50:13,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:50:13,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:50:13,911 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:50:13,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:50:13,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:50:13,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:50:13,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:50:13,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:50:13,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:50:13,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:50:13,913 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 -> 658cf0e5cfa8ff565239cc21b84be4a008587cc5aba3b9c9a0b23efea938ab87 [2025-02-08 01:50:14,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:50:14,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:50:14,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:50:14,206 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:50:14,206 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:50:14,207 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_init_bounded_harness.i [2025-02-08 01:50:15,506 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9c15022b/850f50e20e0a49f995f091471da8f0c7/FLAGf1ab53323 [2025-02-08 01:50:16,105 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:50:16,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i [2025-02-08 01:50:16,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9c15022b/850f50e20e0a49f995f091471da8f0c7/FLAGf1ab53323 [2025-02-08 01:50:16,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9c15022b/850f50e20e0a49f995f091471da8f0c7 [2025-02-08 01:50:16,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:50:16,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:50:16,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:50:16,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:50:16,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:50:16,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:50:16" (1/1) ... [2025-02-08 01:50:16,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d20fd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:16, skipping insertion in model container [2025-02-08 01:50:16,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:50:16" (1/1) ... [2025-02-08 01:50:16,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:50:16,628 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_init_bounded_harness.i[4501,4514] [2025-02-08 01:50:16,642 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_init_bounded_harness.i[4561,4574] [2025-02-08 01:50:17,618 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:17,619 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:17,619 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:17,620 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:17,621 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:17,632 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:17,632 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:17,634 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:17,635 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:17,636 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:17,637 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:17,638 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:17,638 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,607 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,608 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,640 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,640 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,647 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,649 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,670 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,672 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,673 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,673 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,674 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,674 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,674 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,723 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_init_bounded_harness.i[227778,227791] [2025-02-08 01:50:18,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:50:18,760 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:50:18,772 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_init_bounded_harness.i[4501,4514] [2025-02-08 01:50:18,773 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_init_bounded_harness.i[4561,4574] [2025-02-08 01:50:18,817 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,818 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,819 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,819 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,819 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,824 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,825 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,825 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,826 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,826 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,827 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,827 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,827 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:18,903 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7558-7569] [2025-02-08 01:50:19,039 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:19,041 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:19,048 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:19,049 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:19,052 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:19,053 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:19,062 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:19,063 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:19,063 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:19,063 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:19,063 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:19,063 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:19,063 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:50:19,084 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_init_bounded_harness.i[227778,227791] [2025-02-08 01:50:19,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:50:19,268 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:50:19,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:19 WrapperNode [2025-02-08 01:50:19,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:50:19,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:50:19,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:50:19,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:50:19,276 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:50:19" (1/1) ... [2025-02-08 01:50:19,353 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:50:19" (1/1) ... [2025-02-08 01:50:19,450 INFO L138 Inliner]: procedures = 763, calls = 2426, calls flagged for inlining = 67, calls inlined = 13, statements flattened = 854 [2025-02-08 01:50:19,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:50:19,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:50:19,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:50:19,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:50:19,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:19" (1/1) ... [2025-02-08 01:50:19,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:19" (1/1) ... [2025-02-08 01:50:19,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:19" (1/1) ... [2025-02-08 01:50:19,493 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 01:50:19,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:19" (1/1) ... [2025-02-08 01:50:19,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:19" (1/1) ... [2025-02-08 01:50:19,537 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:19" (1/1) ... [2025-02-08 01:50:19,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:19" (1/1) ... [2025-02-08 01:50:19,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:19" (1/1) ... [2025-02-08 01:50:19,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:19" (1/1) ... [2025-02-08 01:50:19,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:50:19,564 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:50:19,564 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:50:19,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:50:19,566 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:19" (1/1) ... [2025-02-08 01:50:19,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:50:19,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:50:19,598 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:50:19,604 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:50:19,621 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-02-08 01:50:19,622 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-02-08 01:50:19,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-08 01:50:19,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:50:19,623 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-08 01:50:19,623 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-08 01:50:19,623 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-02-08 01:50:19,623 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-02-08 01:50:19,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 01:50:19,624 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-02-08 01:50:19,624 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-02-08 01:50:19,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 01:50:19,624 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-08 01:50:19,624 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-08 01:50:19,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:50:19,624 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:50:19,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-08 01:50:19,624 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-02-08 01:50:19,625 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-02-08 01:50:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:50:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:50:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-02-08 01:50:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-02-08 01:50:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 01:50:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:50:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:50:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-02-08 01:50:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-02-08 01:50:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-08 01:50:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-08 01:50:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 01:50:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:50:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:50:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:50:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-02-08 01:50:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-02-08 01:50:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 01:50:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-02-08 01:50:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-02-08 01:50:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 01:50:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-08 01:50:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-08 01:50:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-08 01:50:19,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-08 01:50:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-02-08 01:50:19,627 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-02-08 01:50:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-08 01:50:19,627 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-08 01:50:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 01:50:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-02-08 01:50:19,627 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-02-08 01:50:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 01:50:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-02-08 01:50:19,627 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-02-08 01:50:19,972 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:50:19,975 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:50:20,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9990: havoc #t~mem1489.base, #t~mem1489.offset;havoc #t~short1490;havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~ret1492;havoc #t~short1493; [2025-02-08 01:50:20,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-08 01:50:20,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L10103: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-02-08 01:50:20,166 INFO L1324 $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;#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:50:20,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6955: havoc #t~ret589#1;havoc #t~ite591#1.base, #t~ite591#1.offset;havoc #t~ret590#1.base, #t~ret590#1.offset; [2025-02-08 01:50:20,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9183: call ULTIMATE.dealloc(~#size~0#1.base, ~#size~0#1.offset);havoc ~#size~0#1.base, ~#size~0#1.offset; [2025-02-08 01:50:20,379 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-02-08 01:50:20,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6986: havoc #t~ret600.base, #t~ret600.offset; [2025-02-08 01:50:20,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-02-08 01:50:20,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-02-08 01:50:20,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-08 01:50:20,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7009: call ULTIMATE.dealloc(aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset);havoc aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset; [2025-02-08 01:50:20,755 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9154: 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:50:20,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-02-08 01:50:20,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-02-08 01:50:26,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9242-1: assume false; [2025-02-08 01:50:26,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9242-1: assume !false; [2025-02-08 01:50:26,924 INFO L? ?]: Removed 181 outVars from TransFormulas that were not future-live. [2025-02-08 01:50:26,924 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:50:26,946 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:50:26,948 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:50:26,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:50:26 BoogieIcfgContainer [2025-02-08 01:50:26,949 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:50:26,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:50:26,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:50:26,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:50:26,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:50:16" (1/3) ... [2025-02-08 01:50:26,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125e256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:50:26, skipping insertion in model container [2025-02-08 01:50:26,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:19" (2/3) ... [2025-02-08 01:50:26,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125e256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:50:26, skipping insertion in model container [2025-02-08 01:50:26,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:50:26" (3/3) ... [2025-02-08 01:50:26,958 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_bounded_harness.i [2025-02-08 01:50:26,970 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:50:26,971 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_bounded_harness.i that has 20 procedures, 201 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 01:50:27,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:50:27,032 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;@1f7735c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:50:27,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:50:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 136 states have (on average 1.2941176470588236) internal successors, (176), 142 states have internal predecessors, (176), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-08 01:50:27,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-08 01:50:27,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:27,048 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:27,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:27,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1757987406, now seen corresponding path program 1 times [2025-02-08 01:50:27,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:27,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240634031] [2025-02-08 01:50:27,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:27,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:32,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 01:50:32,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 01:50:32,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:32,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-08 01:50:33,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:33,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240634031] [2025-02-08 01:50:33,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240634031] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:50:33,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144685908] [2025-02-08 01:50:33,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:33,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:50:33,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:50:33,509 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:50:33,511 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:50:38,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 01:50:39,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 01:50:39,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:39,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:39,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 4336 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:50:39,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:50:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-08 01:50:39,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:50:39,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144685908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:50:39,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:50:39,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:50:39,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414057061] [2025-02-08 01:50:39,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:50:39,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:50:39,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:50:39,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:50:39,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:50:39,137 INFO L87 Difference]: Start difference. First operand has 201 states, 136 states have (on average 1.2941176470588236) internal successors, (176), 142 states have internal predecessors, (176), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-08 01:50:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:50:39,252 INFO L93 Difference]: Finished difference Result 374 states and 489 transitions. [2025-02-08 01:50:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:50:39,255 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 110 [2025-02-08 01:50:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:50:39,261 INFO L225 Difference]: With dead ends: 374 [2025-02-08 01:50:39,261 INFO L226 Difference]: Without dead ends: 162 [2025-02-08 01:50:39,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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:50:39,267 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:50:39,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:50:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-08 01:50:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-08 01:50:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.2241379310344827) internal successors, (142), 116 states have internal predecessors, (142), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:50:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 197 transitions. [2025-02-08 01:50:39,326 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 197 transitions. Word has length 110 [2025-02-08 01:50:39,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:50:39,328 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 197 transitions. [2025-02-08 01:50:39,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-08 01:50:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2025-02-08 01:50:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-08 01:50:39,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:39,334 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,354 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:50:39,535 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:50:39,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:39,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -699279691, now seen corresponding path program 1 times [2025-02-08 01:50:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:39,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448356581] [2025-02-08 01:50:39,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:43,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 01:50:43,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 01:50:43,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:43,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 01:50:44,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:44,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448356581] [2025-02-08 01:50:44,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448356581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:50:44,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:50:44,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:50:44,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873737627] [2025-02-08 01:50:44,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:50:44,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:50:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:50:44,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:50:44,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:50:44,936 INFO L87 Difference]: Start difference. First operand 162 states and 197 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-08 01:50:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:50:45,197 INFO L93 Difference]: Finished difference Result 271 states and 318 transitions. [2025-02-08 01:50:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:50:45,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 110 [2025-02-08 01:50:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:50:45,200 INFO L225 Difference]: With dead ends: 271 [2025-02-08 01:50:45,200 INFO L226 Difference]: Without dead ends: 162 [2025-02-08 01:50:45,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:50:45,202 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:50:45,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 375 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:50:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-08 01:50:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-08 01:50:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 116 states have internal predecessors, (141), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:50:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 196 transitions. [2025-02-08 01:50:45,213 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 196 transitions. Word has length 110 [2025-02-08 01:50:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:50:45,214 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 196 transitions. [2025-02-08 01:50:45,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-08 01:50:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 196 transitions. [2025-02-08 01:50:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-08 01:50:45,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:45,219 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:50:45,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:45,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:45,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1485989302, now seen corresponding path program 1 times [2025-02-08 01:50:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:45,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850013588] [2025-02-08 01:50:45,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:49,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 01:50:49,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 01:50:49,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:49,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 01:50:50,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850013588] [2025-02-08 01:50:50,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850013588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:50:50,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:50:50,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:50:50,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254538414] [2025-02-08 01:50:50,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:50:50,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:50:50,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:50:50,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:50:50,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:50:50,226 INFO L87 Difference]: Start difference. First operand 162 states and 196 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-08 01:50:50,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:50:50,501 INFO L93 Difference]: Finished difference Result 249 states and 292 transitions. [2025-02-08 01:50:50,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:50:50,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2025-02-08 01:50:50,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:50:50,505 INFO L225 Difference]: With dead ends: 249 [2025-02-08 01:50:50,505 INFO L226 Difference]: Without dead ends: 162 [2025-02-08 01:50:50,506 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:50:50,506 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:50:50,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 01:50:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-08 01:50:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-08 01:50:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.206896551724138) internal successors, (140), 116 states have internal predecessors, (140), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:50:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 195 transitions. [2025-02-08 01:50:50,520 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 195 transitions. Word has length 112 [2025-02-08 01:50:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:50:50,520 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 195 transitions. [2025-02-08 01:50:50,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-08 01:50:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 195 transitions. [2025-02-08 01:50:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-08 01:50:50,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:50,523 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:50:50,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:50,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:50,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2014046519, now seen corresponding path program 1 times [2025-02-08 01:50:50,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:50,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846347527] [2025-02-08 01:50:50,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:50,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:54,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 01:50:54,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 01:50:54,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:54,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 01:50:58,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:58,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846347527] [2025-02-08 01:50:58,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846347527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:50:58,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:50:58,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:50:58,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283718803] [2025-02-08 01:50:58,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:50:58,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:50:58,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:50:58,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:50:58,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:50:58,291 INFO L87 Difference]: Start difference. First operand 162 states and 195 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-08 01:51:02,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:06,754 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:51:11,148 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:51:15,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:51:19,900 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-02-08 01:51:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:51:23,722 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2025-02-08 01:51:23,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:51:23,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 123 [2025-02-08 01:51:23,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:51:23,731 INFO L225 Difference]: With dead ends: 175 [2025-02-08 01:51:23,731 INFO L226 Difference]: Without dead ends: 167 [2025-02-08 01:51:23,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:51:23,732 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 10 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2025-02-08 01:51:23,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1025 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 5 Unknown, 0 Unchecked, 24.8s Time] [2025-02-08 01:51:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-08 01:51:23,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2025-02-08 01:51:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 118 states have internal predecessors, (142), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:51:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 197 transitions. [2025-02-08 01:51:23,749 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 197 transitions. Word has length 123 [2025-02-08 01:51:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:51:23,750 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 197 transitions. [2025-02-08 01:51:23,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-08 01:51:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 197 transitions. [2025-02-08 01:51:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-08 01:51:23,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:51:23,755 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:23,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:51:23,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:51:23,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:51:23,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1817533014, now seen corresponding path program 1 times [2025-02-08 01:51:23,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:51:23,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074499603] [2025-02-08 01:51:23,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:51:23,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:51:27,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 01:51:27,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 01:51:27,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:27,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:51:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 01:51:29,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:51:29,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074499603] [2025-02-08 01:51:29,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074499603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:51:29,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:51:29,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:51:29,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460409434] [2025-02-08 01:51:29,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:51:29,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:51:29,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:51:29,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:51:29,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:51:29,014 INFO L87 Difference]: Start difference. First operand 164 states and 197 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-08 01:51:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:51:29,741 INFO L93 Difference]: Finished difference Result 174 states and 207 transitions. [2025-02-08 01:51:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:51:29,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 123 [2025-02-08 01:51:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:51:29,744 INFO L225 Difference]: With dead ends: 174 [2025-02-08 01:51:29,744 INFO L226 Difference]: Without dead ends: 162 [2025-02-08 01:51:29,745 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-02-08 01:51:29,746 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 2 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 01:51:29,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 731 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 01:51:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-08 01:51:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-08 01:51:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.1896551724137931) internal successors, (138), 116 states have internal predecessors, (138), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:51:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 193 transitions. [2025-02-08 01:51:29,756 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 193 transitions. Word has length 123 [2025-02-08 01:51:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:51:29,757 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 193 transitions. [2025-02-08 01:51:29,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-08 01:51:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 193 transitions. [2025-02-08 01:51:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-08 01:51:29,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:51:29,758 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:29,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:51:29,759 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:51:29,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:51:29,759 INFO L85 PathProgramCache]: Analyzing trace with hash 975066298, now seen corresponding path program 1 times [2025-02-08 01:51:29,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:51:29,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436984839] [2025-02-08 01:51:29,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:51:29,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:51:33,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 01:51:33,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 01:51:33,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:51:33,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:51:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 01:51:36,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:51:36,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436984839] [2025-02-08 01:51:36,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436984839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:51:36,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:51:36,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:51:36,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953161882] [2025-02-08 01:51:36,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:51:36,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:51:36,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:51:36,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:51:36,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:51:36,451 INFO L87 Difference]: Start difference. First operand 162 states and 193 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)