./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.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 ff1d21af29f4ede949edccf5cde5ead8be8c34f2f05a7b1635759c90f0d05416 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:06:52,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:06:52,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:06:52,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:06:52,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:06:52,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:06:52,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:06:52,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:06:52,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:06:52,925 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:06:52,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:06:52,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:06:52,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:06:52,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:06:52,926 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:06:52,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:06:52,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:06:52,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:06:52,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:06:52,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:06:52,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:06:52,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:06:52,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:06:52,927 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:06:52,927 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:06:52,927 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:06:52,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:06:52,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:06:52,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:06:52,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:06:52,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:06:52,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:06:52,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:06:52,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:06:52,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:06:52,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:06:52,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:06:52,932 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:06:52,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:06:52,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:06:52,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:06:52,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:06:52,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:06:52,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:06:52,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:06:52,932 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 -> ff1d21af29f4ede949edccf5cde5ead8be8c34f2f05a7b1635759c90f0d05416 [2025-01-09 18:06:53,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:06:53,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:06:53,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:06:53,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:06:53,167 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:06:53,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2025-01-09 18:06:54,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ca5ccf45/93b0605b63664bb3a5276d2d4f94316c/FLAG10019eb6e [2025-01-09 18:06:54,795 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:06:54,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2025-01-09 18:06:54,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ca5ccf45/93b0605b63664bb3a5276d2d4f94316c/FLAG10019eb6e [2025-01-09 18:06:54,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ca5ccf45/93b0605b63664bb3a5276d2d4f94316c [2025-01-09 18:06:54,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:06:54,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:06:54,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:06:54,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:06:54,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:06:54,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:54" (1/1) ... [2025-01-09 18:06:54,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172afdd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:54, skipping insertion in model container [2025-01-09 18:06:54,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:54" (1/1) ... [2025-01-09 18:06:54,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:06:55,901 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/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2025-01-09 18:06:55,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:06:55,943 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:06:56,049 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4703] [2025-01-09 18:06:56,052 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4710] [2025-01-09 18:06:56,052 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4718-4719] [2025-01-09 18:06:56,052 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4727-4728] [2025-01-09 18:06:56,053 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4750] [2025-01-09 18:06:56,053 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4753] [2025-01-09 18:06:56,054 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4756] [2025-01-09 18:06:56,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4759] [2025-01-09 18:06:56,075 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5123] [2025-01-09 18:06:56,076 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5127] [2025-01-09 18:06:56,076 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5131] [2025-01-09 18:06:56,076 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5135] [2025-01-09 18:06:56,076 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5146] [2025-01-09 18:06:56,077 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5150] [2025-01-09 18:06:56,077 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5154] [2025-01-09 18:06:56,077 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5158] [2025-01-09 18:06:56,077 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5169] [2025-01-09 18:06:56,077 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5173] [2025-01-09 18:06:56,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5177] [2025-01-09 18:06:56,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5181] [2025-01-09 18:06:56,081 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5192] [2025-01-09 18:06:56,081 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5196] [2025-01-09 18:06:56,081 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5200] [2025-01-09 18:06:56,081 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5204] [2025-01-09 18:06:56,082 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5254] [2025-01-09 18:06:56,082 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5258] [2025-01-09 18:06:56,083 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5262] [2025-01-09 18:06:56,083 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5266] [2025-01-09 18:06:56,083 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5277] [2025-01-09 18:06:56,083 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5281] [2025-01-09 18:06:56,086 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5285] [2025-01-09 18:06:56,086 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5289] [2025-01-09 18:06:56,087 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5300] [2025-01-09 18:06:56,087 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5304] [2025-01-09 18:06:56,089 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5308] [2025-01-09 18:06:56,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5312] [2025-01-09 18:06:56,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5323] [2025-01-09 18:06:56,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5327] [2025-01-09 18:06:56,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5331] [2025-01-09 18:06:56,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5335] [2025-01-09 18:06:56,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5409] [2025-01-09 18:06:56,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5413] [2025-01-09 18:06:56,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5417] [2025-01-09 18:06:56,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5421] [2025-01-09 18:06:56,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5432] [2025-01-09 18:06:56,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5436] [2025-01-09 18:06:56,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5440] [2025-01-09 18:06:56,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5444] [2025-01-09 18:06:56,100 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5455] [2025-01-09 18:06:56,100 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5459] [2025-01-09 18:06:56,101 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5463] [2025-01-09 18:06:56,101 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5467] [2025-01-09 18:06:56,170 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6408] [2025-01-09 18:06:56,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6411] [2025-01-09 18:06:56,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6414] [2025-01-09 18:06:56,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6417] [2025-01-09 18:06:56,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6420] [2025-01-09 18:06:56,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6433] [2025-01-09 18:06:56,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6436] [2025-01-09 18:06:56,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6439] [2025-01-09 18:06:56,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6442] [2025-01-09 18:06:56,174 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6445] [2025-01-09 18:06:56,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6467] [2025-01-09 18:06:56,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6470] [2025-01-09 18:06:56,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6473] [2025-01-09 18:06:56,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6476] [2025-01-09 18:06:56,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6479] [2025-01-09 18:06:56,176 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6512-6513] [2025-01-09 18:06:56,177 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6516-6517] [2025-01-09 18:06:56,177 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6520-6521] [2025-01-09 18:06:56,177 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6524-6525] [2025-01-09 18:06:56,178 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6528-6529] [2025-01-09 18:06:56,179 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6542] [2025-01-09 18:06:56,179 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6545] [2025-01-09 18:06:56,179 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6548] [2025-01-09 18:06:56,179 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6551] [2025-01-09 18:06:56,181 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6554] [2025-01-09 18:06:56,182 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6587-6588] [2025-01-09 18:06:56,183 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6591-6592] [2025-01-09 18:06:56,183 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6595-6596] [2025-01-09 18:06:56,183 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6599-6600] [2025-01-09 18:06:56,183 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6603-6604] [2025-01-09 18:06:56,210 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/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2025-01-09 18:06:56,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:06:56,315 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:06:56,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56 WrapperNode [2025-01-09 18:06:56,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:06:56,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:06:56,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:06:56,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:06:56,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56" (1/1) ... [2025-01-09 18:06:56,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56" (1/1) ... [2025-01-09 18:06:56,465 INFO L138 Inliner]: procedures = 156, calls = 823, calls flagged for inlining = 81, calls inlined = 80, statements flattened = 3012 [2025-01-09 18:06:56,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:06:56,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:06:56,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:06:56,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:06:56,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56" (1/1) ... [2025-01-09 18:06:56,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56" (1/1) ... [2025-01-09 18:06:56,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56" (1/1) ... [2025-01-09 18:06:56,800 INFO L175 MemorySlicer]: Split 420 memory accesses to 11 slices as follows [2, 1, 2, 3, 4, 336, 12, 36, 22, 1, 1]. 80 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0]. The 177 writes are split as follows [0, 0, 0, 0, 1, 105, 12, 36, 22, 0, 1]. [2025-01-09 18:06:56,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56" (1/1) ... [2025-01-09 18:06:56,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56" (1/1) ... [2025-01-09 18:06:56,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56" (1/1) ... [2025-01-09 18:06:56,872 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56" (1/1) ... [2025-01-09 18:06:56,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56" (1/1) ... [2025-01-09 18:06:56,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56" (1/1) ... [2025-01-09 18:06:56,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56" (1/1) ... [2025-01-09 18:06:56,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:06:56,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:06:56,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:06:56,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:06:56,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56" (1/1) ... [2025-01-09 18:06:56,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:06:56,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:06:56,984 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-01-09 18:06:56,990 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-01-09 18:06:57,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:06:57,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:06:57,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:06:57,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:06:57,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:06:57,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:06:57,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:06:57,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:06:57,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:06:57,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:06:57,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:06:57,007 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2025-01-09 18:06:57,007 INFO L138 BoogieDeclarations]: Found implementation of procedure __xchg_wrong_size [2025-01-09 18:06:57,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 18:06:57,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 18:06:57,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 18:06:57,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 18:06:57,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 18:06:57,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 18:06:57,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 18:06:57,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 18:06:57,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:06:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-01-09 18:06:57,009 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-01-09 18:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2025-01-09 18:06:57,009 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2025-01-09 18:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2025-01-09 18:06:57,009 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2025-01-09 18:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:06:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:06:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:06:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:06:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:06:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:06:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:06:57,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-01-09 18:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-01-09 18:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-01-09 18:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-01-09 18:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2025-01-09 18:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2025-01-09 18:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 18:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2025-01-09 18:06:57,011 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2025-01-09 18:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:06:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2025-01-09 18:06:57,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2025-01-09 18:06:57,012 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-01-09 18:06:57,012 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:06:57,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-01-09 18:06:57,012 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-01-09 18:06:57,012 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2025-01-09 18:06:57,012 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2025-01-09 18:06:57,012 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-01-09 18:06:57,012 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2025-01-09 18:06:57,012 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2025-01-09 18:06:57,012 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2025-01-09 18:06:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-01-09 18:06:57,015 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-01-09 18:06:57,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2025-01-09 18:06:57,015 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2025-01-09 18:06:57,015 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2025-01-09 18:06:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-01-09 18:06:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 18:06:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-09 18:06:57,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:06:57,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:06:57,018 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2025-01-09 18:06:57,018 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2025-01-09 18:06:57,018 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-01-09 18:06:57,018 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-01-09 18:06:57,439 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:06:57,442 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:07:03,742 INFO L? ?]: Removed 1464 outVars from TransFormulas that were not future-live. [2025-01-09 18:07:03,743 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:07:03,773 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:07:03,776 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 18:07:03,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:07:03 BoogieIcfgContainer [2025-01-09 18:07:03,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:07:03,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:07:03,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:07:03,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:07:03,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:06:54" (1/3) ... [2025-01-09 18:07:03,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c2ac052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:07:03, skipping insertion in model container [2025-01-09 18:07:03,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56" (2/3) ... [2025-01-09 18:07:03,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c2ac052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:07:03, skipping insertion in model container [2025-01-09 18:07:03,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:07:03" (3/3) ... [2025-01-09 18:07:03,783 INFO L128 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2025-01-09 18:07:03,793 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:07:03,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i that has 56 procedures, 1109 locations, 1 initial locations, 23 loop locations, and 1 error locations. [2025-01-09 18:07:03,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:07:03,843 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;@672d46ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:07:03,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:07:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 1059 states, 778 states have (on average 1.4254498714652957) internal successors, (1109), 816 states have internal predecessors, (1109), 234 states have call successors, (234), 45 states have call predecessors, (234), 45 states have return successors, (234), 232 states have call predecessors, (234), 234 states have call successors, (234) [2025-01-09 18:07:03,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 18:07:03,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:03,857 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 18:07:03,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:03,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash -435619044, now seen corresponding path program 1 times [2025-01-09 18:07:03,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:03,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592413238] [2025-01-09 18:07:03,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:04,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 18:07:04,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 18:07:04,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:04,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 18:07:04,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:04,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592413238] [2025-01-09 18:07:04,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592413238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:04,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:04,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:07:04,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392754291] [2025-01-09 18:07:04,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:04,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:07:04,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:04,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:07:04,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:04,667 INFO L87 Difference]: Start difference. First operand has 1059 states, 778 states have (on average 1.4254498714652957) internal successors, (1109), 816 states have internal predecessors, (1109), 234 states have call successors, (234), 45 states have call predecessors, (234), 45 states have return successors, (234), 232 states have call predecessors, (234), 234 states have call successors, (234) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 18:07:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:04,804 INFO L93 Difference]: Finished difference Result 2114 states and 3164 transitions. [2025-01-09 18:07:04,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:07:04,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2025-01-09 18:07:04,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:04,827 INFO L225 Difference]: With dead ends: 2114 [2025-01-09 18:07:04,830 INFO L226 Difference]: Without dead ends: 1016 [2025-01-09 18:07:04,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:04,841 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 1565 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 1560 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:04,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 1560 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:04,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-01-09 18:07:04,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2025-01-09 18:07:04,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 746 states have (on average 1.415549597855228) internal successors, (1056), 781 states have internal predecessors, (1056), 224 states have call successors, (224), 45 states have call predecessors, (224), 45 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-01-09 18:07:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1504 transitions. [2025-01-09 18:07:04,956 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1504 transitions. Word has length 77 [2025-01-09 18:07:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:04,957 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1504 transitions. [2025-01-09 18:07:04,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 18:07:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1504 transitions. [2025-01-09 18:07:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 18:07:04,963 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:04,963 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 18:07:04,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:07:04,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:04,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:04,964 INFO L85 PathProgramCache]: Analyzing trace with hash 125080734, now seen corresponding path program 1 times [2025-01-09 18:07:04,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:04,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646596896] [2025-01-09 18:07:04,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:04,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:05,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 18:07:05,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 18:07:05,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:05,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 18:07:05,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:05,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646596896] [2025-01-09 18:07:05,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646596896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:05,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:05,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:07:05,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177428504] [2025-01-09 18:07:05,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:05,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:07:05,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:05,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:07:05,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:07:05,766 INFO L87 Difference]: Start difference. First operand 1016 states and 1504 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 18:07:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:05,825 INFO L93 Difference]: Finished difference Result 1020 states and 1508 transitions. [2025-01-09 18:07:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:07:05,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 77 [2025-01-09 18:07:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:05,835 INFO L225 Difference]: With dead ends: 1020 [2025-01-09 18:07:05,835 INFO L226 Difference]: Without dead ends: 1018 [2025-01-09 18:07:05,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:07:05,840 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 0 mSDsluCounter, 2997 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4499 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:05,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4499 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:05,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-01-09 18:07:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2025-01-09 18:07:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 748 states have (on average 1.414438502673797) internal successors, (1058), 783 states have internal predecessors, (1058), 224 states have call successors, (224), 45 states have call predecessors, (224), 45 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-01-09 18:07:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1506 transitions. [2025-01-09 18:07:05,891 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1506 transitions. Word has length 77 [2025-01-09 18:07:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:05,892 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1506 transitions. [2025-01-09 18:07:05,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 18:07:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1506 transitions. [2025-01-09 18:07:05,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 18:07:05,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:05,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 18:07:05,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:07:05,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:05,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:05,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2090450252, now seen corresponding path program 1 times [2025-01-09 18:07:05,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:05,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883501759] [2025-01-09 18:07:05,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:05,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:06,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 18:07:06,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 18:07:06,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:06,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 18:07:06,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:06,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883501759] [2025-01-09 18:07:06,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883501759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:06,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:06,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:07:06,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488363555] [2025-01-09 18:07:06,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:06,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:07:06,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:06,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:07:06,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:07:06,309 INFO L87 Difference]: Start difference. First operand 1018 states and 1506 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 18:07:10,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:07:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:10,936 INFO L93 Difference]: Finished difference Result 2016 states and 2986 transitions. [2025-01-09 18:07:10,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:07:10,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-01-09 18:07:10,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:10,941 INFO L225 Difference]: With dead ends: 2016 [2025-01-09 18:07:10,941 INFO L226 Difference]: Without dead ends: 1029 [2025-01-09 18:07:10,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:07:10,944 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 1487 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:10,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 2536 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 470 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 18:07:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-01-09 18:07:10,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1019. [2025-01-09 18:07:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 749 states have (on average 1.4138851802403205) internal successors, (1059), 784 states have internal predecessors, (1059), 224 states have call successors, (224), 45 states have call predecessors, (224), 45 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-01-09 18:07:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1507 transitions. [2025-01-09 18:07:10,980 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1507 transitions. Word has length 87 [2025-01-09 18:07:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:10,980 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1507 transitions. [2025-01-09 18:07:10,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 18:07:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1507 transitions. [2025-01-09 18:07:10,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 18:07:10,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:10,984 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 18:07:10,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:07:10,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:10,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash -203642219, now seen corresponding path program 1 times [2025-01-09 18:07:10,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:10,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316339306] [2025-01-09 18:07:10,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:10,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:11,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 18:07:11,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 18:07:11,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:11,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 18:07:11,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:11,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316339306] [2025-01-09 18:07:11,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316339306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:11,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:11,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:07:11,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987534744] [2025-01-09 18:07:11,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:11,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:07:11,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:11,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:07:11,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:07:11,419 INFO L87 Difference]: Start difference. First operand 1019 states and 1507 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 18:07:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:11,510 INFO L93 Difference]: Finished difference Result 1036 states and 1530 transitions. [2025-01-09 18:07:11,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:07:11,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 89 [2025-01-09 18:07:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:11,518 INFO L225 Difference]: With dead ends: 1036 [2025-01-09 18:07:11,518 INFO L226 Difference]: Without dead ends: 1034 [2025-01-09 18:07:11,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:07:11,519 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 120 mSDsluCounter, 4349 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 5853 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:11,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 5853 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:07:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-01-09 18:07:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1021. [2025-01-09 18:07:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 750 states have (on average 1.4133333333333333) internal successors, (1060), 784 states have internal predecessors, (1060), 225 states have call successors, (225), 45 states have call predecessors, (225), 45 states have return successors, (225), 223 states have call predecessors, (225), 225 states have call successors, (225) [2025-01-09 18:07:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1510 transitions. [2025-01-09 18:07:11,550 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1510 transitions. Word has length 89 [2025-01-09 18:07:11,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:11,550 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1510 transitions. [2025-01-09 18:07:11,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 18:07:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1510 transitions. [2025-01-09 18:07:11,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 18:07:11,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:11,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 18:07:11,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:07:11,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:11,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:11,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1220669769, now seen corresponding path program 1 times [2025-01-09 18:07:11,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:11,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776272048] [2025-01-09 18:07:11,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:11,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:11,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 18:07:11,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 18:07:11,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:11,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 18:07:11,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:11,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776272048] [2025-01-09 18:07:11,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776272048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:11,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:11,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:07:11,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956094362] [2025-01-09 18:07:11,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:11,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:07:11,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:11,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:07:11,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:11,879 INFO L87 Difference]: Start difference. First operand 1021 states and 1510 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 18:07:15,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:07:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:16,024 INFO L93 Difference]: Finished difference Result 2974 states and 4404 transitions. [2025-01-09 18:07:16,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:07:16,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-01-09 18:07:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:16,037 INFO L225 Difference]: With dead ends: 2974 [2025-01-09 18:07:16,037 INFO L226 Difference]: Without dead ends: 1984 [2025-01-09 18:07:16,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:16,041 INFO L435 NwaCegarLoop]: 1756 mSDtfsCounter, 1438 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:16,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 3193 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:07:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2025-01-09 18:07:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1982. [2025-01-09 18:07:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1457 states have (on average 1.4172958133150309) internal successors, (2065), 1524 states have internal predecessors, (2065), 435 states have call successors, (435), 89 states have call predecessors, (435), 89 states have return successors, (435), 431 states have call predecessors, (435), 435 states have call successors, (435) [2025-01-09 18:07:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2935 transitions. [2025-01-09 18:07:16,187 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2935 transitions. Word has length 121 [2025-01-09 18:07:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:16,189 INFO L471 AbstractCegarLoop]: Abstraction has 1982 states and 2935 transitions. [2025-01-09 18:07:16,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 18:07:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2935 transitions. [2025-01-09 18:07:16,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 18:07:16,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:16,198 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-01-09 18:07:16,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:07:16,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:16,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:16,199 INFO L85 PathProgramCache]: Analyzing trace with hash 892087083, now seen corresponding path program 1 times [2025-01-09 18:07:16,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:16,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246337648] [2025-01-09 18:07:16,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:16,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:16,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 18:07:16,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 18:07:16,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:16,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 18:07:16,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:16,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246337648] [2025-01-09 18:07:16,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246337648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:16,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:16,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:07:16,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628143468] [2025-01-09 18:07:16,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:16,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:07:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:16,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:07:16,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:07:16,633 INFO L87 Difference]: Start difference. First operand 1982 states and 2935 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:07:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:16,708 INFO L93 Difference]: Finished difference Result 2995 states and 4422 transitions. [2025-01-09 18:07:16,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:07:16,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2025-01-09 18:07:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:16,714 INFO L225 Difference]: With dead ends: 2995 [2025-01-09 18:07:16,714 INFO L226 Difference]: Without dead ends: 1042 [2025-01-09 18:07:16,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:07:16,720 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 0 mSDsluCounter, 2999 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4502 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:16,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4502 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2025-01-09 18:07:16,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2025-01-09 18:07:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 765 states have (on average 1.4039215686274509) internal successors, (1074), 799 states have internal predecessors, (1074), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-01-09 18:07:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1526 transitions. [2025-01-09 18:07:16,773 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1526 transitions. Word has length 123 [2025-01-09 18:07:16,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:16,773 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1526 transitions. [2025-01-09 18:07:16,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:07:16,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1526 transitions. [2025-01-09 18:07:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 18:07:16,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:16,777 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-01-09 18:07:16,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:07:16,777 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:16,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:16,778 INFO L85 PathProgramCache]: Analyzing trace with hash 658349635, now seen corresponding path program 1 times [2025-01-09 18:07:16,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:16,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140833866] [2025-01-09 18:07:16,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:16,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:16,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 18:07:17,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 18:07:17,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:17,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:17,159 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 18:07:17,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:17,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140833866] [2025-01-09 18:07:17,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140833866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:17,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:17,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:07:17,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763193127] [2025-01-09 18:07:17,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:17,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:07:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:17,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:07:17,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:07:17,163 INFO L87 Difference]: Start difference. First operand 1042 states and 1526 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 18:07:21,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:07:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:22,124 INFO L93 Difference]: Finished difference Result 2059 states and 3033 transitions. [2025-01-09 18:07:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:07:22,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-01-09 18:07:22,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:22,133 INFO L225 Difference]: With dead ends: 2059 [2025-01-09 18:07:22,133 INFO L226 Difference]: Without dead ends: 1069 [2025-01-09 18:07:22,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:07:22,137 INFO L435 NwaCegarLoop]: 1486 mSDtfsCounter, 1498 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:22,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 2522 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 483 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-01-09 18:07:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-01-09 18:07:22,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1046. [2025-01-09 18:07:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 769 states have (on average 1.4031209362808843) internal successors, (1079), 803 states have internal predecessors, (1079), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-01-09 18:07:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1531 transitions. [2025-01-09 18:07:22,186 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1531 transitions. Word has length 123 [2025-01-09 18:07:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:22,186 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1531 transitions. [2025-01-09 18:07:22,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 18:07:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1531 transitions. [2025-01-09 18:07:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 18:07:22,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:22,190 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2025-01-09 18:07:22,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:07:22,191 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:22,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:22,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1659160610, now seen corresponding path program 1 times [2025-01-09 18:07:22,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:22,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564154968] [2025-01-09 18:07:22,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:22,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:22,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 18:07:22,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 18:07:22,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:22,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 18:07:22,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:22,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564154968] [2025-01-09 18:07:22,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564154968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:22,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:22,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:07:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617394876] [2025-01-09 18:07:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:22,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:07:22,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:22,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:07:22,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:22,507 INFO L87 Difference]: Start difference. First operand 1046 states and 1531 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 18:07:22,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:22,562 INFO L93 Difference]: Finished difference Result 2040 states and 3010 transitions. [2025-01-09 18:07:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:07:22,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2025-01-09 18:07:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:22,568 INFO L225 Difference]: With dead ends: 2040 [2025-01-09 18:07:22,569 INFO L226 Difference]: Without dead ends: 1046 [2025-01-09 18:07:22,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:22,573 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 0 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2980 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:22,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2980 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-01-09 18:07:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2025-01-09 18:07:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 769 states have (on average 1.399219765929779) internal successors, (1076), 803 states have internal predecessors, (1076), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-01-09 18:07:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1528 transitions. [2025-01-09 18:07:22,618 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1528 transitions. Word has length 126 [2025-01-09 18:07:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:22,619 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1528 transitions. [2025-01-09 18:07:22,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 18:07:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1528 transitions. [2025-01-09 18:07:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 18:07:22,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:22,624 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-01-09 18:07:22,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:07:22,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:22,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash 337306595, now seen corresponding path program 1 times [2025-01-09 18:07:22,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:22,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750976058] [2025-01-09 18:07:22,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:22,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:22,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 18:07:22,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 18:07:22,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:22,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 18:07:23,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:23,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750976058] [2025-01-09 18:07:23,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750976058] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:07:23,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544065129] [2025-01-09 18:07:23,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:23,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:07:23,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:07:23,040 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-01-09 18:07:23,043 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-01-09 18:07:23,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 18:07:23,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 18:07:23,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:23,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:23,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 18:07:23,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:07:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 18:07:23,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:07:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 18:07:24,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544065129] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:07:24,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:07:24,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2025-01-09 18:07:24,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636121498] [2025-01-09 18:07:24,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:07:24,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 18:07:24,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:24,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 18:07:24,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-09 18:07:24,193 INFO L87 Difference]: Start difference. First operand 1046 states and 1528 transitions. Second operand has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-01-09 18:07:28,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:07:32,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:07:36,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:07:40,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:07:44,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:07:48,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:07:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:49,132 INFO L93 Difference]: Finished difference Result 2120 states and 3117 transitions. [2025-01-09 18:07:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 18:07:49,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 129 [2025-01-09 18:07:49,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:49,140 INFO L225 Difference]: With dead ends: 2120 [2025-01-09 18:07:49,140 INFO L226 Difference]: Without dead ends: 1126 [2025-01-09 18:07:49,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-01-09 18:07:49,145 INFO L435 NwaCegarLoop]: 1486 mSDtfsCounter, 1641 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 57 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1653 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:49,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1653 Valid, 2568 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 526 Invalid, 6 Unknown, 0 Unchecked, 24.8s Time] [2025-01-09 18:07:49,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2025-01-09 18:07:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1053. [2025-01-09 18:07:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 776 states have (on average 1.3981958762886597) internal successors, (1085), 810 states have internal predecessors, (1085), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-01-09 18:07:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1537 transitions. [2025-01-09 18:07:49,194 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1537 transitions. Word has length 129 [2025-01-09 18:07:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:49,194 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1537 transitions. [2025-01-09 18:07:49,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-01-09 18:07:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1537 transitions. [2025-01-09 18:07:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 18:07:49,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:49,199 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:07:49,213 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-01-09 18:07:49,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:07:49,403 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:49,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1735573121, now seen corresponding path program 1 times [2025-01-09 18:07:49,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:49,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095414092] [2025-01-09 18:07:49,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:49,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:49,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 18:07:49,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 18:07:49,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:49,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 18:07:50,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:50,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095414092] [2025-01-09 18:07:50,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095414092] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:07:50,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056261664] [2025-01-09 18:07:50,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:50,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:07:50,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:07:50,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:07:50,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 18:07:50,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 18:07:51,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 18:07:51,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:51,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:51,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 18:07:51,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:07:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 18:07:51,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:07:51,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056261664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:51,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:07:51,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-01-09 18:07:51,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709235328] [2025-01-09 18:07:51,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:51,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:07:51,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:51,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:07:51,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 18:07:51,127 INFO L87 Difference]: Start difference. First operand 1053 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:07:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:51,168 INFO L93 Difference]: Finished difference Result 2079 states and 3043 transitions. [2025-01-09 18:07:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:07:51,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-01-09 18:07:51,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:51,173 INFO L225 Difference]: With dead ends: 2079 [2025-01-09 18:07:51,173 INFO L226 Difference]: Without dead ends: 1053 [2025-01-09 18:07:51,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 18:07:51,175 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 2 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:51,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2983 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2025-01-09 18:07:51,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1053. [2025-01-09 18:07:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 776 states have (on average 1.3969072164948453) internal successors, (1084), 810 states have internal predecessors, (1084), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-01-09 18:07:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1536 transitions. [2025-01-09 18:07:51,211 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1536 transitions. Word has length 139 [2025-01-09 18:07:51,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:51,211 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1536 transitions. [2025-01-09 18:07:51,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:07:51,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1536 transitions. [2025-01-09 18:07:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 18:07:51,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:51,216 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:07:51,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 18:07:51,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:07:51,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:51,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:51,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1974187650, now seen corresponding path program 1 times [2025-01-09 18:07:51,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:51,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740137335] [2025-01-09 18:07:51,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:51,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:51,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 18:07:51,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 18:07:51,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:51,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 18:07:52,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:52,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740137335] [2025-01-09 18:07:52,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740137335] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:07:52,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184813105] [2025-01-09 18:07:52,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:52,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:07:52,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:07:52,475 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:07:52,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 18:07:53,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 18:07:53,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 18:07:53,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:53,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:53,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 1270 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 18:07:53,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:07:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 18:07:53,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:07:53,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184813105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:53,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:07:53,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-01-09 18:07:53,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242834240] [2025-01-09 18:07:53,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:53,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:07:53,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:53,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:07:53,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 18:07:53,298 INFO L87 Difference]: Start difference. First operand 1053 states and 1536 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:07:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:53,372 INFO L93 Difference]: Finished difference Result 2056 states and 3016 transitions. [2025-01-09 18:07:53,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:07:53,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-01-09 18:07:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:53,378 INFO L225 Difference]: With dead ends: 2056 [2025-01-09 18:07:53,378 INFO L226 Difference]: Without dead ends: 1055 [2025-01-09 18:07:53,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 18:07:53,380 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 0 mSDsluCounter, 2967 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4460 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:53,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4460 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:53,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-01-09 18:07:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1055. [2025-01-09 18:07:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 778 states have (on average 1.3958868894601542) internal successors, (1086), 812 states have internal predecessors, (1086), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-01-09 18:07:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1538 transitions. [2025-01-09 18:07:53,416 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1538 transitions. Word has length 141 [2025-01-09 18:07:53,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:53,416 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1538 transitions. [2025-01-09 18:07:53,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:07:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1538 transitions. [2025-01-09 18:07:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 18:07:53,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:53,420 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 18:07:53,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 18:07:53,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:07:53,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:53,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:53,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1466397894, now seen corresponding path program 1 times [2025-01-09 18:07:53,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:53,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960003064] [2025-01-09 18:07:53,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:53,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:53,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 18:07:53,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 18:07:53,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:53,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 18:07:54,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:54,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960003064] [2025-01-09 18:07:54,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960003064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:54,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:54,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:07:54,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812857358] [2025-01-09 18:07:54,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:54,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:07:54,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:54,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:07:54,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:54,042 INFO L87 Difference]: Start difference. First operand 1055 states and 1538 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:07:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:54,124 INFO L93 Difference]: Finished difference Result 2060 states and 3021 transitions. [2025-01-09 18:07:54,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:07:54,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 149 [2025-01-09 18:07:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:54,131 INFO L225 Difference]: With dead ends: 2060 [2025-01-09 18:07:54,131 INFO L226 Difference]: Without dead ends: 1057 [2025-01-09 18:07:54,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:54,133 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 2 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:54,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2971 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2025-01-09 18:07:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1057. [2025-01-09 18:07:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 780 states have (on average 1.3948717948717948) internal successors, (1088), 814 states have internal predecessors, (1088), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-01-09 18:07:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1540 transitions. [2025-01-09 18:07:54,169 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1540 transitions. Word has length 149 [2025-01-09 18:07:54,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:54,171 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1540 transitions. [2025-01-09 18:07:54,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:07:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1540 transitions. [2025-01-09 18:07:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 18:07:54,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:54,174 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 18:07:54,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 18:07:54,175 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:54,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:54,176 INFO L85 PathProgramCache]: Analyzing trace with hash 795756235, now seen corresponding path program 1 times [2025-01-09 18:07:54,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:54,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129315493] [2025-01-09 18:07:54,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:54,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:54,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 18:07:54,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 18:07:54,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:54,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 18:07:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:55,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129315493] [2025-01-09 18:07:55,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129315493] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:07:55,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941007004] [2025-01-09 18:07:55,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:55,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:07:55,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:07:55,168 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:07:55,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 18:07:55,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 18:07:56,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 18:07:56,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:56,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:56,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 18:07:56,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:07:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 18:07:56,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:07:56,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941007004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:56,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:07:56,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2025-01-09 18:07:56,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089137882] [2025-01-09 18:07:56,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:56,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:07:56,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:56,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:07:56,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 18:07:56,152 INFO L87 Difference]: Start difference. First operand 1057 states and 1540 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 18:07:56,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:56,334 INFO L93 Difference]: Finished difference Result 2070 states and 3034 transitions. [2025-01-09 18:07:56,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:07:56,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 158 [2025-01-09 18:07:56,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:56,351 INFO L225 Difference]: With dead ends: 2070 [2025-01-09 18:07:56,352 INFO L226 Difference]: Without dead ends: 1065 [2025-01-09 18:07:56,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 18:07:56,354 INFO L435 NwaCegarLoop]: 1492 mSDtfsCounter, 2 mSDsluCounter, 5949 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7441 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:56,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7441 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:07:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-01-09 18:07:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1062. [2025-01-09 18:07:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 784 states have (on average 1.3928571428571428) internal successors, (1092), 818 states have internal predecessors, (1092), 226 states have call successors, (226), 50 states have call predecessors, (226), 51 states have return successors, (230), 225 states have call predecessors, (230), 226 states have call successors, (230) [2025-01-09 18:07:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1548 transitions. [2025-01-09 18:07:56,464 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1548 transitions. Word has length 158 [2025-01-09 18:07:56,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:56,469 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1548 transitions. [2025-01-09 18:07:56,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 18:07:56,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1548 transitions. [2025-01-09 18:07:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 18:07:56,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:56,478 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 18:07:56,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 18:07:56,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 18:07:56,681 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:56,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:56,682 INFO L85 PathProgramCache]: Analyzing trace with hash 923956923, now seen corresponding path program 1 times [2025-01-09 18:07:56,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:56,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902749831] [2025-01-09 18:07:56,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:56,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:56,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 18:07:56,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 18:07:56,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:56,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 18:07:57,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:57,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902749831] [2025-01-09 18:07:57,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902749831] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:07:57,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688379312] [2025-01-09 18:07:57,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:57,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:07:57,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:07:57,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:07:57,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 18:07:58,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 18:07:58,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 18:07:58,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:58,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:58,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 18:07:58,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:07:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 18:07:58,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:07:58,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688379312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:58,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:07:58,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2025-01-09 18:07:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868937926] [2025-01-09 18:07:58,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:58,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 18:07:58,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:58,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 18:07:58,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 18:07:58,362 INFO L87 Difference]: Start difference. First operand 1062 states and 1548 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 18:07:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:58,538 INFO L93 Difference]: Finished difference Result 2093 states and 3067 transitions. [2025-01-09 18:07:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 18:07:58,539 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 2 states have call successors, (18) Word has length 161 [2025-01-09 18:07:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:58,544 INFO L225 Difference]: With dead ends: 2093 [2025-01-09 18:07:58,544 INFO L226 Difference]: Without dead ends: 1068 [2025-01-09 18:07:58,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 18:07:58,547 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 50 mSDsluCounter, 10419 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 11914 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:58,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 11914 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:07:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2025-01-09 18:07:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1064. [2025-01-09 18:07:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 785 states have (on average 1.392356687898089) internal successors, (1093), 820 states have internal predecessors, (1093), 226 states have call successors, (226), 50 states have call predecessors, (226), 52 states have return successors, (231), 225 states have call predecessors, (231), 226 states have call successors, (231) [2025-01-09 18:07:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1550 transitions. [2025-01-09 18:07:58,595 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1550 transitions. Word has length 161 [2025-01-09 18:07:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:58,596 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1550 transitions. [2025-01-09 18:07:58,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 18:07:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1550 transitions. [2025-01-09 18:07:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 18:07:58,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:58,600 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 18:07:58,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 18:07:58,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 18:07:58,805 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:58,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:58,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1417668525, now seen corresponding path program 2 times [2025-01-09 18:07:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:58,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942170562] [2025-01-09 18:07:58,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 18:07:58,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:59,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-01-09 18:07:59,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 18:07:59,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 18:07:59,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:08:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 18:08:05,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:08:05,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942170562] [2025-01-09 18:08:05,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942170562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:08:05,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600112264] [2025-01-09 18:08:05,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 18:08:05,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:08:05,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:08:05,712 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:08:05,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 18:08:06,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes.