./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.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 2e2f48ab037d80d8f09964fc14a08b090a2ac957ba1c26211e43b888a860dc78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 08:27:54,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 08:27:54,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 08:27:54,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 08:27:54,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 08:27:54,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 08:27:54,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 08:27:54,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 08:27:54,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 08:27:54,112 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 08:27:54,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 08:27:54,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 08:27:54,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 08:27:54,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 08:27:54,114 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 08:27:54,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 08:27:54,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 08:27:54,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 08:27:54,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 08:27:54,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 08:27:54,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 08:27:54,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 08:27:54,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 08:27:54,116 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 08:27:54,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 08:27:54,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 08:27:54,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 08:27:54,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 08:27:54,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 08:27:54,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 08:27:54,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 08:27:54,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 08:27:54,117 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 08:27:54,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 08:27:54,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 08:27:54,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 08:27:54,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 08:27:54,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 08:27:54,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 08:27:54,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 08:27:54,117 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 -> 2e2f48ab037d80d8f09964fc14a08b090a2ac957ba1c26211e43b888a860dc78 [2025-03-17 08:27:54,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 08:27:54,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 08:27:54,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 08:27:54,340 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 08:27:54,340 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 08:27:54,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-03-17 08:27:55,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb835e6eb/b88d0a47b46d4e13ab12094e4ff4c6b2/FLAG6fab8305c [2025-03-17 08:27:56,128 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 08:27:56,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-03-17 08:27:56,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb835e6eb/b88d0a47b46d4e13ab12094e4ff4c6b2/FLAG6fab8305c [2025-03-17 08:27:56,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb835e6eb/b88d0a47b46d4e13ab12094e4ff4c6b2 [2025-03-17 08:27:56,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 08:27:56,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 08:27:56,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 08:27:56,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 08:27:56,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 08:27:56,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:27:56" (1/1) ... [2025-03-17 08:27:56,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28cb799d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:56, skipping insertion in model container [2025-03-17 08:27:56,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:27:56" (1/1) ... [2025-03-17 08:27:56,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 08:27:57,256 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.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2025-03-17 08:27:57,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 08:27:57,313 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 08:27:57,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4690] [2025-03-17 08:27:57,371 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4697] [2025-03-17 08:27:57,371 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4705-4706] [2025-03-17 08:27:57,372 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4714-4715] [2025-03-17 08:27:57,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4843] [2025-03-17 08:27:57,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4846] [2025-03-17 08:27:57,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4849] [2025-03-17 08:27:57,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4852] [2025-03-17 08:27:57,384 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5234] [2025-03-17 08:27:57,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5238] [2025-03-17 08:27:57,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5242] [2025-03-17 08:27:57,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5246] [2025-03-17 08:27:57,386 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"); [5257] [2025-03-17 08:27:57,386 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"); [5261] [2025-03-17 08:27:57,386 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"); [5265] [2025-03-17 08:27:57,387 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"); [5269] [2025-03-17 08:27:57,387 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"); [5280] [2025-03-17 08:27:57,388 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"); [5284] [2025-03-17 08:27:57,388 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"); [5288] [2025-03-17 08:27:57,388 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"); [5292] [2025-03-17 08:27:57,389 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"); [5303] [2025-03-17 08:27:57,390 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"); [5307] [2025-03-17 08:27:57,390 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"); [5311] [2025-03-17 08:27:57,390 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"); [5315] [2025-03-17 08:27:57,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5365] [2025-03-17 08:27:57,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5369] [2025-03-17 08:27:57,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5373] [2025-03-17 08:27:57,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5377] [2025-03-17 08:27:57,393 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"); [5388] [2025-03-17 08:27:57,394 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"); [5392] [2025-03-17 08:27:57,394 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"); [5396] [2025-03-17 08:27:57,394 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"); [5400] [2025-03-17 08:27:57,394 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"); [5411] [2025-03-17 08:27:57,395 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"); [5415] [2025-03-17 08:27:57,395 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"); [5419] [2025-03-17 08:27:57,395 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"); [5423] [2025-03-17 08:27:57,396 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"); [5434] [2025-03-17 08:27:57,396 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"); [5438] [2025-03-17 08:27:57,396 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"); [5442] [2025-03-17 08:27:57,396 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"); [5446] [2025-03-17 08:27:57,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5520] [2025-03-17 08:27:57,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5524] [2025-03-17 08:27:57,401 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5528] [2025-03-17 08:27:57,401 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5532] [2025-03-17 08:27:57,401 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"); [5543] [2025-03-17 08:27:57,401 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"); [5547] [2025-03-17 08:27:57,401 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"); [5551] [2025-03-17 08:27:57,402 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"); [5555] [2025-03-17 08:27:57,402 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"); [5566] [2025-03-17 08:27:57,402 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"); [5570] [2025-03-17 08:27:57,402 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"); [5574] [2025-03-17 08:27:57,403 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"); [5578] [2025-03-17 08:27:57,442 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"); [6518] [2025-03-17 08:27:57,442 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"); [6521] [2025-03-17 08:27:57,442 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"); [6524] [2025-03-17 08:27:57,442 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"); [6527] [2025-03-17 08:27:57,443 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"); [6530] [2025-03-17 08:27:57,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6543] [2025-03-17 08:27:57,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6546] [2025-03-17 08:27:57,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6549] [2025-03-17 08:27:57,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6552] [2025-03-17 08:27:57,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6555] [2025-03-17 08:27:57,444 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)); [6577] [2025-03-17 08:27:57,444 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)); [6580] [2025-03-17 08:27:57,444 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)); [6583] [2025-03-17 08:27:57,445 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)); [6586] [2025-03-17 08:27:57,445 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)); [6589] [2025-03-17 08:27:57,446 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"); [6622-6623] [2025-03-17 08:27:57,447 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"); [6626-6627] [2025-03-17 08:27:57,447 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"); [6630-6631] [2025-03-17 08:27:57,447 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"); [6634-6635] [2025-03-17 08:27:57,447 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"); [6638-6639] [2025-03-17 08:27:57,448 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)); [6652] [2025-03-17 08:27:57,448 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)); [6655] [2025-03-17 08:27:57,448 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)); [6658] [2025-03-17 08:27:57,449 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)); [6661] [2025-03-17 08:27:57,449 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)); [6664] [2025-03-17 08:27:57,450 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"); [6697-6698] [2025-03-17 08:27:57,450 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"); [6701-6702] [2025-03-17 08:27:57,450 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"); [6705-6706] [2025-03-17 08:27:57,451 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"); [6709-6710] [2025-03-17 08:27:57,451 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"); [6713-6714] [2025-03-17 08:27:57,470 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.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2025-03-17 08:27:57,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 08:27:57,565 INFO L204 MainTranslator]: Completed translation [2025-03-17 08:27:57,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:57 WrapperNode [2025-03-17 08:27:57,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 08:27:57,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 08:27:57,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 08:27:57,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 08:27:57,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:57" (1/1) ... [2025-03-17 08:27:57,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:57" (1/1) ... [2025-03-17 08:27:57,725 INFO L138 Inliner]: procedures = 186, calls = 884, calls flagged for inlining = 94, calls inlined = 92, statements flattened = 3448 [2025-03-17 08:27:57,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 08:27:57,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 08:27:57,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 08:27:57,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 08:27:57,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:57" (1/1) ... [2025-03-17 08:27:57,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:57" (1/1) ... [2025-03-17 08:27:57,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:57" (1/1) ... [2025-03-17 08:27:58,111 INFO L175 MemorySlicer]: Split 434 memory accesses to 10 slices as follows [347, 2, 4, 1, 3, 16, 1, 2, 36, 22]. 80 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [5, 2, 0, 0, 0, 0, 0, 0, 0, 0]. The 182 writes are split as follows [120, 0, 1, 0, 0, 2, 1, 0, 36, 22]. [2025-03-17 08:27:58,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:57" (1/1) ... [2025-03-17 08:27:58,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:57" (1/1) ... [2025-03-17 08:27:58,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:57" (1/1) ... [2025-03-17 08:27:58,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:57" (1/1) ... [2025-03-17 08:27:58,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:57" (1/1) ... [2025-03-17 08:27:58,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:57" (1/1) ... [2025-03-17 08:27:58,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 08:27:58,260 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 08:27:58,260 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 08:27:58,260 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 08:27:58,261 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:57" (1/1) ... [2025-03-17 08:27:58,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 08:27:58,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:27:58,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 08:27:58,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 08:27:58,308 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2025-03-17 08:27:58,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2025-03-17 08:27:58,309 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2025-03-17 08:27:58,309 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2025-03-17 08:27:58,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 08:27:58,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 08:27:58,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 08:27:58,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 08:27:58,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2025-03-17 08:27:58,310 INFO L138 BoogieDeclarations]: Found implementation of procedure __xchg_wrong_size [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2025-03-17 08:27:58,310 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-17 08:27:58,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 08:27:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 08:27:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-17 08:27:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-17 08:27:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-03-17 08:27:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-03-17 08:27:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2025-03-17 08:27:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2025-03-17 08:27:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2025-03-17 08:27:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2025-03-17 08:27:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-17 08:27:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-17 08:27:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-17 08:27:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-17 08:27:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-17 08:27:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-17 08:27:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-17 08:27:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-17 08:27:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-17 08:27:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-17 08:27:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-17 08:27:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-17 08:27:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-17 08:27:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-17 08:27:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-17 08:27:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-17 08:27:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-17 08:27:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-17 08:27:58,313 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2025-03-17 08:27:58,315 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 08:27:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-03-17 08:27:58,316 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2025-03-17 08:27:58,316 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2025-03-17 08:27:58,316 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2025-03-17 08:27:58,316 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2025-03-17 08:27:58,316 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2025-03-17 08:27:58,316 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 08:27:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 08:27:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 08:27:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 08:27:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-17 08:27:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-17 08:27:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-03-17 08:27:58,319 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-03-17 08:27:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-03-17 08:27:58,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-03-17 08:27:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2025-03-17 08:27:58,319 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2025-03-17 08:27:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2025-03-17 08:27:58,319 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2025-03-17 08:27:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2025-03-17 08:27:58,319 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2025-03-17 08:27:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 08:27:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2025-03-17 08:27:58,320 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2025-03-17 08:27:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2025-03-17 08:27:58,320 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2025-03-17 08:27:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-17 08:27:58,320 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-17 08:27:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-17 08:27:58,320 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-17 08:27:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2025-03-17 08:27:58,320 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2025-03-17 08:27:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-17 08:27:58,320 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-17 08:27:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-17 08:27:58,320 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-17 08:27:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2025-03-17 08:27:58,320 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2025-03-17 08:27:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-03-17 08:27:58,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-03-17 08:27:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-17 08:27:58,320 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-03-17 08:27:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-17 08:27:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-17 08:27:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-03-17 08:27:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2025-03-17 08:27:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-03-17 08:27:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 08:27:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2025-03-17 08:27:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2025-03-17 08:27:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-03-17 08:27:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-03-17 08:27:58,785 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 08:27:58,786 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 08:27:58,901 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7786: havoc tty_chars_in_buffer_#t~nondet613#1; [2025-03-17 08:27:58,901 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7717: havoc dev_trans_start_#t~nondet599#1; [2025-03-17 08:27:58,925 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-17 08:27:58,939 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7706: havoc #t~nondet596; [2025-03-17 08:27:58,984 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4722: havoc #t~mem1;havoc #t~bitwise2; [2025-03-17 08:27:59,132 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7702: havoc #t~nondet595; [2025-03-17 08:27:59,428 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7782: havoc slhc_uncompress_#t~nondet612#1; [2025-03-17 08:27:59,428 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7778: havoc slhc_remember_#t~nondet611#1; [2025-03-17 08:27:59,428 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7741: havoc netif_rx_#t~nondet602#1; [2025-03-17 08:27:59,428 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7709: havoc dev_alloc_skb_#t~ret597#1.base, dev_alloc_skb_#t~ret597#1.offset; [2025-03-17 08:27:59,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7673: havoc _copy_to_user_#t~nondet592#1; [2025-03-17 08:27:59,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7797: havoc tty_mode_ioctl_#t~nondet615#1; [2025-03-17 08:28:00,086 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7733: havoc #t~nondet600; [2025-03-17 08:28:00,153 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7790: havoc #t~nondet614; [2025-03-17 08:28:00,155 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7749: havoc #t~nondet604; [2025-03-17 08:28:00,161 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4927: havoc __kmalloc_#t~ret40#1.base, __kmalloc_#t~ret40#1.offset; [2025-03-17 08:28:00,285 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6953: call ULTIMATE.dealloc(sl_outfill_~#s~0#1.base, sl_outfill_~#s~0#1.offset);havoc sl_outfill_~#s~0#1.base, sl_outfill_~#s~0#1.offset; [2025-03-17 08:28:00,290 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5008: havoc #t~mem65.base, #t~mem65.offset; [2025-03-17 08:28:06,045 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7139: call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg11~0#1.base, main_~#ldvarg11~0#1.offset);havoc main_~#ldvarg11~0#1.base, main_~#ldvarg11~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset);havoc main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset);havoc main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset);havoc main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset);havoc main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset; [2025-03-17 08:28:06,045 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7768: havoc slhc_compress_#t~nondet609#1; [2025-03-17 08:28:06,045 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7801: havoc tty_register_ldisc_#t~nondet616#1; [2025-03-17 08:28:06,045 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7737: havoc msleep_interruptible_#t~nondet601#1; [2025-03-17 08:28:06,045 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7805: havoc tty_unregister_ldisc_#t~nondet617#1; [2025-03-17 08:28:06,045 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7774: havoc slhc_init_#t~ret610#1.base, slhc_init_#t~ret610#1.offset; [2025-03-17 08:28:06,045 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7478-1: ldv_sl_alloc_bufs_3_#res#1 := ldv_sl_alloc_bufs_3_~ldv_func_res~2#1; [2025-03-17 08:28:06,045 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7713: havoc dev_close_#t~nondet598#1; [2025-03-17 08:28:06,045 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5704: call ULTIMATE.dealloc(sl_encaps_~#p~3#1.base, sl_encaps_~#p~3#1.offset);havoc sl_encaps_~#p~3#1.base, sl_encaps_~#p~3#1.offset; [2025-03-17 08:28:06,046 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7753: havoc register_netdevice_#t~nondet605#1; [2025-03-17 08:28:06,046 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7491-1: ldv_register_netdevice_4_#res#1 := ldv_register_netdevice_4_~ldv_func_res~3#1; [2025-03-17 08:28:06,046 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7691: havoc alloc_netdev_mqs_#t~ret593#1.base, alloc_netdev_mqs_#t~ret593#1.offset; [2025-03-17 08:28:06,046 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7695: havoc capable_#t~nondet594#1; [2025-03-17 08:28:06,046 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6077: call ULTIMATE.dealloc(sl_alloc_~#name~0#1.base, sl_alloc_~#name~0#1.offset);havoc sl_alloc_~#name~0#1.base, sl_alloc_~#name~0#1.offset;call ULTIMATE.dealloc(sl_alloc_~#__key~0#1.base, sl_alloc_~#__key~0#1.offset);havoc sl_alloc_~#__key~0#1.base, sl_alloc_~#__key~0#1.offset; [2025-03-17 08:28:06,046 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6212: havoc slip_open_#t~mem340#1.base, slip_open_#t~mem340#1.offset;havoc slip_open_#t~mem341#1; [2025-03-17 08:28:06,057 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7745: havoc netpoll_trap_#t~nondet603#1; [2025-03-17 08:28:06,353 INFO L? ?]: Removed 1411 outVars from TransFormulas that were not future-live. [2025-03-17 08:28:06,353 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 08:28:06,403 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 08:28:06,404 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 08:28:06,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:28:06 BoogieIcfgContainer [2025-03-17 08:28:06,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 08:28:06,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 08:28:06,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 08:28:06,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 08:28:06,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 08:27:56" (1/3) ... [2025-03-17 08:28:06,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2f8ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:28:06, skipping insertion in model container [2025-03-17 08:28:06,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:27:57" (2/3) ... [2025-03-17 08:28:06,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2f8ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:28:06, skipping insertion in model container [2025-03-17 08:28:06,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:28:06" (3/3) ... [2025-03-17 08:28:06,413 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-03-17 08:28:06,446 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 08:28:06,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i that has 65 procedures, 1186 locations, 1 initial locations, 22 loop locations, and 1 error locations. [2025-03-17 08:28:06,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 08:28:06,522 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;@4178fd90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 08:28:06,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 08:28:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 1140 states, 821 states have (on average 1.4506699147381243) internal successors, (1191), 864 states have internal predecessors, (1191), 263 states have call successors, (263), 55 states have call predecessors, (263), 54 states have return successors, (258), 256 states have call predecessors, (258), 258 states have call successors, (258) [2025-03-17 08:28:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 08:28:06,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:06,548 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-03-17 08:28:06,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:06,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:06,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1874195607, now seen corresponding path program 1 times [2025-03-17 08:28:06,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:06,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938854601] [2025-03-17 08:28:06,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:06,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:07,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 08:28:07,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 08:28:07,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:07,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-17 08:28:07,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:07,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938854601] [2025-03-17 08:28:07,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938854601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:28:07,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519975563] [2025-03-17 08:28:07,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:07,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:28:07,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:28:07,589 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:28:07,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 08:28:08,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 08:28:08,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 08:28:08,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:08,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:08,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 08:28:08,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:28:08,361 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-17 08:28:08,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:28:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519975563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:08,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:28:08,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 08:28:08,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861207548] [2025-03-17 08:28:08,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:08,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 08:28:08,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:08,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 08:28:08,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 08:28:08,391 INFO L87 Difference]: Start difference. First operand has 1140 states, 821 states have (on average 1.4506699147381243) internal successors, (1191), 864 states have internal predecessors, (1191), 263 states have call successors, (263), 55 states have call predecessors, (263), 54 states have return successors, (258), 256 states have call predecessors, (258), 258 states have call successors, (258) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 08:28:08,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:08,547 INFO L93 Difference]: Finished difference Result 2278 states and 3447 transitions. [2025-03-17 08:28:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 08:28:08,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 152 [2025-03-17 08:28:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:08,569 INFO L225 Difference]: With dead ends: 2278 [2025-03-17 08:28:08,569 INFO L226 Difference]: Without dead ends: 1096 [2025-03-17 08:28:08,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 08:28:08,577 INFO L435 NwaCegarLoop]: 1694 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:08,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1694 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:28:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2025-03-17 08:28:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1096. [2025-03-17 08:28:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 792 states have (on average 1.4419191919191918) internal successors, (1142), 827 states have internal predecessors, (1142), 249 states have call successors, (249), 54 states have call predecessors, (249), 54 states have return successors, (249), 247 states have call predecessors, (249), 249 states have call successors, (249) [2025-03-17 08:28:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1640 transitions. [2025-03-17 08:28:08,670 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1640 transitions. Word has length 152 [2025-03-17 08:28:08,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:08,670 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1640 transitions. [2025-03-17 08:28:08,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 08:28:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1640 transitions. [2025-03-17 08:28:08,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 08:28:08,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:08,678 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-03-17 08:28:08,688 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-17 08:28:08,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 08:28:08,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:08,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:08,882 INFO L85 PathProgramCache]: Analyzing trace with hash -860035964, now seen corresponding path program 1 times [2025-03-17 08:28:08,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:08,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095188984] [2025-03-17 08:28:08,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:08,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:09,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 08:28:09,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 08:28:09,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:09,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-03-17 08:28:09,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:09,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095188984] [2025-03-17 08:28:09,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095188984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:09,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:28:09,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:28:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443568974] [2025-03-17 08:28:09,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:09,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:28:09,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:09,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:28:09,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:28:09,387 INFO L87 Difference]: Start difference. First operand 1096 states and 1640 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 08:28:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:09,600 INFO L93 Difference]: Finished difference Result 2745 states and 4070 transitions. [2025-03-17 08:28:09,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:28:09,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 152 [2025-03-17 08:28:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:09,613 INFO L225 Difference]: With dead ends: 2745 [2025-03-17 08:28:09,613 INFO L226 Difference]: Without dead ends: 1682 [2025-03-17 08:28:09,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:28:09,619 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 875 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 3181 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:09,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 3181 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:28:09,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2025-03-17 08:28:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1682. [2025-03-17 08:28:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1202 states have (on average 1.420965058236273) internal successors, (1708), 1253 states have internal predecessors, (1708), 384 states have call successors, (384), 95 states have call predecessors, (384), 95 states have return successors, (384), 381 states have call predecessors, (384), 384 states have call successors, (384) [2025-03-17 08:28:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2476 transitions. [2025-03-17 08:28:09,680 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2476 transitions. Word has length 152 [2025-03-17 08:28:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:09,681 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2476 transitions. [2025-03-17 08:28:09,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 08:28:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2476 transitions. [2025-03-17 08:28:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-17 08:28:09,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:09,686 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:28:09,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 08:28:09,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:09,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:09,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1020692050, now seen corresponding path program 1 times [2025-03-17 08:28:09,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:09,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821686] [2025-03-17 08:28:09,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:09,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-17 08:28:09,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-17 08:28:09,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:09,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:10,286 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2025-03-17 08:28:10,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:10,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821686] [2025-03-17 08:28:10,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:10,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:28:10,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:28:10,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337584263] [2025-03-17 08:28:10,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:10,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:28:10,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:10,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:28:10,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:28:10,290 INFO L87 Difference]: Start difference. First operand 1682 states and 2476 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-17 08:28:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:10,392 INFO L93 Difference]: Finished difference Result 3321 states and 4895 transitions. [2025-03-17 08:28:10,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:28:10,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 228 [2025-03-17 08:28:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:10,401 INFO L225 Difference]: With dead ends: 3321 [2025-03-17 08:28:10,402 INFO L226 Difference]: Without dead ends: 1682 [2025-03-17 08:28:10,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:28:10,408 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1602 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:10,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 1616 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:28:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2025-03-17 08:28:10,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1682. [2025-03-17 08:28:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1202 states have (on average 1.4193011647254576) internal successors, (1706), 1253 states have internal predecessors, (1706), 384 states have call successors, (384), 95 states have call predecessors, (384), 95 states have return successors, (384), 381 states have call predecessors, (384), 384 states have call successors, (384) [2025-03-17 08:28:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2474 transitions. [2025-03-17 08:28:10,482 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2474 transitions. Word has length 228 [2025-03-17 08:28:10,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:10,482 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2474 transitions. [2025-03-17 08:28:10,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-17 08:28:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2474 transitions. [2025-03-17 08:28:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-17 08:28:10,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:10,489 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:28:10,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 08:28:10,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:10,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:10,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2065033007, now seen corresponding path program 1 times [2025-03-17 08:28:10,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:10,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165596476] [2025-03-17 08:28:10,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:10,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:10,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-17 08:28:10,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-17 08:28:10,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:10,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2025-03-17 08:28:11,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:11,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165596476] [2025-03-17 08:28:11,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165596476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:11,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:28:11,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:28:11,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534188421] [2025-03-17 08:28:11,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:11,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:28:11,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:11,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:28:11,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:28:11,175 INFO L87 Difference]: Start difference. First operand 1682 states and 2474 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 08:28:11,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:11,308 INFO L93 Difference]: Finished difference Result 1686 states and 2478 transitions. [2025-03-17 08:28:11,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:28:11,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 228 [2025-03-17 08:28:11,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:11,321 INFO L225 Difference]: With dead ends: 1686 [2025-03-17 08:28:11,321 INFO L226 Difference]: Without dead ends: 1684 [2025-03-17 08:28:11,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:28:11,323 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 0 mSDsluCounter, 3237 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4859 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:11,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4859 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:28:11,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2025-03-17 08:28:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2025-03-17 08:28:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1204 states have (on average 1.4186046511627908) internal successors, (1708), 1255 states have internal predecessors, (1708), 384 states have call successors, (384), 95 states have call predecessors, (384), 95 states have return successors, (384), 381 states have call predecessors, (384), 384 states have call successors, (384) [2025-03-17 08:28:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2476 transitions. [2025-03-17 08:28:11,401 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2476 transitions. Word has length 228 [2025-03-17 08:28:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:11,402 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2476 transitions. [2025-03-17 08:28:11,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 08:28:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2476 transitions. [2025-03-17 08:28:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-17 08:28:11,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:11,411 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:28:11,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 08:28:11,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:11,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash -568903103, now seen corresponding path program 1 times [2025-03-17 08:28:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:11,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700533904] [2025-03-17 08:28:11,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:11,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:11,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-17 08:28:11,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-17 08:28:11,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:11,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2025-03-17 08:28:12,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:12,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700533904] [2025-03-17 08:28:12,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700533904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:12,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:28:12,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:28:12,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953442716] [2025-03-17 08:28:12,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:12,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:28:12,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:12,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:28:12,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:28:12,240 INFO L87 Difference]: Start difference. First operand 1684 states and 2476 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-17 08:28:16,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:28:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:17,324 INFO L93 Difference]: Finished difference Result 3336 states and 4912 transitions. [2025-03-17 08:28:17,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:28:17,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 237 [2025-03-17 08:28:17,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:17,334 INFO L225 Difference]: With dead ends: 3336 [2025-03-17 08:28:17,334 INFO L226 Difference]: Without dead ends: 1695 [2025-03-17 08:28:17,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:28:17,341 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 1596 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:17,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 2726 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 550 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-17 08:28:17,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-03-17 08:28:17,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1685. [2025-03-17 08:28:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 1205 states have (on average 1.4182572614107885) internal successors, (1709), 1256 states have internal predecessors, (1709), 384 states have call successors, (384), 95 states have call predecessors, (384), 95 states have return successors, (384), 381 states have call predecessors, (384), 384 states have call successors, (384) [2025-03-17 08:28:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2477 transitions. [2025-03-17 08:28:17,396 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2477 transitions. Word has length 237 [2025-03-17 08:28:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:17,397 INFO L471 AbstractCegarLoop]: Abstraction has 1685 states and 2477 transitions. [2025-03-17 08:28:17,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-17 08:28:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2477 transitions. [2025-03-17 08:28:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-17 08:28:17,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:17,403 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:28:17,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 08:28:17,403 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:17,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1777310082, now seen corresponding path program 1 times [2025-03-17 08:28:17,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:17,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244676173] [2025-03-17 08:28:17,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:17,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:17,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-17 08:28:17,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-17 08:28:17,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:17,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2025-03-17 08:28:18,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:18,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244676173] [2025-03-17 08:28:18,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244676173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:18,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:28:18,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 08:28:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545123945] [2025-03-17 08:28:18,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:18,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 08:28:18,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:18,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 08:28:18,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:28:18,023 INFO L87 Difference]: Start difference. First operand 1685 states and 2477 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 08:28:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:18,143 INFO L93 Difference]: Finished difference Result 1702 states and 2500 transitions. [2025-03-17 08:28:18,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 08:28:18,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 239 [2025-03-17 08:28:18,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:18,152 INFO L225 Difference]: With dead ends: 1702 [2025-03-17 08:28:18,152 INFO L226 Difference]: Without dead ends: 1700 [2025-03-17 08:28:18,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:28:18,155 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 115 mSDsluCounter, 4714 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 6338 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:18,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 6338 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:28:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2025-03-17 08:28:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1687. [2025-03-17 08:28:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1206 states have (on average 1.4179104477611941) internal successors, (1710), 1256 states have internal predecessors, (1710), 385 states have call successors, (385), 95 states have call predecessors, (385), 95 states have return successors, (385), 382 states have call predecessors, (385), 385 states have call successors, (385) [2025-03-17 08:28:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2480 transitions. [2025-03-17 08:28:18,240 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2480 transitions. Word has length 239 [2025-03-17 08:28:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:18,242 INFO L471 AbstractCegarLoop]: Abstraction has 1687 states and 2480 transitions. [2025-03-17 08:28:18,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 08:28:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2480 transitions. [2025-03-17 08:28:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-17 08:28:18,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:18,250 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:28:18,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 08:28:18,250 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:18,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:18,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1695141398, now seen corresponding path program 1 times [2025-03-17 08:28:18,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:18,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112400815] [2025-03-17 08:28:18,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:18,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:18,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-17 08:28:18,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-17 08:28:18,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:18,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-17 08:28:18,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:18,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112400815] [2025-03-17 08:28:18,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112400815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:18,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:28:18,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:28:18,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300552588] [2025-03-17 08:28:18,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:18,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:28:18,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:18,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:28:18,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:28:18,700 INFO L87 Difference]: Start difference. First operand 1687 states and 2480 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-17 08:28:22,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:28:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:22,956 INFO L93 Difference]: Finished difference Result 4935 states and 7262 transitions. [2025-03-17 08:28:22,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:28:22,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 271 [2025-03-17 08:28:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:22,977 INFO L225 Difference]: With dead ends: 4935 [2025-03-17 08:28:22,977 INFO L226 Difference]: Without dead ends: 3291 [2025-03-17 08:28:22,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:28:22,986 INFO L435 NwaCegarLoop]: 2416 mSDtfsCounter, 1552 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 3988 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:22,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 3988 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 08:28:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3291 states. [2025-03-17 08:28:23,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3291 to 3287. [2025-03-17 08:28:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 2357 states have (on average 1.4217225286380992) internal successors, (3351), 2457 states have internal predecessors, (3351), 742 states have call successors, (742), 187 states have call predecessors, (742), 187 states have return successors, (742), 734 states have call predecessors, (742), 742 states have call successors, (742) [2025-03-17 08:28:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 4835 transitions. [2025-03-17 08:28:23,136 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 4835 transitions. Word has length 271 [2025-03-17 08:28:23,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:23,137 INFO L471 AbstractCegarLoop]: Abstraction has 3287 states and 4835 transitions. [2025-03-17 08:28:23,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-17 08:28:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 4835 transitions. [2025-03-17 08:28:23,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 08:28:23,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:23,152 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:28:23,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 08:28:23,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:23,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:23,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1761424790, now seen corresponding path program 1 times [2025-03-17 08:28:23,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:23,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286866285] [2025-03-17 08:28:23,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:23,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:23,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 08:28:23,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 08:28:23,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:23,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-03-17 08:28:23,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:23,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286866285] [2025-03-17 08:28:23,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286866285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:23,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:28:23,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:28:23,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981543634] [2025-03-17 08:28:23,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:23,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:28:23,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:23,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:28:23,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:28:23,726 INFO L87 Difference]: Start difference. First operand 3287 states and 4835 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 08:28:27,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:28:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:27,986 INFO L93 Difference]: Finished difference Result 5501 states and 8069 transitions. [2025-03-17 08:28:27,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:28:27,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 273 [2025-03-17 08:28:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:28,004 INFO L225 Difference]: With dead ends: 5501 [2025-03-17 08:28:28,004 INFO L226 Difference]: Without dead ends: 2246 [2025-03-17 08:28:28,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:28:28,019 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 0 mSDsluCounter, 3237 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4860 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:28,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4860 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 08:28:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2025-03-17 08:28:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2025-03-17 08:28:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 1598 states have (on average 1.4086357947434294) internal successors, (2251), 1664 states have internal predecessors, (2251), 513 states have call successors, (513), 134 states have call predecessors, (513), 134 states have return successors, (513), 508 states have call predecessors, (513), 513 states have call successors, (513) [2025-03-17 08:28:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3277 transitions. [2025-03-17 08:28:28,132 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3277 transitions. Word has length 273 [2025-03-17 08:28:28,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:28,132 INFO L471 AbstractCegarLoop]: Abstraction has 2246 states and 3277 transitions. [2025-03-17 08:28:28,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 08:28:28,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3277 transitions. [2025-03-17 08:28:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 08:28:28,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:28,147 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:28:28,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 08:28:28,147 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:28,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:28,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1290859096, now seen corresponding path program 1 times [2025-03-17 08:28:28,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:28,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149233977] [2025-03-17 08:28:28,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:28,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:28,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 08:28:28,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 08:28:28,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:28,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2025-03-17 08:28:28,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149233977] [2025-03-17 08:28:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149233977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:28,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:28:28,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:28:28,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011008249] [2025-03-17 08:28:28,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:28,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:28:28,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:28,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:28:28,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:28:28,689 INFO L87 Difference]: Start difference. First operand 2246 states and 3277 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-17 08:28:32,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:28:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:33,674 INFO L93 Difference]: Finished difference Result 3909 states and 5728 transitions. [2025-03-17 08:28:33,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:28:33,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 273 [2025-03-17 08:28:33,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:33,689 INFO L225 Difference]: With dead ends: 3909 [2025-03-17 08:28:33,690 INFO L226 Difference]: Without dead ends: 2269 [2025-03-17 08:28:33,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:28:33,697 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 1577 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:33,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 2713 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 563 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-03-17 08:28:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2025-03-17 08:28:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 2250. [2025-03-17 08:28:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 1602 states have (on average 1.408239700374532) internal successors, (2256), 1668 states have internal predecessors, (2256), 513 states have call successors, (513), 134 states have call predecessors, (513), 134 states have return successors, (513), 508 states have call predecessors, (513), 513 states have call successors, (513) [2025-03-17 08:28:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3282 transitions. [2025-03-17 08:28:33,800 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3282 transitions. Word has length 273 [2025-03-17 08:28:33,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:33,803 INFO L471 AbstractCegarLoop]: Abstraction has 2250 states and 3282 transitions. [2025-03-17 08:28:33,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-17 08:28:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3282 transitions. [2025-03-17 08:28:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-17 08:28:33,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:33,815 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:28:33,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 08:28:33,815 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:33,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:33,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1155978366, now seen corresponding path program 1 times [2025-03-17 08:28:33,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:33,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559537332] [2025-03-17 08:28:33,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:33,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:34,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-17 08:28:34,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-17 08:28:34,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:34,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2025-03-17 08:28:34,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:34,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559537332] [2025-03-17 08:28:34,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559537332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:28:34,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:28:34,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:28:34,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53302104] [2025-03-17 08:28:34,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:28:34,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:28:34,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:34,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:28:34,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:28:34,529 INFO L87 Difference]: Start difference. First operand 2250 states and 3282 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 08:28:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:28:34,778 INFO L93 Difference]: Finished difference Result 4457 states and 6539 transitions. [2025-03-17 08:28:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:28:34,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 276 [2025-03-17 08:28:34,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:28:34,800 INFO L225 Difference]: With dead ends: 4457 [2025-03-17 08:28:34,801 INFO L226 Difference]: Without dead ends: 2250 [2025-03-17 08:28:34,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:28:34,809 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 0 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3220 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 08:28:34,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3220 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 08:28:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2025-03-17 08:28:34,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2250. [2025-03-17 08:28:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 1602 states have (on average 1.402621722846442) internal successors, (2247), 1668 states have internal predecessors, (2247), 513 states have call successors, (513), 134 states have call predecessors, (513), 134 states have return successors, (513), 508 states have call predecessors, (513), 513 states have call successors, (513) [2025-03-17 08:28:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3273 transitions. [2025-03-17 08:28:34,936 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3273 transitions. Word has length 276 [2025-03-17 08:28:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:28:34,936 INFO L471 AbstractCegarLoop]: Abstraction has 2250 states and 3273 transitions. [2025-03-17 08:28:34,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 08:28:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3273 transitions. [2025-03-17 08:28:34,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-17 08:28:34,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:28:34,948 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:28:34,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 08:28:34,948 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:28:34,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:28:34,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1078087704, now seen corresponding path program 1 times [2025-03-17 08:28:34,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:28:34,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301077121] [2025-03-17 08:28:34,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:34,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:28:35,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-17 08:28:35,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-17 08:28:35,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:35,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2025-03-17 08:28:35,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:28:35,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301077121] [2025-03-17 08:28:35,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301077121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:28:35,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414156851] [2025-03-17 08:28:35,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:28:35,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:28:35,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:28:35,524 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:28:35,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 08:28:36,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-17 08:28:36,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-17 08:28:36,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:28:36,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:28:36,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 2101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 08:28:36,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:28:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2025-03-17 08:28:37,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 08:28:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2025-03-17 08:28:37,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414156851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 08:28:37,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 08:28:37,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2025-03-17 08:28:37,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093811607] [2025-03-17 08:28:37,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 08:28:37,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 08:28:37,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:28:37,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 08:28:37,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 08:28:37,545 INFO L87 Difference]: Start difference. First operand 2250 states and 3273 transitions. Second operand has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 4 states have call successors, (77), 3 states have call predecessors, (77), 3 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) [2025-03-17 08:28:41,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:28:45,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:28:49,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:28:53,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:28:57,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:29:01,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:29:02,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:29:02,760 INFO L93 Difference]: Finished difference Result 3962 states and 5795 transitions. [2025-03-17 08:29:02,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 08:29:02,761 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 4 states have call successors, (77), 3 states have call predecessors, (77), 3 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) Word has length 279 [2025-03-17 08:29:02,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:29:02,775 INFO L225 Difference]: With dead ends: 3962 [2025-03-17 08:29:02,775 INFO L226 Difference]: Without dead ends: 2318 [2025-03-17 08:29:02,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-17 08:29:02,782 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 1654 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 43 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 3873 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:29:02,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1666 Valid, 3873 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1155 Invalid, 6 Unknown, 0 Unchecked, 25.1s Time] [2025-03-17 08:29:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-03-17 08:29:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2257. [2025-03-17 08:29:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 1609 states have (on average 1.4021131137352392) internal successors, (2256), 1675 states have internal predecessors, (2256), 513 states have call successors, (513), 134 states have call predecessors, (513), 134 states have return successors, (513), 508 states have call predecessors, (513), 513 states have call successors, (513) [2025-03-17 08:29:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3282 transitions. [2025-03-17 08:29:02,871 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3282 transitions. Word has length 279 [2025-03-17 08:29:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:29:02,872 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3282 transitions. [2025-03-17 08:29:02,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 4 states have call successors, (77), 3 states have call predecessors, (77), 3 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) [2025-03-17 08:29:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3282 transitions. [2025-03-17 08:29:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-17 08:29:02,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:29:02,883 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:29:02,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 08:29:03,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 08:29:03,113 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:29:03,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:29:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1083222760, now seen corresponding path program 1 times [2025-03-17 08:29:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:29:03,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200530659] [2025-03-17 08:29:03,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:29:03,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:29:03,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-17 08:29:03,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-17 08:29:03,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:29:03,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:29:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2025-03-17 08:29:04,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:29:04,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200530659] [2025-03-17 08:29:04,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200530659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:29:04,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128517976] [2025-03-17 08:29:04,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:29:04,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:29:04,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:29:04,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:29:04,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 08:29:05,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-17 08:29:05,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-17 08:29:05,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:29:05,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:29:05,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 2163 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 08:29:05,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:29:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2025-03-17 08:29:05,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:29:05,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128517976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:29:05,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:29:05,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-17 08:29:05,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499085269] [2025-03-17 08:29:05,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:29:05,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:29:05,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:29:05,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:29:05,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 08:29:05,660 INFO L87 Difference]: Start difference. First operand 2257 states and 3282 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 08:29:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:29:05,759 INFO L93 Difference]: Finished difference Result 3925 states and 5722 transitions. [2025-03-17 08:29:05,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:29:05,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 289 [2025-03-17 08:29:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:29:05,774 INFO L225 Difference]: With dead ends: 3925 [2025-03-17 08:29:05,774 INFO L226 Difference]: Without dead ends: 2257 [2025-03-17 08:29:05,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 08:29:05,780 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 2 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3225 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:29:05,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3225 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:29:05,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-03-17 08:29:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2025-03-17 08:29:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 1609 states have (on average 1.4002486016159106) internal successors, (2253), 1675 states have internal predecessors, (2253), 513 states have call successors, (513), 134 states have call predecessors, (513), 134 states have return successors, (513), 508 states have call predecessors, (513), 513 states have call successors, (513) [2025-03-17 08:29:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3279 transitions. [2025-03-17 08:29:05,867 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3279 transitions. Word has length 289 [2025-03-17 08:29:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:29:05,867 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3279 transitions. [2025-03-17 08:29:05,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 08:29:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3279 transitions. [2025-03-17 08:29:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-17 08:29:05,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:29:05,878 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:29:05,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 08:29:06,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:29:06,079 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:29:06,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:29:06,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1750164947, now seen corresponding path program 1 times [2025-03-17 08:29:06,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:29:06,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673464819] [2025-03-17 08:29:06,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:29:06,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:29:06,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-17 08:29:06,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-17 08:29:06,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:29:06,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:29:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2025-03-17 08:29:07,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:29:07,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673464819] [2025-03-17 08:29:07,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673464819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:29:07,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112770882] [2025-03-17 08:29:07,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:29:07,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:29:07,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:29:07,182 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:29:07,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 08:29:08,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-17 08:29:08,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-17 08:29:08,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:29:08,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:29:08,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 2166 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 08:29:08,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:29:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2025-03-17 08:29:08,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:29:08,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112770882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:29:08,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:29:08,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-03-17 08:29:08,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770873250] [2025-03-17 08:29:08,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:29:08,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:29:08,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:29:08,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:29:08,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 08:29:08,584 INFO L87 Difference]: Start difference. First operand 2257 states and 3279 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 08:29:08,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:29:08,973 INFO L93 Difference]: Finished difference Result 3910 states and 5702 transitions. [2025-03-17 08:29:08,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:29:08,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 291 [2025-03-17 08:29:08,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:29:08,989 INFO L225 Difference]: With dead ends: 3910 [2025-03-17 08:29:08,989 INFO L226 Difference]: Without dead ends: 2259 [2025-03-17 08:29:08,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 291 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-17 08:29:08,994 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 0 mSDsluCounter, 3207 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4820 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 08:29:08,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4820 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 08:29:08,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2025-03-17 08:29:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 2259. [2025-03-17 08:29:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2259 states, 1611 states have (on average 1.3997517070142769) internal successors, (2255), 1677 states have internal predecessors, (2255), 513 states have call successors, (513), 134 states have call predecessors, (513), 134 states have return successors, (513), 508 states have call predecessors, (513), 513 states have call successors, (513) [2025-03-17 08:29:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 3281 transitions. [2025-03-17 08:29:09,092 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 3281 transitions. Word has length 291 [2025-03-17 08:29:09,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:29:09,093 INFO L471 AbstractCegarLoop]: Abstraction has 2259 states and 3281 transitions. [2025-03-17 08:29:09,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 08:29:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3281 transitions. [2025-03-17 08:29:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-17 08:29:09,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:29:09,104 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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, 1, 1, 1] [2025-03-17 08:29:09,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 08:29:09,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:29:09,308 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:29:09,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:29:09,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1182402901, now seen corresponding path program 1 times [2025-03-17 08:29:09,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:29:09,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393218901] [2025-03-17 08:29:09,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:29:09,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:29:09,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-17 08:29:09,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-17 08:29:09,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:29:09,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:29:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2025-03-17 08:29:09,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:29:09,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393218901] [2025-03-17 08:29:09,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393218901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:29:09,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:29:09,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:29:09,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44304418] [2025-03-17 08:29:09,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:29:09,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:29:09,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:29:09,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:29:09,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:29:09,837 INFO L87 Difference]: Start difference. First operand 2259 states and 3281 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 08:29:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:29:09,956 INFO L93 Difference]: Finished difference Result 3914 states and 5707 transitions. [2025-03-17 08:29:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:29:09,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 297 [2025-03-17 08:29:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:29:09,975 INFO L225 Difference]: With dead ends: 3914 [2025-03-17 08:29:09,975 INFO L226 Difference]: Without dead ends: 2261 [2025-03-17 08:29:09,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:29:09,981 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 2 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3212 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:29:09,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3212 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:29:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2025-03-17 08:29:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2025-03-17 08:29:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 1613 states have (on average 1.3992560446373217) internal successors, (2257), 1679 states have internal predecessors, (2257), 513 states have call successors, (513), 134 states have call predecessors, (513), 134 states have return successors, (513), 508 states have call predecessors, (513), 513 states have call successors, (513) [2025-03-17 08:29:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3283 transitions. [2025-03-17 08:29:10,087 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3283 transitions. Word has length 297 [2025-03-17 08:29:10,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:29:10,087 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 3283 transitions. [2025-03-17 08:29:10,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 08:29:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3283 transitions. [2025-03-17 08:29:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-17 08:29:10,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:29:10,095 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:29:10,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 08:29:10,096 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:29:10,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:29:10,096 INFO L85 PathProgramCache]: Analyzing trace with hash -244310670, now seen corresponding path program 1 times [2025-03-17 08:29:10,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:29:10,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29266551] [2025-03-17 08:29:10,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:29:10,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:29:10,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-17 08:29:10,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-17 08:29:10,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:29:10,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:29:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-03-17 08:29:11,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:29:11,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29266551] [2025-03-17 08:29:11,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29266551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:29:11,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081366027] [2025-03-17 08:29:11,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:29:11,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:29:11,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:29:11,212 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:29:11,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 08:29:12,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-17 08:29:12,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-17 08:29:12,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:29:12,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:29:12,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 2358 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 08:29:12,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:29:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-17 08:29:12,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:29:12,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081366027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:29:12,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:29:12,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 8 [2025-03-17 08:29:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270469254] [2025-03-17 08:29:12,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:29:12,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 08:29:12,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:29:12,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 08:29:12,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 08:29:12,367 INFO L87 Difference]: Start difference. First operand 2261 states and 3283 transitions. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 6 states have internal predecessors, (143), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 08:29:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:29:12,674 INFO L93 Difference]: Finished difference Result 3940 states and 5748 transitions. [2025-03-17 08:29:12,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 08:29:12,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 6 states have internal predecessors, (143), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) Word has length 306 [2025-03-17 08:29:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:29:12,689 INFO L225 Difference]: With dead ends: 3940 [2025-03-17 08:29:12,689 INFO L226 Difference]: Without dead ends: 2280 [2025-03-17 08:29:12,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 08:29:12,697 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 862 mSDsluCounter, 9728 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 11363 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:29:12,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 11363 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:29:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2025-03-17 08:29:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2279. [2025-03-17 08:29:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 1625 states have (on average 1.3963076923076922) internal successors, (2269), 1694 states have internal predecessors, (2269), 513 states have call successors, (513), 134 states have call predecessors, (513), 140 states have return successors, (533), 511 states have call predecessors, (533), 513 states have call successors, (533) [2025-03-17 08:29:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3315 transitions. [2025-03-17 08:29:12,962 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3315 transitions. Word has length 306 [2025-03-17 08:29:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:29:12,970 INFO L471 AbstractCegarLoop]: Abstraction has 2279 states and 3315 transitions. [2025-03-17 08:29:12,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 6 states have internal predecessors, (143), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 08:29:12,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3315 transitions. [2025-03-17 08:29:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-17 08:29:12,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:29:12,980 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:29:12,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 08:29:13,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 08:29:13,181 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:29:13,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:29:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1580837077, now seen corresponding path program 1 times [2025-03-17 08:29:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:29:13,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008233586] [2025-03-17 08:29:13,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:29:13,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:29:13,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-17 08:29:13,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-17 08:29:13,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:29:13,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:29:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2025-03-17 08:29:13,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:29:13,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008233586] [2025-03-17 08:29:13,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008233586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:29:13,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:29:13,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:29:13,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984989494] [2025-03-17 08:29:13,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:29:13,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:29:13,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:29:13,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:29:13,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:29:13,961 INFO L87 Difference]: Start difference. First operand 2279 states and 3315 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (33), 1 states have call predecessors, (33), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-17 08:29:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:29:14,114 INFO L93 Difference]: Finished difference Result 3950 states and 5766 transitions. [2025-03-17 08:29:14,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:29:14,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (33), 1 states have call predecessors, (33), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 312 [2025-03-17 08:29:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:29:14,125 INFO L225 Difference]: With dead ends: 3950 [2025-03-17 08:29:14,125 INFO L226 Difference]: Without dead ends: 2283 [2025-03-17 08:29:14,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:29:14,132 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 2 mSDsluCounter, 6434 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8047 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:29:14,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8047 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:29:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2025-03-17 08:29:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2282. [2025-03-17 08:29:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 1628 states have (on average 1.3955773955773956) internal successors, (2272), 1696 states have internal predecessors, (2272), 513 states have call successors, (513), 134 states have call predecessors, (513), 140 states have return successors, (533), 512 states have call predecessors, (533), 513 states have call successors, (533) [2025-03-17 08:29:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 3318 transitions. [2025-03-17 08:29:14,209 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 3318 transitions. Word has length 312 [2025-03-17 08:29:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:29:14,210 INFO L471 AbstractCegarLoop]: Abstraction has 2282 states and 3318 transitions. [2025-03-17 08:29:14,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (33), 1 states have call predecessors, (33), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-17 08:29:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 3318 transitions. [2025-03-17 08:29:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-17 08:29:14,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:29:14,219 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:29:14,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 08:29:14,220 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:29:14,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:29:14,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1983110994, now seen corresponding path program 2 times [2025-03-17 08:29:14,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:29:14,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508065545] [2025-03-17 08:29:14,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 08:29:14,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:29:14,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 318 statements into 2 equivalence classes. [2025-03-17 08:29:15,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 318 of 318 statements. [2025-03-17 08:29:15,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 08:29:15,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:29:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-17 08:29:15,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:29:15,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508065545] [2025-03-17 08:29:15,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508065545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:29:15,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348234799] [2025-03-17 08:29:15,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 08:29:15,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:29:15,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:29:15,603 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:29:15,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 08:29:16,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 318 statements into 2 equivalence classes.