./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-04 04:08:09,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:08:09,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:08:09,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:08:09,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:08:10,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:08:10,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:08:10,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:08:10,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:08:10,021 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:08:10,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:08:10,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:08:10,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:08:10,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:08:10,021 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:08:10,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:08:10,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:08:10,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:08:10,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:08:10,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:08:10,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:08:10,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:08:10,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:08:10,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:08:10,023 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-04 04:08:10,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:08:10,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:08:10,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:08:10,256 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:08:10,257 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:08:10,257 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-04 04:08:11,384 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5074934b1/8d564d5bfedc44e0bf0ebbbe6c318712/FLAG903a39890 [2025-03-04 04:08:11,804 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:08:11,805 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-04 04:08:11,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5074934b1/8d564d5bfedc44e0bf0ebbbe6c318712/FLAG903a39890 [2025-03-04 04:08:11,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5074934b1/8d564d5bfedc44e0bf0ebbbe6c318712 [2025-03-04 04:08:11,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:08:11,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:08:11,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:08:11,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:08:11,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:08:11,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:08:11" (1/1) ... [2025-03-04 04:08:11,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc97dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:11, skipping insertion in model container [2025-03-04 04:08:11,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:08:11" (1/1) ... [2025-03-04 04:08:12,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:08:12,565 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-04 04:08:13,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:08:13,215 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:08:13,285 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-04 04:08:13,287 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-04 04:08:13,288 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-04 04:08:13,288 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-04 04:08:13,292 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-04 04:08:13,295 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4838] [2025-03-04 04:08:13,295 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4841] [2025-03-04 04:08:13,295 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4844] [2025-03-04 04:08:13,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4847] [2025-03-04 04:08:13,309 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-04 04:08:13,310 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-04 04:08:13,310 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-04 04:08:13,310 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-04 04:08:13,310 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-04 04:08:13,311 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-04 04:08:13,311 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-04 04:08:13,311 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-04 04:08:13,311 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-04 04:08:13,312 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-04 04:08:13,312 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-04 04:08:13,312 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-04 04:08:13,312 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-04 04:08:13,313 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-04 04:08:13,313 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-04 04:08:13,313 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-04 04:08:13,314 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-04 04:08:13,315 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-04 04:08:13,315 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-04 04:08:13,315 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-04 04:08:13,315 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-04 04:08:13,316 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-04 04:08:13,316 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-04 04:08:13,316 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-04 04:08:13,316 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-04 04:08:13,317 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-04 04:08:13,317 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-04 04:08:13,317 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-04 04:08:13,317 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-04 04:08:13,318 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-04 04:08:13,318 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-04 04:08:13,318 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-04 04:08:13,320 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-04 04:08:13,321 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-04 04:08:13,321 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-04 04:08:13,321 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-04 04:08:13,321 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-04 04:08:13,322 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-04 04:08:13,322 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-04 04:08:13,322 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-04 04:08:13,322 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-04 04:08:13,323 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-04 04:08:13,323 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-04 04:08:13,323 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-04 04:08:13,375 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-04 04:08:13,376 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-04 04:08:13,376 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-04 04:08:13,376 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-04 04:08:13,377 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-04 04:08:13,377 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-04 04:08:13,377 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-04 04:08:13,377 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-04 04:08:13,377 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-04 04:08:13,378 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-04 04:08:13,379 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-04 04:08:13,379 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-04 04:08:13,380 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-04 04:08:13,380 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-04 04:08:13,380 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-04 04:08:13,381 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-04 04:08:13,382 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-04 04:08:13,382 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-04 04:08:13,382 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-04 04:08:13,382 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-04 04:08:13,383 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-04 04:08:13,383 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-04 04:08:13,383 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-04 04:08:13,384 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-04 04:08:13,384 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-04 04:08:13,385 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-04 04:08:13,385 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-04 04:08:13,385 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-04 04:08:13,385 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-04 04:08:13,385 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-04 04:08:13,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:08:13,557 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:08:13,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:13 WrapperNode [2025-03-04 04:08:13,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:08:13,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:08:13,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:08:13,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:08:13,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:13" (1/1) ... [2025-03-04 04:08:13,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:13" (1/1) ... [2025-03-04 04:08:13,702 INFO L138 Inliner]: procedures = 183, calls = 839, calls flagged for inlining = 93, calls inlined = 91, statements flattened = 3424 [2025-03-04 04:08:13,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:08:13,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:08:13,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:08:13,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:08:13,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:13" (1/1) ... [2025-03-04 04:08:13,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:13" (1/1) ... [2025-03-04 04:08:13,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:13" (1/1) ... [2025-03-04 04:08:14,094 INFO L175 MemorySlicer]: Split 418 memory accesses to 9 slices as follows [2, 1, 1, 36, 347, 4, 22, 3, 2]. 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, 36, 120, 1, 22, 0, 0]. [2025-03-04 04:08:14,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:13" (1/1) ... [2025-03-04 04:08:14,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:13" (1/1) ... [2025-03-04 04:08:14,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:13" (1/1) ... [2025-03-04 04:08:14,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:13" (1/1) ... [2025-03-04 04:08:14,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:13" (1/1) ... [2025-03-04 04:08:14,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:13" (1/1) ... [2025-03-04 04:08:14,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:08:14,264 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:08:14,264 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:08:14,264 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:08:14,266 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:13" (1/1) ... [2025-03-04 04:08:14,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:08:14,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:08:14,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 04:08:14,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 04:08:14,325 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2025-03-04 04:08:14,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2025-03-04 04:08:14,326 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2025-03-04 04:08:14,326 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2025-03-04 04:08:14,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:08:14,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:08:14,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:08:14,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:08:14,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:08:14,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:08:14,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:08:14,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2025-03-04 04:08:14,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __xchg_wrong_size [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2025-03-04 04:08:14,327 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:08:14,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:08:14,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2025-03-04 04:08:14,328 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:08:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:08:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:08:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:08:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:08:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:08:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:08:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:08:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:08:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:08:14,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:08:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 04:08:14,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 04:08:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-04 04:08:14,331 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-04 04:08:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:08:14,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:08:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-03-04 04:08:14,331 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-03-04 04:08:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-03-04 04:08:14,331 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-03-04 04:08:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:08:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2025-03-04 04:08:14,331 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2025-03-04 04:08:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2025-03-04 04:08:14,331 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2025-03-04 04:08:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2025-03-04 04:08:14,331 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2025-03-04 04:08:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:08:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-03-04 04:08:14,332 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-03-04 04:08:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2025-03-04 04:08:14,332 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2025-03-04 04:08:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:08:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:08:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:08:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:08:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:08:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:08:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:08:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:08:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:08:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:08:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-04 04:08:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-04 04:08:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-04 04:08:14,334 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2025-03-04 04:08:14,334 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-03-04 04:08:14,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-04 04:08:14,334 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-03-04 04:08:14,334 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-04 04:08:14,334 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-04 04:08:14,334 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-03-04 04:08:14,334 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2025-03-04 04:08:14,334 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-03-04 04:08:14,334 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 04:08:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 04:08:14,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 04:08:14,335 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 04:08:14,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 04:08:14,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:08:14,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:08:14,336 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2025-03-04 04:08:14,336 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2025-03-04 04:08:14,336 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-03-04 04:08:14,336 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-03-04 04:08:14,819 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:08:14,821 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:08:14,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7722: havoc dev_trans_start_#t~nondet577#1; [2025-03-04 04:08:14,925 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7791: havoc tty_chars_in_buffer_#t~nondet591#1; [2025-03-04 04:08:14,949 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:08:14,957 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7711: havoc #t~nondet574; [2025-03-04 04:08:15,003 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4722: havoc #t~mem1;havoc #t~bitwise2; [2025-03-04 04:08:15,193 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7707: havoc #t~nondet573; [2025-03-04 04:08:15,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7787: havoc slhc_uncompress_#t~nondet590#1; [2025-03-04 04:08:15,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7783: havoc slhc_remember_#t~nondet589#1; [2025-03-04 04:08:15,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7746: havoc netif_rx_#t~nondet580#1; [2025-03-04 04:08:15,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7714: havoc dev_alloc_skb_#t~ret575#1.base, dev_alloc_skb_#t~ret575#1.offset; [2025-03-04 04:08:15,649 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7678: havoc _copy_to_user_#t~nondet570#1; [2025-03-04 04:08:15,649 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7802: havoc tty_mode_ioctl_#t~nondet593#1; [2025-03-04 04:08:16,134 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7738: havoc #t~nondet578; [2025-03-04 04:08:16,219 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7795: havoc #t~nondet592; [2025-03-04 04:08:16,221 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7754: havoc #t~nondet582; [2025-03-04 04:08:16,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4922: havoc __kmalloc_#t~ret32#1.base, __kmalloc_#t~ret32#1.offset; [2025-03-04 04:08:16,387 INFO L1325 $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-04 04:08:16,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5003: havoc #t~mem57.base, #t~mem57.offset; [2025-03-04 04:08:21,335 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7700: havoc capable_#t~nondet572#1; [2025-03-04 04:08:21,336 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7503-1: ldv_register_netdevice_4_#res#1 := ldv_register_netdevice_4_~ldv_func_res~3#1; [2025-03-04 04:08:21,336 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7806: havoc tty_register_ldisc_#t~nondet594#1; [2025-03-04 04:08:21,336 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7773: havoc slhc_compress_#t~nondet587#1; [2025-03-04 04:08:21,336 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7742: havoc msleep_interruptible_#t~nondet579#1; [2025-03-04 04:08:21,336 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7810: havoc tty_unregister_ldisc_#t~nondet595#1; [2025-03-04 04:08:21,336 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7779: havoc slhc_init_#t~ret588#1.base, slhc_init_#t~ret588#1.offset; [2025-03-04 04:08:21,336 INFO L1325 $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-04 04:08:21,336 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7718: havoc dev_close_#t~nondet576#1; [2025-03-04 04:08:21,336 INFO L1325 $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-04 04:08:21,336 INFO L1325 $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-04 04:08:21,336 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7758: havoc register_netdevice_#t~nondet583#1; [2025-03-04 04:08:21,336 INFO L1325 $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-04 04:08:21,336 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7696: havoc alloc_netdev_mqs_#t~ret571#1.base, alloc_netdev_mqs_#t~ret571#1.offset; [2025-03-04 04:08:21,350 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7750: havoc netpoll_trap_#t~nondet581#1; [2025-03-04 04:08:21,671 INFO L? ?]: Removed 1525 outVars from TransFormulas that were not future-live. [2025-03-04 04:08:21,671 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:08:21,717 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:08:21,717 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 04:08:21,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:08:21 BoogieIcfgContainer [2025-03-04 04:08:21,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:08:21,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:08:21,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:08:21,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:08:21,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:08:11" (1/3) ... [2025-03-04 04:08:21,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4196ff03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:08:21, skipping insertion in model container [2025-03-04 04:08:21,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:13" (2/3) ... [2025-03-04 04:08:21,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4196ff03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:08:21, skipping insertion in model container [2025-03-04 04:08:21,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:08:21" (3/3) ... [2025-03-04 04:08:21,726 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2025-03-04 04:08:21,739 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:08:21,742 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, 1222 locations, 1 initial locations, 19 loop locations, and 1 error locations. [2025-03-04 04:08:21,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:08:21,815 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;@3fb0f0ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:08:21,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:08:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 1181 states, 870 states have (on average 1.4252873563218391) internal successors, (1240), 914 states have internal predecessors, (1240), 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-04 04:08:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 04:08:21,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:21,841 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:08:21,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:21,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:21,846 INFO L85 PathProgramCache]: Analyzing trace with hash 82896342, now seen corresponding path program 1 times [2025-03-04 04:08:21,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:21,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591238027] [2025-03-04 04:08:21,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:21,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:22,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 04:08:22,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 04:08:22,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:22,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:22,652 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-04 04:08:22,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:22,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591238027] [2025-03-04 04:08:22,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591238027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:08:22,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:08:22,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:08:22,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731988672] [2025-03-04 04:08:22,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:08:22,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:08:22,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:22,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:08:22,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:08:22,681 INFO L87 Difference]: Start difference. First operand has 1181 states, 870 states have (on average 1.4252873563218391) internal successors, (1240), 914 states have internal predecessors, (1240), 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 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04 04:08:22,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:08:22,988 INFO L93 Difference]: Finished difference Result 3012 states and 4455 transitions. [2025-03-04 04:08:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:08:22,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 63 [2025-03-04 04:08:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:08:23,014 INFO L225 Difference]: With dead ends: 3012 [2025-03-04 04:08:23,015 INFO L226 Difference]: Without dead ends: 1743 [2025-03-04 04:08:23,023 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-04 04:08:23,025 INFO L435 NwaCegarLoop]: 1746 mSDtfsCounter, 944 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 3416 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-04 04:08:23,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 3416 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:08:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-03-04 04:08:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1743. [2025-03-04 04:08:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1274 states have (on average 1.3979591836734695) internal successors, (1781), 1325 states have internal predecessors, (1781), 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-04 04:08:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2532 transitions. [2025-03-04 04:08:23,171 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2532 transitions. Word has length 63 [2025-03-04 04:08:23,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:08:23,173 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2532 transitions. [2025-03-04 04:08:23,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04 04:08:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2532 transitions. [2025-03-04 04:08:23,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 04:08:23,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:23,188 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] [2025-03-04 04:08:23,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 04:08:23,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:23,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2115862928, now seen corresponding path program 1 times [2025-03-04 04:08:23,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:23,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466511251] [2025-03-04 04:08:23,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:23,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:23,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 04:08:23,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 04:08:23,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:23,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:23,743 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-04 04:08:23,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:23,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466511251] [2025-03-04 04:08:23,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466511251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:08:23,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:08:23,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:08:23,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735771432] [2025-03-04 04:08:23,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:08:23,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:08:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:23,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:08:23,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:08:23,748 INFO L87 Difference]: Start difference. First operand 1743 states and 2532 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-04 04:08:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:08:23,892 INFO L93 Difference]: Finished difference Result 3462 states and 5032 transitions. [2025-03-04 04:08:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:08:23,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 122 [2025-03-04 04:08:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:08:23,904 INFO L225 Difference]: With dead ends: 3462 [2025-03-04 04:08:23,904 INFO L226 Difference]: Without dead ends: 1743 [2025-03-04 04:08:23,910 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-04 04:08:23,911 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 1646 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 1648 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-04 04:08:23,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 1648 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:08:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-03-04 04:08:23,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1743. [2025-03-04 04:08:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1274 states have (on average 1.3963893249607535) internal successors, (1779), 1325 states have internal predecessors, (1779), 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-04 04:08:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2530 transitions. [2025-03-04 04:08:24,006 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2530 transitions. Word has length 122 [2025-03-04 04:08:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:08:24,007 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2530 transitions. [2025-03-04 04:08:24,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-04 04:08:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2530 transitions. [2025-03-04 04:08:24,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 04:08:24,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:24,013 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] [2025-03-04 04:08:24,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:08:24,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:24,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1932791281, now seen corresponding path program 1 times [2025-03-04 04:08:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:24,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76429771] [2025-03-04 04:08:24,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:24,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:24,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 04:08:24,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 04:08:24,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:24,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:24,664 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-04 04:08:24,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:24,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76429771] [2025-03-04 04:08:24,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76429771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:08:24,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:08:24,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:08:24,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663943847] [2025-03-04 04:08:24,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:08:24,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:08:24,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:24,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:08:24,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:08:24,667 INFO L87 Difference]: Start difference. First operand 1743 states and 2530 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-04 04:08:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:08:24,789 INFO L93 Difference]: Finished difference Result 1748 states and 2535 transitions. [2025-03-04 04:08:24,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:08:24,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 122 [2025-03-04 04:08:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:08:24,801 INFO L225 Difference]: With dead ends: 1748 [2025-03-04 04:08:24,801 INFO L226 Difference]: Without dead ends: 1745 [2025-03-04 04:08:24,802 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-04 04:08:24,804 INFO L435 NwaCegarLoop]: 1654 mSDtfsCounter, 0 mSDsluCounter, 3301 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4955 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-04 04:08:24,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4955 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:08:24,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2025-03-04 04:08:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1745. [2025-03-04 04:08:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1276 states have (on average 1.39576802507837) internal successors, (1781), 1327 states have internal predecessors, (1781), 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-04 04:08:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2532 transitions. [2025-03-04 04:08:24,877 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2532 transitions. Word has length 122 [2025-03-04 04:08:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:08:24,878 INFO L471 AbstractCegarLoop]: Abstraction has 1745 states and 2532 transitions. [2025-03-04 04:08:24,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-04 04:08:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2532 transitions. [2025-03-04 04:08:24,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 04:08:24,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:24,885 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, 1, 1, 1, 1] [2025-03-04 04:08:24,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:08:24,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:24,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash -984276091, now seen corresponding path program 1 times [2025-03-04 04:08:24,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:24,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889337767] [2025-03-04 04:08:24,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:24,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:25,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 04:08:25,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 04:08:25,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:25,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:25,383 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-04 04:08:25,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:25,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889337767] [2025-03-04 04:08:25,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889337767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:08:25,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:08:25,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:08:25,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024303913] [2025-03-04 04:08:25,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:08:25,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:08:25,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:25,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:08:25,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:08:25,384 INFO L87 Difference]: Start difference. First operand 1745 states and 2532 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-04 04:08:29,400 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-04 04:08:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:08:30,571 INFO L93 Difference]: Finished difference Result 3477 states and 5049 transitions. [2025-03-04 04:08:30,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:08:30,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 132 [2025-03-04 04:08:30,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:08:30,585 INFO L225 Difference]: With dead ends: 3477 [2025-03-04 04:08:30,586 INFO L226 Difference]: Without dead ends: 1756 [2025-03-04 04:08:30,591 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-04 04:08:30,593 INFO L435 NwaCegarLoop]: 1645 mSDtfsCounter, 1623 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 2805 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:08:30,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1624 Valid, 2805 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 535 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-04 04:08:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2025-03-04 04:08:30,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1746. [2025-03-04 04:08:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1277 states have (on average 1.3954581049334378) internal successors, (1782), 1328 states have internal predecessors, (1782), 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-04 04:08:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 2533 transitions. [2025-03-04 04:08:30,667 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 2533 transitions. Word has length 132 [2025-03-04 04:08:30,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:08:30,668 INFO L471 AbstractCegarLoop]: Abstraction has 1746 states and 2533 transitions. [2025-03-04 04:08:30,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-04 04:08:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2533 transitions. [2025-03-04 04:08:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 04:08:30,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:30,674 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, 1, 1, 1, 1, 1, 1] [2025-03-04 04:08:30,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:08:30,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:30,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:30,677 INFO L85 PathProgramCache]: Analyzing trace with hash 988509128, now seen corresponding path program 1 times [2025-03-04 04:08:30,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:30,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653253235] [2025-03-04 04:08:30,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:30,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:30,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 04:08:30,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 04:08:30,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:30,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:31,252 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-04 04:08:31,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:31,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653253235] [2025-03-04 04:08:31,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653253235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:08:31,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:08:31,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:08:31,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129106962] [2025-03-04 04:08:31,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:08:31,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:08:31,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:31,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:08:31,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:08:31,254 INFO L87 Difference]: Start difference. First operand 1746 states and 2533 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-04 04:08:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:08:31,401 INFO L93 Difference]: Finished difference Result 1764 states and 2557 transitions. [2025-03-04 04:08:31,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:08:31,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 134 [2025-03-04 04:08:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:08:31,412 INFO L225 Difference]: With dead ends: 1764 [2025-03-04 04:08:31,412 INFO L226 Difference]: Without dead ends: 1761 [2025-03-04 04:08:31,414 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-04 04:08:31,414 INFO L435 NwaCegarLoop]: 1656 mSDtfsCounter, 120 mSDsluCounter, 4805 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 6461 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-04 04:08:31,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 6461 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:08:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2025-03-04 04:08:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1748. [2025-03-04 04:08:31,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1278 states have (on average 1.3951486697965572) internal successors, (1783), 1328 states have internal predecessors, (1783), 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-04 04:08:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2536 transitions. [2025-03-04 04:08:31,471 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2536 transitions. Word has length 134 [2025-03-04 04:08:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:08:31,471 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 2536 transitions. [2025-03-04 04:08:31,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-04 04:08:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2536 transitions. [2025-03-04 04:08:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 04:08:31,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:31,479 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] [2025-03-04 04:08:31,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:08:31,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:31,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:31,480 INFO L85 PathProgramCache]: Analyzing trace with hash 239318801, now seen corresponding path program 1 times [2025-03-04 04:08:31,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:31,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669012131] [2025-03-04 04:08:31,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:31,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:31,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 04:08:31,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 04:08:31,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:31,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:31,864 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-04 04:08:31,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:31,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669012131] [2025-03-04 04:08:31,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669012131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:08:31,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:08:31,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:08:31,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976904131] [2025-03-04 04:08:31,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:08:31,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:08:31,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:31,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:08:31,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:08:31,866 INFO L87 Difference]: Start difference. First operand 1748 states and 2536 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-04 04:08:35,875 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-04 04:08:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:08:36,128 INFO L93 Difference]: Finished difference Result 5152 states and 7476 transitions. [2025-03-04 04:08:36,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:08:36,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 166 [2025-03-04 04:08:36,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:08:36,146 INFO L225 Difference]: With dead ends: 5152 [2025-03-04 04:08:36,147 INFO L226 Difference]: Without dead ends: 3428 [2025-03-04 04:08:36,152 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-04 04:08:36,152 INFO L435 NwaCegarLoop]: 2464 mSDtfsCounter, 1604 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 4064 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-04 04:08:36,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 4064 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:08:36,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2025-03-04 04:08:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 3421. [2025-03-04 04:08:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 2504 states have (on average 1.3977635782747604) internal successors, (3500), 2604 states have internal predecessors, (3500), 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-04 04:08:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 4965 transitions. [2025-03-04 04:08:36,354 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 4965 transitions. Word has length 166 [2025-03-04 04:08:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:08:36,354 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 4965 transitions. [2025-03-04 04:08:36,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-04 04:08:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 4965 transitions. [2025-03-04 04:08:36,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 04:08:36,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:36,371 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, 1, 1, 1, 1, 1, 1] [2025-03-04 04:08:36,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:08:36,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:36,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:36,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1344033893, now seen corresponding path program 1 times [2025-03-04 04:08:36,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:36,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160809196] [2025-03-04 04:08:36,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:36,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:36,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 04:08:36,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 04:08:36,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:36,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:36,793 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-04 04:08:36,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:36,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160809196] [2025-03-04 04:08:36,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160809196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:08:36,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:08:36,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:08:36,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332246206] [2025-03-04 04:08:36,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:08:36,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:08:36,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:36,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:08:36,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:08:36,795 INFO L87 Difference]: Start difference. First operand 3421 states and 4965 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-04 04:08:40,803 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-04 04:08:40,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:08:40,978 INFO L93 Difference]: Finished difference Result 5740 states and 8305 transitions. [2025-03-04 04:08:40,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:08:40,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 168 [2025-03-04 04:08:40,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:08:41,038 INFO L225 Difference]: With dead ends: 5740 [2025-03-04 04:08:41,039 INFO L226 Difference]: Without dead ends: 2332 [2025-03-04 04:08:41,045 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-04 04:08:41,046 INFO L435 NwaCegarLoop]: 1655 mSDtfsCounter, 0 mSDsluCounter, 3301 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4956 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-04 04:08:41,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4956 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:08:41,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2025-03-04 04:08:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 2332. [2025-03-04 04:08:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 1695 states have (on average 1.3858407079646018) internal successors, (2349), 1761 states have internal predecessors, (2349), 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-04 04:08:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 3358 transitions. [2025-03-04 04:08:41,142 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 3358 transitions. Word has length 168 [2025-03-04 04:08:41,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:08:41,143 INFO L471 AbstractCegarLoop]: Abstraction has 2332 states and 3358 transitions. [2025-03-04 04:08:41,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-04 04:08:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 3358 transitions. [2025-03-04 04:08:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 04:08:41,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:41,152 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-04 04:08:41,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 04:08:41,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:41,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:41,153 INFO L85 PathProgramCache]: Analyzing trace with hash -400595953, now seen corresponding path program 1 times [2025-03-04 04:08:41,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:41,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533199226] [2025-03-04 04:08:41,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:41,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:41,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 04:08:41,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 04:08:41,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:41,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:41,607 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-04 04:08:41,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:41,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533199226] [2025-03-04 04:08:41,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533199226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:08:41,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:08:41,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:08:41,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764310132] [2025-03-04 04:08:41,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:08:41,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:08:41,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:41,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:08:41,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:08:41,609 INFO L87 Difference]: Start difference. First operand 2332 states and 3358 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-04 04:08:45,620 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-04 04:08:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:08:46,483 INFO L93 Difference]: Finished difference Result 4079 states and 5894 transitions. [2025-03-04 04:08:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:08:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 168 [2025-03-04 04:08:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:08:46,495 INFO L225 Difference]: With dead ends: 4079 [2025-03-04 04:08:46,496 INFO L226 Difference]: Without dead ends: 2359 [2025-03-04 04:08:46,500 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-04 04:08:46,501 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1621 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-04 04:08:46,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 2803 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 549 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-03-04 04:08:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2025-03-04 04:08:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2336. [2025-03-04 04:08:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 1699 states have (on average 1.3855208946439082) internal successors, (2354), 1765 states have internal predecessors, (2354), 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-04 04:08:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3363 transitions. [2025-03-04 04:08:46,592 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3363 transitions. Word has length 168 [2025-03-04 04:08:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:08:46,593 INFO L471 AbstractCegarLoop]: Abstraction has 2336 states and 3363 transitions. [2025-03-04 04:08:46,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-04 04:08:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3363 transitions. [2025-03-04 04:08:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 04:08:46,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:46,602 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, 1, 1, 1] [2025-03-04 04:08:46,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 04:08:46,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:46,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:46,603 INFO L85 PathProgramCache]: Analyzing trace with hash -290824719, now seen corresponding path program 1 times [2025-03-04 04:08:46,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:46,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984198306] [2025-03-04 04:08:46,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:46,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:46,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 04:08:46,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 04:08:46,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:46,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:46,929 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-04 04:08:46,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:46,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984198306] [2025-03-04 04:08:46,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984198306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:08:46,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:08:46,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:08:46,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400510160] [2025-03-04 04:08:46,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:08:46,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:08:46,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:46,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:08:46,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:08:46,931 INFO L87 Difference]: Start difference. First operand 2336 states and 3363 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-04 04:08:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:08:47,089 INFO L93 Difference]: Finished difference Result 4648 states and 6726 transitions. [2025-03-04 04:08:47,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:08:47,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 171 [2025-03-04 04:08:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:08:47,102 INFO L225 Difference]: With dead ends: 4648 [2025-03-04 04:08:47,103 INFO L226 Difference]: Without dead ends: 2336 [2025-03-04 04:08:47,108 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-04 04:08:47,110 INFO L435 NwaCegarLoop]: 1645 mSDtfsCounter, 0 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3284 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-04 04:08:47,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3284 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:08:47,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2025-03-04 04:08:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2336. [2025-03-04 04:08:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 1699 states have (on average 1.3802236609770453) internal successors, (2345), 1765 states have internal predecessors, (2345), 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-04 04:08:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3354 transitions. [2025-03-04 04:08:47,192 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3354 transitions. Word has length 171 [2025-03-04 04:08:47,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:08:47,194 INFO L471 AbstractCegarLoop]: Abstraction has 2336 states and 3354 transitions. [2025-03-04 04:08:47,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-04 04:08:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3354 transitions. [2025-03-04 04:08:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 04:08:47,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:47,204 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, 1, 1, 1, 1, 1, 1] [2025-03-04 04:08:47,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 04:08:47,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:47,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:47,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1563336724, now seen corresponding path program 1 times [2025-03-04 04:08:47,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:47,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975215818] [2025-03-04 04:08:47,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:47,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:47,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 04:08:47,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 04:08:47,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:47,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:47,615 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-04 04:08:47,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:47,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975215818] [2025-03-04 04:08:47,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975215818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:08:47,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835506921] [2025-03-04 04:08:47,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:47,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:08:47,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:08:47,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:08:47,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 04:08:48,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 04:08:48,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 04:08:48,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:48,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:48,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 04:08:48,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:08:48,695 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-04 04:08:48,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:08:48,940 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-04 04:08:48,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835506921] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:08:48,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:08:48,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2025-03-04 04:08:48,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901976322] [2025-03-04 04:08:48,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:08:48,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 04:08:48,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:48,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 04:08:48,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:08:48,942 INFO L87 Difference]: Start difference. First operand 2336 states and 3354 transitions. Second operand has 10 states, 10 states have (on average 19.6) internal successors, (196), 10 states have internal predecessors, (196), 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-04 04:08:52,955 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-04 04:08:56,962 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-04 04:09:00,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:09:04,992 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-04 04:09:09,003 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-04 04:09:13,014 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-04 04:09:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:14,498 INFO L93 Difference]: Finished difference Result 4140 states and 5969 transitions. [2025-03-04 04:09:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 04:09:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.6) internal successors, (196), 10 states have internal predecessors, (196), 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 174 [2025-03-04 04:09:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:14,510 INFO L225 Difference]: With dead ends: 4140 [2025-03-04 04:09:14,511 INFO L226 Difference]: Without dead ends: 2416 [2025-03-04 04:09:14,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 343 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-04 04:09:14,516 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 1728 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 50 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 3984 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:14,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 3984 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1107 Invalid, 6 Unknown, 0 Unchecked, 25.4s Time] [2025-03-04 04:09:14,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2025-03-04 04:09:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2343. [2025-03-04 04:09:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 1706 states have (on average 1.3798358733880423) internal successors, (2354), 1772 states have internal predecessors, (2354), 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-04 04:09:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3363 transitions. [2025-03-04 04:09:14,648 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3363 transitions. Word has length 174 [2025-03-04 04:09:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:14,648 INFO L471 AbstractCegarLoop]: Abstraction has 2343 states and 3363 transitions. [2025-03-04 04:09:14,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.6) internal successors, (196), 10 states have internal predecessors, (196), 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-04 04:09:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3363 transitions. [2025-03-04 04:09:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 04:09:14,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:14,660 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, 1, 1, 1, 1] [2025-03-04 04:09:14,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 04:09:14,864 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-04 04:09:14,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:14,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1800906291, now seen corresponding path program 1 times [2025-03-04 04:09:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604453706] [2025-03-04 04:09:14,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:14,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:15,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 04:09:15,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 04:09:15,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:15,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:16,034 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-04 04:09:16,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:16,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604453706] [2025-03-04 04:09:16,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604453706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:16,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856871641] [2025-03-04 04:09:16,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:16,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:16,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:16,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:09:16,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 04:09:16,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 04:09:16,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 04:09:16,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:16,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:16,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 04:09:16,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:09:16,967 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-04 04:09:16,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:09:16,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856871641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:16,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:09:16,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-04 04:09:16,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674605455] [2025-03-04 04:09:16,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:16,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:09:16,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:16,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:09:16,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:09:16,969 INFO L87 Difference]: Start difference. First operand 2343 states and 3363 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-04 04:09:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:17,103 INFO L93 Difference]: Finished difference Result 4091 states and 5884 transitions. [2025-03-04 04:09:17,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:09:17,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 184 [2025-03-04 04:09:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:17,116 INFO L225 Difference]: With dead ends: 4091 [2025-03-04 04:09:17,117 INFO L226 Difference]: Without dead ends: 2343 [2025-03-04 04:09:17,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:09:17,123 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 2 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3289 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-04 04:09:17,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3289 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:09:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2025-03-04 04:09:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2025-03-04 04:09:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 1706 states have (on average 1.3780773739742087) internal successors, (2351), 1772 states have internal predecessors, (2351), 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-04 04:09:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3360 transitions. [2025-03-04 04:09:17,247 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3360 transitions. Word has length 184 [2025-03-04 04:09:17,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:17,247 INFO L471 AbstractCegarLoop]: Abstraction has 2343 states and 3360 transitions. [2025-03-04 04:09:17,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-04 04:09:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3360 transitions. [2025-03-04 04:09:17,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 04:09:17,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:17,259 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, 1, 1, 1, 1, 1, 1] [2025-03-04 04:09:17,271 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-04 04:09:17,459 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-04 04:09:17,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:17,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:17,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1513555301, now seen corresponding path program 1 times [2025-03-04 04:09:17,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:17,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361495765] [2025-03-04 04:09:17,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:17,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:17,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 04:09:17,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 04:09:17,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:17,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:18,438 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-04 04:09:18,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:18,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361495765] [2025-03-04 04:09:18,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361495765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:18,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66464134] [2025-03-04 04:09:18,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:18,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:18,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:18,442 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-04 04:09:18,444 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-04 04:09:19,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 04:09:19,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 04:09:19,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:19,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:19,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 04:09:19,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:09:19,280 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-04 04:09:19,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:09:19,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66464134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:19,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:09:19,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2025-03-04 04:09:19,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090634890] [2025-03-04 04:09:19,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:19,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 04:09:19,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:19,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 04:09:19,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:09:19,282 INFO L87 Difference]: Start difference. First operand 2343 states and 3360 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 7 states have internal predecessors, (118), 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-04 04:09:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:19,580 INFO L93 Difference]: Finished difference Result 4102 states and 5904 transitions. [2025-03-04 04:09:19,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 04:09:19,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 7 states have internal predecessors, (118), 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 186 [2025-03-04 04:09:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:19,594 INFO L225 Difference]: With dead ends: 4102 [2025-03-04 04:09:19,595 INFO L226 Difference]: Without dead ends: 2363 [2025-03-04 04:09:19,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 04:09:19,600 INFO L435 NwaCegarLoop]: 1670 mSDtfsCounter, 863 mSDsluCounter, 11626 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 13296 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:19,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 13296 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:09:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2025-03-04 04:09:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2361. [2025-03-04 04:09:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 1718 states have (on average 1.3754365541327125) internal successors, (2363), 1787 states have internal predecessors, (2363), 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-04 04:09:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3390 transitions. [2025-03-04 04:09:19,682 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3390 transitions. Word has length 186 [2025-03-04 04:09:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:19,683 INFO L471 AbstractCegarLoop]: Abstraction has 2361 states and 3390 transitions. [2025-03-04 04:09:19,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 7 states have internal predecessors, (118), 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-04 04:09:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3390 transitions. [2025-03-04 04:09:19,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 04:09:19,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:19,691 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-04 04:09:19,702 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-04 04:09:19,891 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-04 04:09:19,891 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:19,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:19,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1365174737, now seen corresponding path program 1 times [2025-03-04 04:09:19,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:19,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724179561] [2025-03-04 04:09:19,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:19,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:20,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 04:09:20,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 04:09:20,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:20,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:20,413 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-04 04:09:20,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:20,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724179561] [2025-03-04 04:09:20,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724179561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:20,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:20,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:09:20,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536240241] [2025-03-04 04:09:20,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:20,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:09:20,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:20,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:09:20,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:09:20,417 INFO L87 Difference]: Start difference. First operand 2361 states and 3390 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-04 04:09:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:20,577 INFO L93 Difference]: Finished difference Result 4106 states and 5916 transitions. [2025-03-04 04:09:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:09:20,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 192 [2025-03-04 04:09:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:20,594 INFO L225 Difference]: With dead ends: 4106 [2025-03-04 04:09:20,597 INFO L226 Difference]: Without dead ends: 2363 [2025-03-04 04:09:20,601 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-04 04:09:20,602 INFO L435 NwaCegarLoop]: 1645 mSDtfsCounter, 0 mSDsluCounter, 3271 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4916 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-04 04:09:20,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4916 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:09:20,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2025-03-04 04:09:20,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2363. [2025-03-04 04:09:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 1720 states have (on average 1.375) internal successors, (2365), 1789 states have internal predecessors, (2365), 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-04 04:09:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3392 transitions. [2025-03-04 04:09:20,721 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3392 transitions. Word has length 192 [2025-03-04 04:09:20,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:20,722 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 3392 transitions. [2025-03-04 04:09:20,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-04 04:09:20,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3392 transitions. [2025-03-04 04:09:20,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 04:09:20,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:20,732 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:09:20,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 04:09:20,733 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:20,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:20,733 INFO L85 PathProgramCache]: Analyzing trace with hash 853586812, now seen corresponding path program 1 times [2025-03-04 04:09:20,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:20,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901068193] [2025-03-04 04:09:20,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:20,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:21,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 04:09:21,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 04:09:21,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:21,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:21,134 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-04 04:09:21,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:21,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901068193] [2025-03-04 04:09:21,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901068193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:21,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:21,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:09:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992208824] [2025-03-04 04:09:21,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:21,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:09:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:21,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:09:21,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:09:21,135 INFO L87 Difference]: Start difference. First operand 2363 states and 3392 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-04 04:09:21,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:21,268 INFO L93 Difference]: Finished difference Result 4110 states and 5921 transitions. [2025-03-04 04:09:21,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:09:21,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 200 [2025-03-04 04:09:21,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:21,278 INFO L225 Difference]: With dead ends: 4110 [2025-03-04 04:09:21,278 INFO L226 Difference]: Without dead ends: 2365 [2025-03-04 04:09:21,283 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-04 04:09:21,283 INFO L435 NwaCegarLoop]: 1645 mSDtfsCounter, 2 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3275 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:21,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3275 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:09:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2025-03-04 04:09:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2365. [2025-03-04 04:09:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2365 states, 1722 states have (on average 1.3745644599303135) internal successors, (2367), 1791 states have internal predecessors, (2367), 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-04 04:09:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3394 transitions. [2025-03-04 04:09:21,361 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3394 transitions. Word has length 200 [2025-03-04 04:09:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:21,361 INFO L471 AbstractCegarLoop]: Abstraction has 2365 states and 3394 transitions. [2025-03-04 04:09:21,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-04 04:09:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3394 transitions. [2025-03-04 04:09:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-04 04:09:21,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:21,369 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:09:21,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 04:09:21,369 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:21,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:21,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1691880776, now seen corresponding path program 1 times [2025-03-04 04:09:21,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:21,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858264945] [2025-03-04 04:09:21,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:21,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:21,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-04 04:09:21,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 04:09:21,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:21,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:22,006 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-04 04:09:22,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:22,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858264945] [2025-03-04 04:09:22,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858264945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:22,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:22,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:09:22,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166238297] [2025-03-04 04:09:22,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:22,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:09:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:22,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:09:22,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:09:22,008 INFO L87 Difference]: Start difference. First operand 2365 states and 3394 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-04 04:09:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:22,178 INFO L93 Difference]: Finished difference Result 4116 states and 5926 transitions. [2025-03-04 04:09:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:09:22,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 209 [2025-03-04 04:09:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:22,191 INFO L225 Difference]: With dead ends: 4116 [2025-03-04 04:09:22,192 INFO L226 Difference]: Without dead ends: 2369 [2025-03-04 04:09:22,198 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-04 04:09:22,199 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 2 mSDsluCounter, 6557 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8201 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:22,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8201 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:09:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-03-04 04:09:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2368. [2025-03-04 04:09:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 1725 states have (on average 1.373913043478261) internal successors, (2370), 1793 states have internal predecessors, (2370), 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-04 04:09:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3397 transitions. [2025-03-04 04:09:22,281 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3397 transitions. Word has length 209 [2025-03-04 04:09:22,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:22,281 INFO L471 AbstractCegarLoop]: Abstraction has 2368 states and 3397 transitions. [2025-03-04 04:09:22,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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-04 04:09:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3397 transitions. [2025-03-04 04:09:22,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-04 04:09:22,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:22,292 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:09:22,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 04:09:22,292 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:22,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:22,293 INFO L85 PathProgramCache]: Analyzing trace with hash 727455378, now seen corresponding path program 1 times [2025-03-04 04:09:22,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:22,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579746750] [2025-03-04 04:09:22,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:22,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:22,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-04 04:09:22,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-04 04:09:22,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:22,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-04 04:09:30,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:30,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579746750] [2025-03-04 04:09:30,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579746750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:30,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675755793] [2025-03-04 04:09:30,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:30,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:30,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:30,042 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-04 04:09:30,044 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-04 04:09:30,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.