./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0992725f389f0adb842356ba35094ebe66d38080cd0511ed76d42d3b12708c0b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 08:27:12,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 08:27:12,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 08:27:12,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 08:27:12,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 08:27:12,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 08:27:12,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 08:27:12,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 08:27:12,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 08:27:12,502 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 08:27:12,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 08:27:12,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 08:27:12,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 08:27:12,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 08:27:12,502 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 08:27:12,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 08:27:12,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 08:27:12,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 08:27:12,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 08:27:12,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 08:27:12,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 08:27:12,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 08:27:12,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 08:27:12,503 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 08:27:12,503 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 08:27:12,504 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 08:27:12,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 08:27:12,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 08:27:12,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 08:27:12,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 08:27:12,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 08:27:12,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 08:27:12,504 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 08:27:12,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 08:27:12,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 08:27:12,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 08:27:12,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 08:27:12,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 08:27:12,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 08:27:12,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 08:27:12,505 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0992725f389f0adb842356ba35094ebe66d38080cd0511ed76d42d3b12708c0b [2025-03-17 08:27:12,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 08:27:12,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 08:27:12,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 08:27:12,782 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 08:27:12,782 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 08:27:12,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2025-03-17 08:27:13,928 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5082756b/f6615e6ce791438e86de85d8f2bdf8fe/FLAG23717e8e8 [2025-03-17 08:27:14,396 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 08:27:14,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2025-03-17 08:27:14,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5082756b/f6615e6ce791438e86de85d8f2bdf8fe/FLAG23717e8e8 [2025-03-17 08:27:14,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5082756b/f6615e6ce791438e86de85d8f2bdf8fe [2025-03-17 08:27:14,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 08:27:14,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 08:27:14,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 08:27:14,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 08:27:14,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 08:27:14,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:27:14" (1/1) ... [2025-03-17 08:27:14,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505924de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:14, skipping insertion in model container [2025-03-17 08:27:14,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:27:14" (1/1) ... [2025-03-17 08:27:14,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 08:27:15,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2025-03-17 08:27:16,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 08:27:16,054 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 08:27:16,114 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"); [4690] [2025-03-17 08:27:16,116 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)); [4697] [2025-03-17 08:27:16,116 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"); [4705-4706] [2025-03-17 08:27:16,116 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"); [4714-4715] [2025-03-17 08:27:16,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2025-03-17 08:27:16,121 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4838] [2025-03-17 08:27:16,121 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4841] [2025-03-17 08:27:16,121 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4844] [2025-03-17 08:27:16,121 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4847] [2025-03-17 08:27:16,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5229] [2025-03-17 08:27:16,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5233] [2025-03-17 08:27:16,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5237] [2025-03-17 08:27:16,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5241] [2025-03-17 08:27:16,139 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"); [5252] [2025-03-17 08:27:16,139 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"); [5256] [2025-03-17 08:27:16,139 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"); [5260] [2025-03-17 08:27:16,141 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"); [5264] [2025-03-17 08:27:16,141 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"); [5275] [2025-03-17 08:27:16,141 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"); [5279] [2025-03-17 08:27:16,141 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"); [5283] [2025-03-17 08:27:16,142 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"); [5287] [2025-03-17 08:27:16,142 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"); [5298] [2025-03-17 08:27:16,142 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"); [5302] [2025-03-17 08:27:16,142 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"); [5306] [2025-03-17 08:27:16,143 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"); [5310] [2025-03-17 08:27:16,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5360] [2025-03-17 08:27:16,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5364] [2025-03-17 08:27:16,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5368] [2025-03-17 08:27:16,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5372] [2025-03-17 08:27:16,146 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"); [5383] [2025-03-17 08:27:16,146 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"); [5387] [2025-03-17 08:27:16,147 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"); [5391] [2025-03-17 08:27:16,147 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"); [5395] [2025-03-17 08:27:16,147 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"); [5406] [2025-03-17 08:27:16,147 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"); [5410] [2025-03-17 08:27:16,147 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"); [5414] [2025-03-17 08:27:16,148 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"); [5418] [2025-03-17 08:27:16,148 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"); [5429] [2025-03-17 08:27:16,148 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"); [5433] [2025-03-17 08:27:16,148 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"); [5437] [2025-03-17 08:27:16,148 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"); [5441] [2025-03-17 08:27:16,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5515] [2025-03-17 08:27:16,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5519] [2025-03-17 08:27:16,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5523] [2025-03-17 08:27:16,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5527] [2025-03-17 08:27:16,154 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"); [5538] [2025-03-17 08:27:16,154 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"); [5542] [2025-03-17 08:27:16,155 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"); [5546] [2025-03-17 08:27:16,155 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"); [5550] [2025-03-17 08:27:16,155 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"); [5561] [2025-03-17 08:27:16,155 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"); [5565] [2025-03-17 08:27:16,155 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"); [5569] [2025-03-17 08:27:16,155 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"); [5573] [2025-03-17 08:27:16,204 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"); [6512] [2025-03-17 08:27:16,205 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"); [6515] [2025-03-17 08:27:16,205 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"); [6518] [2025-03-17 08:27:16,205 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"); [6521] [2025-03-17 08:27:16,205 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"); [6524] [2025-03-17 08:27:16,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6537] [2025-03-17 08:27:16,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6540] [2025-03-17 08:27:16,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6543] [2025-03-17 08:27:16,207 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6546] [2025-03-17 08:27:16,207 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6549] [2025-03-17 08:27:16,208 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)); [6571] [2025-03-17 08:27:16,209 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)); [6574] [2025-03-17 08:27:16,209 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)); [6577] [2025-03-17 08:27:16,209 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)); [6580] [2025-03-17 08:27:16,209 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)); [6583] [2025-03-17 08:27:16,210 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"); [6616-6617] [2025-03-17 08:27:16,211 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"); [6620-6621] [2025-03-17 08:27:16,211 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"); [6624-6625] [2025-03-17 08:27:16,211 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"); [6628-6629] [2025-03-17 08:27:16,212 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"); [6632-6633] [2025-03-17 08:27:16,212 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)); [6646] [2025-03-17 08:27:16,212 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)); [6649] [2025-03-17 08:27:16,212 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)); [6652] [2025-03-17 08:27:16,212 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)); [6655] [2025-03-17 08:27:16,212 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)); [6658] [2025-03-17 08:27:16,213 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"); [6691-6692] [2025-03-17 08:27:16,213 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"); [6695-6696] [2025-03-17 08:27:16,214 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"); [6699-6700] [2025-03-17 08:27:16,214 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"); [6703-6704] [2025-03-17 08:27:16,215 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"); [6707-6708] [2025-03-17 08:27:16,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 08:27:16,339 INFO L204 MainTranslator]: Completed translation [2025-03-17 08:27:16,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:16 WrapperNode [2025-03-17 08:27:16,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 08:27:16,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 08:27:16,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 08:27:16,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 08:27:16,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:16" (1/1) ... [2025-03-17 08:27:16,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:16" (1/1) ... [2025-03-17 08:27:16,510 INFO L138 Inliner]: procedures = 183, calls = 839, calls flagged for inlining = 93, calls inlined = 91, statements flattened = 3424 [2025-03-17 08:27:16,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 08:27:16,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 08:27:16,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 08:27:16,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 08:27:16,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:16" (1/1) ... [2025-03-17 08:27:16,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:16" (1/1) ... [2025-03-17 08:27:16,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:16" (1/1) ... [2025-03-17 08:27:16,772 INFO L175 MemorySlicer]: Split 418 memory accesses to 9 slices as follows [2, 4, 1, 1, 347, 2, 36, 22, 3]. 83 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 0, 0, 5, 0, 0, 0, 0]. The 180 writes are split as follows [0, 1, 0, 1, 120, 0, 36, 22, 0]. [2025-03-17 08:27:16,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:16" (1/1) ... [2025-03-17 08:27:16,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:16" (1/1) ... [2025-03-17 08:27:16,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:16" (1/1) ... [2025-03-17 08:27:16,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:16" (1/1) ... [2025-03-17 08:27:16,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:16" (1/1) ... [2025-03-17 08:27:16,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:16" (1/1) ... [2025-03-17 08:27:16,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 08:27:16,918 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 08:27:16,918 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 08:27:16,918 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 08:27:16,919 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:16" (1/1) ... [2025-03-17 08:27:16,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 08:27:16,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:27:16,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 08:27:16,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 08:27:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2025-03-17 08:27:16,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2025-03-17 08:27:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2025-03-17 08:27:16,974 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2025-03-17 08:27:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 08:27:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 08:27:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 08:27:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 08:27:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 08:27:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 08:27:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 08:27:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-17 08:27:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-17 08:27:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2025-03-17 08:27:16,975 INFO L138 BoogieDeclarations]: Found implementation of procedure __xchg_wrong_size [2025-03-17 08:27:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2025-03-17 08:27:16,975 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2025-03-17 08:27:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-17 08:27:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-17 08:27:16,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 08:27:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-03-17 08:27:16,978 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-03-17 08:27:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2025-03-17 08:27:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 08:27:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-17 08:27:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-17 08:27:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-17 08:27:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 08:27:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-03-17 08:27:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-03-17 08:27:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2025-03-17 08:27:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2025-03-17 08:27:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2025-03-17 08:27:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-03-17 08:27:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2025-03-17 08:27:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-17 08:27:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-17 08:27:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2025-03-17 08:27:16,983 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2025-03-17 08:27:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2025-03-17 08:27:16,983 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2025-03-17 08:27:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2025-03-17 08:27:16,983 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2025-03-17 08:27:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2025-03-17 08:27:16,983 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2025-03-17 08:27:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 08:27:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 08:27:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 08:27:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 08:27:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 08:27:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 08:27:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 08:27:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 08:27:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-17 08:27:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-03-17 08:27:16,983 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 08:27:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-03-17 08:27:16,984 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-03-17 08:27:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2025-03-17 08:27:16,985 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2025-03-17 08:27:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-03-17 08:27:16,985 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-03-17 08:27:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-17 08:27:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-17 08:27:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-17 08:27:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-17 08:27:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-17 08:27:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-17 08:27:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-17 08:27:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-17 08:27:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-17 08:27:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-17 08:27:16,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-17 08:27:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 08:27:16,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 08:27:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2025-03-17 08:27:16,987 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2025-03-17 08:27:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-03-17 08:27:16,987 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-03-17 08:27:17,414 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 08:27:17,416 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 08:27:17,513 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7722: havoc dev_trans_start_#t~nondet577#1; [2025-03-17 08:27:17,514 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7791: havoc tty_chars_in_buffer_#t~nondet591#1; [2025-03-17 08:27:17,538 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-17 08:27:17,547 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7711: havoc #t~nondet574; [2025-03-17 08:27:17,597 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4722: havoc #t~mem1;havoc #t~bitwise2; [2025-03-17 08:27:17,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7707: havoc #t~nondet573; [2025-03-17 08:27:18,003 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7787: havoc slhc_uncompress_#t~nondet590#1; [2025-03-17 08:27:18,003 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7783: havoc slhc_remember_#t~nondet589#1; [2025-03-17 08:27:18,003 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7746: havoc netif_rx_#t~nondet580#1; [2025-03-17 08:27:18,003 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7714: havoc dev_alloc_skb_#t~ret575#1.base, dev_alloc_skb_#t~ret575#1.offset; [2025-03-17 08:27:18,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7678: havoc _copy_to_user_#t~nondet570#1; [2025-03-17 08:27:18,163 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7802: havoc tty_mode_ioctl_#t~nondet593#1; [2025-03-17 08:27:18,604 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7738: havoc #t~nondet578; [2025-03-17 08:27:18,697 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7795: havoc #t~nondet592; [2025-03-17 08:27:18,699 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7754: havoc #t~nondet582; [2025-03-17 08:27:18,708 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4922: havoc __kmalloc_#t~ret32#1.base, __kmalloc_#t~ret32#1.offset; [2025-03-17 08:27:18,845 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6947: call ULTIMATE.dealloc(sl_outfill_~#s~0#1.base, sl_outfill_~#s~0#1.offset);havoc sl_outfill_~#s~0#1.base, sl_outfill_~#s~0#1.offset; [2025-03-17 08:27:18,850 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5003: havoc #t~mem57.base, #t~mem57.offset; [2025-03-17 08:27:23,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7700: havoc capable_#t~nondet572#1; [2025-03-17 08:27:23,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7503-1: ldv_register_netdevice_4_#res#1 := ldv_register_netdevice_4_~ldv_func_res~3#1; [2025-03-17 08:27:23,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7806: havoc tty_register_ldisc_#t~nondet594#1; [2025-03-17 08:27:23,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7773: havoc slhc_compress_#t~nondet587#1; [2025-03-17 08:27:23,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7742: havoc msleep_interruptible_#t~nondet579#1; [2025-03-17 08:27:23,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7810: havoc tty_unregister_ldisc_#t~nondet595#1; [2025-03-17 08:27:23,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7779: havoc slhc_init_#t~ret588#1.base, slhc_init_#t~ret588#1.offset; [2025-03-17 08:27:23,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5699: call ULTIMATE.dealloc(sl_encaps_~#p~2#1.base, sl_encaps_~#p~2#1.offset);havoc sl_encaps_~#p~2#1.base, sl_encaps_~#p~2#1.offset; [2025-03-17 08:27:23,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7718: havoc dev_close_#t~nondet576#1; [2025-03-17 08:27:23,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7490-1: ldv_sl_alloc_bufs_3_#res#1 := ldv_sl_alloc_bufs_3_~ldv_func_res~2#1; [2025-03-17 08:27:23,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6072: call ULTIMATE.dealloc(sl_alloc_~#name~0#1.base, sl_alloc_~#name~0#1.offset);havoc sl_alloc_~#name~0#1.base, sl_alloc_~#name~0#1.offset;call ULTIMATE.dealloc(sl_alloc_~#__key~0#1.base, sl_alloc_~#__key~0#1.offset);havoc sl_alloc_~#__key~0#1.base, sl_alloc_~#__key~0#1.offset; [2025-03-17 08:27:23,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7758: havoc register_netdevice_#t~nondet583#1; [2025-03-17 08:27:23,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6206: havoc slip_open_#t~mem332#1.base, slip_open_#t~mem332#1.offset;havoc slip_open_#t~mem333#1; [2025-03-17 08:27:23,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7696: havoc alloc_netdev_mqs_#t~ret571#1.base, alloc_netdev_mqs_#t~ret571#1.offset; [2025-03-17 08:27:23,673 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7750: havoc netpoll_trap_#t~nondet581#1; [2025-03-17 08:27:23,965 INFO L? ?]: Removed 1385 outVars from TransFormulas that were not future-live. [2025-03-17 08:27:23,965 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 08:27:24,013 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 08:27:24,014 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 08:27:24,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:27:24 BoogieIcfgContainer [2025-03-17 08:27:24,015 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 08:27:24,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 08:27:24,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 08:27:24,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 08:27:24,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 08:27:14" (1/3) ... [2025-03-17 08:27:24,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e55970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:27:24, skipping insertion in model container [2025-03-17 08:27:24,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:16" (2/3) ... [2025-03-17 08:27:24,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e55970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:27:24, skipping insertion in model container [2025-03-17 08:27:24,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:27:24" (3/3) ... [2025-03-17 08:27:24,023 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2025-03-17 08:27:24,034 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 08:27:24,036 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i that has 63 procedures, 1161 locations, 1 initial locations, 19 loop locations, and 1 error locations. [2025-03-17 08:27:24,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 08:27:24,106 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;@441e30b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 08:27:24,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 08:27:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 1120 states, 809 states have (on average 1.457354758961681) internal successors, (1179), 853 states have internal predecessors, (1179), 256 states have call successors, (256), 54 states have call predecessors, (256), 53 states have return successors, (251), 249 states have call predecessors, (251), 251 states have call successors, (251) [2025-03-17 08:27:24,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 08:27:24,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:27:24,127 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:27:24,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:27:24,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:27:24,131 INFO L85 PathProgramCache]: Analyzing trace with hash 818161108, now seen corresponding path program 1 times [2025-03-17 08:27:24,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:27:24,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647786646] [2025-03-17 08:27:24,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:27:24,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:27:24,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 08:27:24,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 08:27:24,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:27:24,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:27:24,858 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 08:27:24,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:27:24,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647786646] [2025-03-17 08:27:24,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647786646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:27:24,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:27:24,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:27:24,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370515544] [2025-03-17 08:27:24,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:27:24,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:27:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:27:24,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:27:24,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:27:24,884 INFO L87 Difference]: Start difference. First operand has 1120 states, 809 states have (on average 1.457354758961681) internal successors, (1179), 853 states have internal predecessors, (1179), 256 states have call successors, (256), 54 states have call predecessors, (256), 53 states have return successors, (251), 249 states have call predecessors, (251), 251 states have call successors, (251) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 08:27:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:27:25,162 INFO L93 Difference]: Finished difference Result 2862 states and 4305 transitions. [2025-03-17 08:27:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:27:25,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2025-03-17 08:27:25,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:27:25,185 INFO L225 Difference]: With dead ends: 2862 [2025-03-17 08:27:25,185 INFO L226 Difference]: Without dead ends: 1657 [2025-03-17 08:27:25,195 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-03-17 08:27:25,199 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 913 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 3278 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:27:25,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 3278 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:27:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-03-17 08:27:25,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2025-03-17 08:27:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1188 states have (on average 1.4267676767676767) internal successors, (1695), 1239 states have internal predecessors, (1695), 376 states have call successors, (376), 93 states have call predecessors, (376), 92 states have return successors, (375), 372 states have call predecessors, (375), 375 states have call successors, (375) [2025-03-17 08:27:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2446 transitions. [2025-03-17 08:27:25,352 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2446 transitions. Word has length 61 [2025-03-17 08:27:25,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:27:25,352 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2446 transitions. [2025-03-17 08:27:25,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 08:27:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2446 transitions. [2025-03-17 08:27:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 08:27:25,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:27:25,363 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-03-17 08:27:25,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 08:27:25,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:27:25,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:27:25,364 INFO L85 PathProgramCache]: Analyzing trace with hash -805127383, now seen corresponding path program 1 times [2025-03-17 08:27:25,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:27:25,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650551558] [2025-03-17 08:27:25,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:27:25,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:27:25,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 08:27:25,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 08:27:25,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:27:25,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:27:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-17 08:27:25,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:27:25,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650551558] [2025-03-17 08:27:25,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650551558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:27:25,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:27:25,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:27:25,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730001768] [2025-03-17 08:27:25,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:27:25,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:27:25,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:27:25,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:27:25,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:27:25,914 INFO L87 Difference]: Start difference. First operand 1657 states and 2446 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 08:27:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:27:26,043 INFO L93 Difference]: Finished difference Result 3293 states and 4863 transitions. [2025-03-17 08:27:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:27:26,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-03-17 08:27:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:27:26,055 INFO L225 Difference]: With dead ends: 3293 [2025-03-17 08:27:26,055 INFO L226 Difference]: Without dead ends: 1657 [2025-03-17 08:27:26,061 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-03-17 08:27:26,062 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 1589 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:27:26,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 1589 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:27:26,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-03-17 08:27:26,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2025-03-17 08:27:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1188 states have (on average 1.4250841750841752) internal successors, (1693), 1239 states have internal predecessors, (1693), 376 states have call successors, (376), 93 states have call predecessors, (376), 92 states have return successors, (375), 372 states have call predecessors, (375), 375 states have call successors, (375) [2025-03-17 08:27:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2444 transitions. [2025-03-17 08:27:26,165 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2444 transitions. Word has length 117 [2025-03-17 08:27:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:27:26,167 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2444 transitions. [2025-03-17 08:27:26,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 08:27:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2444 transitions. [2025-03-17 08:27:26,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 08:27:26,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:27:26,175 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-03-17 08:27:26,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 08:27:26,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:27:26,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:27:26,178 INFO L85 PathProgramCache]: Analyzing trace with hash 976372552, now seen corresponding path program 1 times [2025-03-17 08:27:26,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:27:26,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467237204] [2025-03-17 08:27:26,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:27:26,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:27:26,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 08:27:26,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 08:27:26,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:27:26,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:27:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-17 08:27:26,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:27:26,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467237204] [2025-03-17 08:27:26,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467237204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:27:26,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:27:26,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:27:26,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936633488] [2025-03-17 08:27:26,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:27:26,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:27:26,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:27:26,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:27:26,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:27:26,765 INFO L87 Difference]: Start difference. First operand 1657 states and 2444 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 08:27:26,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:27:26,872 INFO L93 Difference]: Finished difference Result 1662 states and 2449 transitions. [2025-03-17 08:27:26,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:27:26,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-03-17 08:27:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:27:26,883 INFO L225 Difference]: With dead ends: 1662 [2025-03-17 08:27:26,883 INFO L226 Difference]: Without dead ends: 1659 [2025-03-17 08:27:26,884 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-03-17 08:27:26,886 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 0 mSDsluCounter, 3183 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4778 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:27:26,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4778 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:27:26,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2025-03-17 08:27:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1659. [2025-03-17 08:27:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1190 states have (on average 1.4243697478991597) internal successors, (1695), 1241 states have internal predecessors, (1695), 376 states have call successors, (376), 93 states have call predecessors, (376), 92 states have return successors, (375), 372 states have call predecessors, (375), 375 states have call successors, (375) [2025-03-17 08:27:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2446 transitions. [2025-03-17 08:27:26,945 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2446 transitions. Word has length 117 [2025-03-17 08:27:26,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:27:26,946 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2446 transitions. [2025-03-17 08:27:26,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 08:27:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2446 transitions. [2025-03-17 08:27:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 08:27:26,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:27:26,953 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-03-17 08:27:26,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 08:27:26,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:27:26,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:27:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash 290048724, now seen corresponding path program 1 times [2025-03-17 08:27:26,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:27:26,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244820540] [2025-03-17 08:27:26,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:27:26,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:27:27,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 08:27:27,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 08:27:27,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:27:27,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:27:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-17 08:27:27,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:27:27,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244820540] [2025-03-17 08:27:27,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244820540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:27:27,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:27:27,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:27:27,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411787974] [2025-03-17 08:27:27,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:27:27,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:27:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:27:27,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:27:27,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:27:27,403 INFO L87 Difference]: Start difference. First operand 1659 states and 2446 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 08:27:31,416 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-03-17 08:27:32,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:27:32,282 INFO L93 Difference]: Finished difference Result 3308 states and 4880 transitions. [2025-03-17 08:27:32,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:27:32,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 126 [2025-03-17 08:27:32,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:27:32,294 INFO L225 Difference]: With dead ends: 3308 [2025-03-17 08:27:32,294 INFO L226 Difference]: Without dead ends: 1670 [2025-03-17 08:27:32,298 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-03-17 08:27:32,300 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 1570 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-17 08:27:32,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 2687 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 535 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-03-17 08:27:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2025-03-17 08:27:32,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1660. [2025-03-17 08:27:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1191 states have (on average 1.424013434089001) internal successors, (1696), 1242 states have internal predecessors, (1696), 376 states have call successors, (376), 93 states have call predecessors, (376), 92 states have return successors, (375), 372 states have call predecessors, (375), 375 states have call successors, (375) [2025-03-17 08:27:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2447 transitions. [2025-03-17 08:27:32,418 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2447 transitions. Word has length 126 [2025-03-17 08:27:32,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:27:32,419 INFO L471 AbstractCegarLoop]: Abstraction has 1660 states and 2447 transitions. [2025-03-17 08:27:32,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 08:27:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2447 transitions. [2025-03-17 08:27:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 08:27:32,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:27:32,426 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-03-17 08:27:32,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 08:27:32,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:27:32,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:27:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1242317655, now seen corresponding path program 1 times [2025-03-17 08:27:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:27:32,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144316966] [2025-03-17 08:27:32,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:27:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:27:32,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 08:27:32,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 08:27:32,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:27:32,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:27:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-17 08:27:32,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:27:32,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144316966] [2025-03-17 08:27:32,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144316966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:27:32,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:27:32,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 08:27:32,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153043844] [2025-03-17 08:27:32,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:27:32,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 08:27:32,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:27:32,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 08:27:32,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:27:32,984 INFO L87 Difference]: Start difference. First operand 1660 states and 2447 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 08:27:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:27:33,124 INFO L93 Difference]: Finished difference Result 1678 states and 2471 transitions. [2025-03-17 08:27:33,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 08:27:33,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2025-03-17 08:27:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:27:33,135 INFO L225 Difference]: With dead ends: 1678 [2025-03-17 08:27:33,136 INFO L226 Difference]: Without dead ends: 1675 [2025-03-17 08:27:33,137 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-03-17 08:27:33,138 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 115 mSDsluCounter, 4633 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 6230 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:27:33,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 6230 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:27:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2025-03-17 08:27:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1662. [2025-03-17 08:27:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1192 states have (on average 1.4236577181208054) internal successors, (1697), 1242 states have internal predecessors, (1697), 377 states have call successors, (377), 93 states have call predecessors, (377), 92 states have return successors, (376), 373 states have call predecessors, (376), 376 states have call successors, (376) [2025-03-17 08:27:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2450 transitions. [2025-03-17 08:27:33,196 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2450 transitions. Word has length 128 [2025-03-17 08:27:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:27:33,196 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 2450 transitions. [2025-03-17 08:27:33,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 08:27:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2450 transitions. [2025-03-17 08:27:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 08:27:33,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:27:33,206 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-03-17 08:27:33,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 08:27:33,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:27:33,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:27:33,206 INFO L85 PathProgramCache]: Analyzing trace with hash 285116095, now seen corresponding path program 1 times [2025-03-17 08:27:33,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:27:33,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842907345] [2025-03-17 08:27:33,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:27:33,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:27:33,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 08:27:33,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 08:27:33,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:27:33,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:27:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-17 08:27:33,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:27:33,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842907345] [2025-03-17 08:27:33,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842907345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:27:33,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:27:33,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:27:33,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792084799] [2025-03-17 08:27:33,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:27:33,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:27:33,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:27:33,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:27:33,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:27:33,634 INFO L87 Difference]: Start difference. First operand 1662 states and 2450 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 08:27:37,650 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-03-17 08:27:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:27:37,915 INFO L93 Difference]: Finished difference Result 4904 states and 7228 transitions. [2025-03-17 08:27:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:27:37,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 160 [2025-03-17 08:27:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:27:37,934 INFO L225 Difference]: With dead ends: 4904 [2025-03-17 08:27:37,935 INFO L226 Difference]: Without dead ends: 3263 [2025-03-17 08:27:37,942 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-03-17 08:27:37,942 INFO L435 NwaCegarLoop]: 2396 mSDtfsCounter, 1550 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 3941 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:27:37,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 3941 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 08:27:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3263 states. [2025-03-17 08:27:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3263 to 3258. [2025-03-17 08:27:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3258 states, 2341 states have (on average 1.4254592054677488) internal successors, (3337), 2441 states have internal predecessors, (3337), 733 states have call successors, (733), 184 states have call predecessors, (733), 183 states have return successors, (732), 724 states have call predecessors, (732), 732 states have call successors, (732) [2025-03-17 08:27:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 4802 transitions. [2025-03-17 08:27:38,122 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 4802 transitions. Word has length 160 [2025-03-17 08:27:38,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:27:38,123 INFO L471 AbstractCegarLoop]: Abstraction has 3258 states and 4802 transitions. [2025-03-17 08:27:38,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 08:27:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 4802 transitions. [2025-03-17 08:27:38,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 08:27:38,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:27:38,140 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 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] [2025-03-17 08:27:38,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 08:27:38,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:27:38,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:27:38,140 INFO L85 PathProgramCache]: Analyzing trace with hash 761844619, now seen corresponding path program 1 times [2025-03-17 08:27:38,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:27:38,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19919508] [2025-03-17 08:27:38,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:27:38,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:27:38,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 08:27:38,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 08:27:38,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:27:38,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:27:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-03-17 08:27:38,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:27:38,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19919508] [2025-03-17 08:27:38,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19919508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:27:38,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:27:38,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:27:38,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115816822] [2025-03-17 08:27:38,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:27:38,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:27:38,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:27:38,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:27:38,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:27:38,531 INFO L87 Difference]: Start difference. First operand 3258 states and 4802 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 08:27:42,540 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-03-17 08:27:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:27:42,716 INFO L93 Difference]: Finished difference Result 5469 states and 8034 transitions. [2025-03-17 08:27:42,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:27:42,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2025-03-17 08:27:42,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:27:42,731 INFO L225 Difference]: With dead ends: 5469 [2025-03-17 08:27:42,731 INFO L226 Difference]: Without dead ends: 2221 [2025-03-17 08:27:42,740 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-03-17 08:27:42,741 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 0 mSDsluCounter, 3183 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4779 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:27:42,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4779 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 08:27:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2025-03-17 08:27:42,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 2221. [2025-03-17 08:27:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2221 states, 1584 states have (on average 1.4128787878787878) internal successors, (2238), 1650 states have internal predecessors, (2238), 505 states have call successors, (505), 132 states have call predecessors, (505), 131 states have return successors, (504), 499 states have call predecessors, (504), 504 states have call successors, (504) [2025-03-17 08:27:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 3247 transitions. [2025-03-17 08:27:42,840 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 3247 transitions. Word has length 162 [2025-03-17 08:27:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:27:42,840 INFO L471 AbstractCegarLoop]: Abstraction has 2221 states and 3247 transitions. [2025-03-17 08:27:42,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 08:27:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 3247 transitions. [2025-03-17 08:27:42,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 08:27:42,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:27:42,850 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-03-17 08:27:42,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 08:27:42,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:27:42,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:27:42,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1723334691, now seen corresponding path program 1 times [2025-03-17 08:27:42,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:27:42,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036605890] [2025-03-17 08:27:42,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:27:42,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:27:43,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 08:27:43,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 08:27:43,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:27:43,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:27:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-17 08:27:43,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:27:43,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036605890] [2025-03-17 08:27:43,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036605890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:27:43,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:27:43,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:27:43,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352514470] [2025-03-17 08:27:43,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:27:43,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:27:43,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:27:43,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:27:43,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:27:43,316 INFO L87 Difference]: Start difference. First operand 2221 states and 3247 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 08:27:47,326 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-03-17 08:27:48,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:27:48,436 INFO L93 Difference]: Finished difference Result 3881 states and 5696 transitions. [2025-03-17 08:27:48,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:27:48,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 162 [2025-03-17 08:27:48,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:27:48,450 INFO L225 Difference]: With dead ends: 3881 [2025-03-17 08:27:48,451 INFO L226 Difference]: Without dead ends: 2244 [2025-03-17 08:27:48,456 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-03-17 08:27:48,457 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 1563 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:27:48,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 2676 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 549 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-17 08:27:48,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2025-03-17 08:27:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 2225. [2025-03-17 08:27:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 1588 states have (on average 1.4124685138539044) internal successors, (2243), 1654 states have internal predecessors, (2243), 505 states have call successors, (505), 132 states have call predecessors, (505), 131 states have return successors, (504), 499 states have call predecessors, (504), 504 states have call successors, (504) [2025-03-17 08:27:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 3252 transitions. [2025-03-17 08:27:48,562 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 3252 transitions. Word has length 162 [2025-03-17 08:27:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:27:48,562 INFO L471 AbstractCegarLoop]: Abstraction has 2225 states and 3252 transitions. [2025-03-17 08:27:48,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 08:27:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 3252 transitions. [2025-03-17 08:27:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 08:27:48,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:27:48,573 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-03-17 08:27:48,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 08:27:48,574 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:27:48,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:27:48,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1231131584, now seen corresponding path program 1 times [2025-03-17 08:27:48,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:27:48,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419900150] [2025-03-17 08:27:48,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:27:48,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:27:48,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 08:27:48,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 08:27:48,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:27:48,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:27:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-17 08:27:48,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:27:48,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419900150] [2025-03-17 08:27:48,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419900150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:27:48,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:27:48,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:27:48,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97734307] [2025-03-17 08:27:48,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:27:48,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:27:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:27:48,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:27:48,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:27:48,892 INFO L87 Difference]: Start difference. First operand 2225 states and 3252 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 08:27:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:27:49,012 INFO L93 Difference]: Finished difference Result 4429 states and 6507 transitions. [2025-03-17 08:27:49,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:27:49,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 165 [2025-03-17 08:27:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:27:49,025 INFO L225 Difference]: With dead ends: 4429 [2025-03-17 08:27:49,025 INFO L226 Difference]: Without dead ends: 2225 [2025-03-17 08:27:49,032 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-03-17 08:27:49,033 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 0 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3166 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:27:49,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3166 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:27:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2025-03-17 08:27:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 2225. [2025-03-17 08:27:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 1588 states have (on average 1.406801007556675) internal successors, (2234), 1654 states have internal predecessors, (2234), 505 states have call successors, (505), 132 states have call predecessors, (505), 131 states have return successors, (504), 499 states have call predecessors, (504), 504 states have call successors, (504) [2025-03-17 08:27:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 3243 transitions. [2025-03-17 08:27:49,125 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 3243 transitions. Word has length 165 [2025-03-17 08:27:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:27:49,128 INFO L471 AbstractCegarLoop]: Abstraction has 2225 states and 3243 transitions. [2025-03-17 08:27:49,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 08:27:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 3243 transitions. [2025-03-17 08:27:49,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-17 08:27:49,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:27:49,139 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-03-17 08:27:49,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 08:27:49,139 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:27:49,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:27:49,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1213019716, now seen corresponding path program 1 times [2025-03-17 08:27:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:27:49,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165774409] [2025-03-17 08:27:49,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:27:49,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:27:49,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 08:27:49,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 08:27:49,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:27:49,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:27:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-17 08:27:49,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:27:49,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165774409] [2025-03-17 08:27:49,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165774409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:27:49,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22740550] [2025-03-17 08:27:49,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:27:49,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:27:49,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:27:49,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:27:49,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 08:27:50,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 08:27:50,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 08:27:50,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:27:50,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:27:50,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 08:27:50,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:27:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-17 08:27:50,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 08:27:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-17 08:27:50,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22740550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 08:27:50,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 08:27:50,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2025-03-17 08:27:50,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46789693] [2025-03-17 08:27:50,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 08:27:50,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 08:27:50,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:27:50,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 08:27:50,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 08:27:50,802 INFO L87 Difference]: Start difference. First operand 2225 states and 3243 transitions. Second operand has 10 states, 10 states have (on average 18.4) internal successors, (184), 10 states have internal predecessors, (184), 4 states have call successors, (53), 3 states have call predecessors, (53), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-03-17 08:27:54,814 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-03-17 08:27:58,823 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-03-17 08:28:02,836 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-03-17 08:28:06,843 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-03-17 08:28:10,851 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-03-17 08:28:14,857 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-03-17 08:28:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:16,337 INFO L93 Difference]: Finished difference Result 3934 states and 5763 transitions. [2025-03-17 08:28:16,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 08:28:16,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.4) internal successors, (184), 10 states have internal predecessors, (184), 4 states have call successors, (53), 3 states have call predecessors, (53), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 168 [2025-03-17 08:28:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:16,351 INFO L225 Difference]: With dead ends: 3934 [2025-03-17 08:28:16,351 INFO L226 Difference]: Without dead ends: 2293 [2025-03-17 08:28:16,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 331 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-03-17 08:28:16,357 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 2705 mSDsluCounter, 3295 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 512 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2717 SdHoareTripleChecker+Valid, 4870 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:16,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2717 Valid, 4870 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 1600 Invalid, 6 Unknown, 0 Unchecked, 25.4s Time] [2025-03-17 08:28:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2025-03-17 08:28:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2232. [2025-03-17 08:28:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 1595 states have (on average 1.406269592476489) internal successors, (2243), 1661 states have internal predecessors, (2243), 505 states have call successors, (505), 132 states have call predecessors, (505), 131 states have return successors, (504), 499 states have call predecessors, (504), 504 states have call successors, (504) [2025-03-17 08:28:16,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 3252 transitions. [2025-03-17 08:28:16,463 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 3252 transitions. Word has length 168 [2025-03-17 08:28:16,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:16,464 INFO L471 AbstractCegarLoop]: Abstraction has 2232 states and 3252 transitions. [2025-03-17 08:28:16,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.4) internal successors, (184), 10 states have internal predecessors, (184), 4 states have call successors, (53), 3 states have call predecessors, (53), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-03-17 08:28:16,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 3252 transitions. [2025-03-17 08:28:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-17 08:28:16,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:16,472 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1] [2025-03-17 08:28:16,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 08:28:16,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 08:28:16,673 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:16,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:16,674 INFO L85 PathProgramCache]: Analyzing trace with hash 846447533, now seen corresponding path program 1 times [2025-03-17 08:28:16,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:16,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298943303] [2025-03-17 08:28:16,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:16,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:16,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 08:28:16,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 08:28:16,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:16,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-17 08:28:17,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:17,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298943303] [2025-03-17 08:28:17,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298943303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:28:17,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496596827] [2025-03-17 08:28:17,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:17,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:28:17,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:28:17,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:28:17,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 08:28:18,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 08:28:18,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 08:28:18,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:18,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:18,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 08:28:18,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:28:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-17 08:28:18,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:28:18,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496596827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:18,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:28:18,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-17 08:28:18,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742106994] [2025-03-17 08:28:18,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:18,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:28:18,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:18,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:28:18,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 08:28:18,472 INFO L87 Difference]: Start difference. First operand 2232 states and 3252 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 08:28:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:18,555 INFO L93 Difference]: Finished difference Result 3897 states and 5690 transitions. [2025-03-17 08:28:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:28:18,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 178 [2025-03-17 08:28:18,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:18,565 INFO L225 Difference]: With dead ends: 3897 [2025-03-17 08:28:18,566 INFO L226 Difference]: Without dead ends: 2232 [2025-03-17 08:28:18,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 08:28:18,571 INFO L435 NwaCegarLoop]: 1587 mSDtfsCounter, 2 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:18,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3171 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:28:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2025-03-17 08:28:18,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2232. [2025-03-17 08:28:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 1595 states have (on average 1.4043887147335423) internal successors, (2240), 1661 states have internal predecessors, (2240), 505 states have call successors, (505), 132 states have call predecessors, (505), 131 states have return successors, (504), 499 states have call predecessors, (504), 504 states have call successors, (504) [2025-03-17 08:28:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 3249 transitions. [2025-03-17 08:28:18,640 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 3249 transitions. Word has length 178 [2025-03-17 08:28:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:18,640 INFO L471 AbstractCegarLoop]: Abstraction has 2232 states and 3249 transitions. [2025-03-17 08:28:18,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 08:28:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 3249 transitions. [2025-03-17 08:28:18,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-17 08:28:18,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:18,649 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1] [2025-03-17 08:28:18,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 08:28:18,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 08:28:18,850 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:18,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash -211165175, now seen corresponding path program 1 times [2025-03-17 08:28:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:18,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741525619] [2025-03-17 08:28:18,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:18,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:19,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 08:28:19,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 08:28:19,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:19,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-17 08:28:19,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:19,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741525619] [2025-03-17 08:28:19,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741525619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:28:19,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960386073] [2025-03-17 08:28:19,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:19,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:28:19,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:28:19,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:28:19,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 08:28:20,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 08:28:20,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 08:28:20,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:20,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:20,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 1500 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 08:28:20,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:28:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-17 08:28:20,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:28:20,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960386073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:20,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:28:20,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 8 [2025-03-17 08:28:20,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67351918] [2025-03-17 08:28:20,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:20,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 08:28:20,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:20,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 08:28:20,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 08:28:20,708 INFO L87 Difference]: Start difference. First operand 2232 states and 3249 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 6 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 08:28:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:20,937 INFO L93 Difference]: Finished difference Result 3904 states and 5706 transitions. [2025-03-17 08:28:20,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 08:28:20,937 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 6 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 2 states have call successors, (20) Word has length 180 [2025-03-17 08:28:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:20,949 INFO L225 Difference]: With dead ends: 3904 [2025-03-17 08:28:20,951 INFO L226 Difference]: Without dead ends: 2251 [2025-03-17 08:28:20,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 08:28:20,956 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 834 mSDsluCounter, 9499 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 11088 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:20,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 11088 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:28:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2025-03-17 08:28:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 2250. [2025-03-17 08:28:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 1607 states have (on average 1.4013690105787182) internal successors, (2252), 1676 states have internal predecessors, (2252), 505 states have call successors, (505), 132 states have call predecessors, (505), 137 states have return successors, (522), 502 states have call predecessors, (522), 504 states have call successors, (522) [2025-03-17 08:28:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3279 transitions. [2025-03-17 08:28:21,060 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3279 transitions. Word has length 180 [2025-03-17 08:28:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:21,061 INFO L471 AbstractCegarLoop]: Abstraction has 2250 states and 3279 transitions. [2025-03-17 08:28:21,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 6 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 08:28:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3279 transitions. [2025-03-17 08:28:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 08:28:21,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:21,068 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1] [2025-03-17 08:28:21,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 08:28:21,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:28:21,269 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:21,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:21,270 INFO L85 PathProgramCache]: Analyzing trace with hash 78904125, now seen corresponding path program 1 times [2025-03-17 08:28:21,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:21,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732391950] [2025-03-17 08:28:21,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:21,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:21,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 08:28:21,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 08:28:21,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:21,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-17 08:28:21,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:21,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732391950] [2025-03-17 08:28:21,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732391950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:21,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:28:21,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:28:21,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671219776] [2025-03-17 08:28:21,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:21,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:28:21,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:21,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:28:21,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:28:21,904 INFO L87 Difference]: Start difference. First operand 2250 states and 3279 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 08:28:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:22,055 INFO L93 Difference]: Finished difference Result 3912 states and 5722 transitions. [2025-03-17 08:28:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:28:22,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 186 [2025-03-17 08:28:22,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:22,071 INFO L225 Difference]: With dead ends: 3912 [2025-03-17 08:28:22,071 INFO L226 Difference]: Without dead ends: 2252 [2025-03-17 08:28:22,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03-17 08:28:22,076 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 0 mSDsluCounter, 3153 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4739 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:22,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4739 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:28:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2025-03-17 08:28:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2252. [2025-03-17 08:28:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 1609 states have (on average 1.4008701056556867) internal successors, (2254), 1678 states have internal predecessors, (2254), 505 states have call successors, (505), 132 states have call predecessors, (505), 137 states have return successors, (522), 502 states have call predecessors, (522), 504 states have call successors, (522) [2025-03-17 08:28:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3281 transitions. [2025-03-17 08:28:22,177 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3281 transitions. Word has length 186 [2025-03-17 08:28:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:22,177 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3281 transitions. [2025-03-17 08:28:22,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 08:28:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3281 transitions. [2025-03-17 08:28:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 08:28:22,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:22,186 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:28:22,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 08:28:22,187 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:22,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:22,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1268557958, now seen corresponding path program 1 times [2025-03-17 08:28:22,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:22,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945999543] [2025-03-17 08:28:22,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:22,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:22,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 08:28:22,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 08:28:22,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:22,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:22,499 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-03-17 08:28:22,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:22,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945999543] [2025-03-17 08:28:22,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945999543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:22,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:28:22,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:28:22,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7759544] [2025-03-17 08:28:22,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:22,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:28:22,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:22,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:28:22,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:28:22,502 INFO L87 Difference]: Start difference. First operand 2252 states and 3281 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 08:28:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:22,617 INFO L93 Difference]: Finished difference Result 3916 states and 5727 transitions. [2025-03-17 08:28:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:28:22,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 192 [2025-03-17 08:28:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:22,631 INFO L225 Difference]: With dead ends: 3916 [2025-03-17 08:28:22,631 INFO L226 Difference]: Without dead ends: 2254 [2025-03-17 08:28:22,635 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-03-17 08:28:22,636 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 2 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3158 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:22,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3158 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:28:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2025-03-17 08:28:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2254. [2025-03-17 08:28:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 1611 states have (on average 1.4003724394785848) internal successors, (2256), 1680 states have internal predecessors, (2256), 505 states have call successors, (505), 132 states have call predecessors, (505), 137 states have return successors, (522), 502 states have call predecessors, (522), 504 states have call successors, (522) [2025-03-17 08:28:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3283 transitions. [2025-03-17 08:28:22,829 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3283 transitions. Word has length 192 [2025-03-17 08:28:22,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:22,830 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 3283 transitions. [2025-03-17 08:28:22,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 08:28:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3283 transitions. [2025-03-17 08:28:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 08:28:22,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:22,851 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:28:22,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 08:28:22,851 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:22,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:22,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1281068859, now seen corresponding path program 1 times [2025-03-17 08:28:22,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:22,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485483988] [2025-03-17 08:28:22,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:22,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:23,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 08:28:23,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 08:28:23,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:23,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-03-17 08:28:23,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:23,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485483988] [2025-03-17 08:28:23,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485483988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:23,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:28:23,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:28:23,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058211038] [2025-03-17 08:28:23,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:23,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:28:23,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:23,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:28:23,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:28:23,518 INFO L87 Difference]: Start difference. First operand 2254 states and 3283 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 08:28:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:23,658 INFO L93 Difference]: Finished difference Result 3922 states and 5732 transitions. [2025-03-17 08:28:23,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:28:23,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 201 [2025-03-17 08:28:23,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:23,674 INFO L225 Difference]: With dead ends: 3922 [2025-03-17 08:28:23,675 INFO L226 Difference]: Without dead ends: 2258 [2025-03-17 08:28:23,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:28:23,680 INFO L435 NwaCegarLoop]: 1585 mSDtfsCounter, 2 mSDsluCounter, 6322 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7907 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:23,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7907 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:28:23,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2025-03-17 08:28:23,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2257. [2025-03-17 08:28:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 1614 states have (on average 1.399628252788104) internal successors, (2259), 1682 states have internal predecessors, (2259), 505 states have call successors, (505), 132 states have call predecessors, (505), 137 states have return successors, (522), 503 states have call predecessors, (522), 504 states have call successors, (522) [2025-03-17 08:28:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3286 transitions. [2025-03-17 08:28:23,814 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3286 transitions. Word has length 201 [2025-03-17 08:28:23,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:23,816 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3286 transitions. [2025-03-17 08:28:23,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 08:28:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3286 transitions. [2025-03-17 08:28:23,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 08:28:23,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:23,824 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:28:23,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 08:28:23,825 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:23,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1464325561, now seen corresponding path program 1 times [2025-03-17 08:28:23,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:23,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479209693] [2025-03-17 08:28:23,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:23,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:24,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 08:28:24,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 08:28:24,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:24,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 58 proven. 10 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-17 08:28:30,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:30,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479209693] [2025-03-17 08:28:30,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479209693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:28:30,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411058438] [2025-03-17 08:28:30,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:30,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:28:30,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:28:30,323 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:28:30,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 08:28:31,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 08:28:31,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 08:28:31,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:31,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:31,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 1744 conjuncts, 187 conjuncts are in the unsatisfiable core [2025-03-17 08:28:31,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:28:31,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 08:28:31,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 08:28:31,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 08:28:31,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 08:28:31,907 INFO L349 Elim1Store]: treesize reduction 34, result has 29.2 percent of original size [2025-03-17 08:28:31,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 20 [2025-03-17 08:28:31,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 08:28:31,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 08:28:32,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 08:28:32,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 08:28:32,248 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 08:28:32,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 08:28:32,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7