./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.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 ff1d21af29f4ede949edccf5cde5ead8be8c34f2f05a7b1635759c90f0d05416 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:50:49,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:50:49,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 18:50:49,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:50:49,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:50:49,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:50:49,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:50:49,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:50:49,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:50:49,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:50:49,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:50:49,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:50:49,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:50:49,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:50:49,164 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:50:49,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:50:49,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:50:49,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:50:49,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:50:49,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:50:49,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:50:49,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:50:49,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:50:49,165 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:50:49,165 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:50:49,165 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:50:49,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:50:49,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:50:49,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:50:49,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:50:49,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:50:49,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:50:49,166 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:50:49,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:50:49,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:50:49,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:50:49,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:50:49,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:50:49,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:50:49,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:50:49,167 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 -> ff1d21af29f4ede949edccf5cde5ead8be8c34f2f05a7b1635759c90f0d05416 [2025-03-08 18:50:49,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:50:49,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:50:49,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:50:49,405 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:50:49,405 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:50:49,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2025-03-08 18:50:50,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d032d295/a53b2e1e7b0d4f16ab6b265fc3f865b4/FLAG44b9dbb98 [2025-03-08 18:50:51,078 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:50:51,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2025-03-08 18:50:51,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d032d295/a53b2e1e7b0d4f16ab6b265fc3f865b4/FLAG44b9dbb98 [2025-03-08 18:50:51,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d032d295/a53b2e1e7b0d4f16ab6b265fc3f865b4 [2025-03-08 18:50:51,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:50:51,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:50:51,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:50:51,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:50:51,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:50:51,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:50:51" (1/1) ... [2025-03-08 18:50:51,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a68254f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:51, skipping insertion in model container [2025-03-08 18:50:51,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:50:51" (1/1) ... [2025-03-08 18:50:51,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:50:52,385 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2025-03-08 18:50:52,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:50:52,430 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:50:52,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4703] [2025-03-08 18:50:52,531 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4710] [2025-03-08 18:50:52,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4718-4719] [2025-03-08 18:50:52,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4727-4728] [2025-03-08 18:50:52,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4750] [2025-03-08 18:50:52,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4753] [2025-03-08 18:50:52,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4756] [2025-03-08 18:50:52,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4759] [2025-03-08 18:50:52,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5123] [2025-03-08 18:50:52,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5127] [2025-03-08 18:50:52,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5131] [2025-03-08 18:50:52,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5135] [2025-03-08 18:50:52,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5146] [2025-03-08 18:50:52,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5150] [2025-03-08 18:50:52,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5154] [2025-03-08 18:50:52,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5158] [2025-03-08 18:50:52,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5169] [2025-03-08 18:50:52,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5173] [2025-03-08 18:50:52,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5177] [2025-03-08 18:50:52,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5181] [2025-03-08 18:50:52,550 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5192] [2025-03-08 18:50:52,551 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5196] [2025-03-08 18:50:52,551 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5200] [2025-03-08 18:50:52,551 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5204] [2025-03-08 18:50:52,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5254] [2025-03-08 18:50:52,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5258] [2025-03-08 18:50:52,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5262] [2025-03-08 18:50:52,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5266] [2025-03-08 18:50:52,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5277] [2025-03-08 18:50:52,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5281] [2025-03-08 18:50:52,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5285] [2025-03-08 18:50:52,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5289] [2025-03-08 18:50:52,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5300] [2025-03-08 18:50:52,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5304] [2025-03-08 18:50:52,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5308] [2025-03-08 18:50:52,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5312] [2025-03-08 18:50:52,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5323] [2025-03-08 18:50:52,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5327] [2025-03-08 18:50:52,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5331] [2025-03-08 18:50:52,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5335] [2025-03-08 18:50:52,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5409] [2025-03-08 18:50:52,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5413] [2025-03-08 18:50:52,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5417] [2025-03-08 18:50:52,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5421] [2025-03-08 18:50:52,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5432] [2025-03-08 18:50:52,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5436] [2025-03-08 18:50:52,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5440] [2025-03-08 18:50:52,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5444] [2025-03-08 18:50:52,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5455] [2025-03-08 18:50:52,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5459] [2025-03-08 18:50:52,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5463] [2025-03-08 18:50:52,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5467] [2025-03-08 18:50:52,600 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6408] [2025-03-08 18:50:52,600 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6411] [2025-03-08 18:50:52,600 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6414] [2025-03-08 18:50:52,600 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6417] [2025-03-08 18:50:52,600 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6420] [2025-03-08 18:50:52,601 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6433] [2025-03-08 18:50:52,601 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6436] [2025-03-08 18:50:52,601 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6439] [2025-03-08 18:50:52,601 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6442] [2025-03-08 18:50:52,601 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6445] [2025-03-08 18:50:52,602 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6467] [2025-03-08 18:50:52,602 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6470] [2025-03-08 18:50:52,603 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6473] [2025-03-08 18:50:52,603 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6476] [2025-03-08 18:50:52,603 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6479] [2025-03-08 18:50:52,604 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6512-6513] [2025-03-08 18:50:52,604 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6516-6517] [2025-03-08 18:50:52,604 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6520-6521] [2025-03-08 18:50:52,604 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6524-6525] [2025-03-08 18:50:52,605 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6528-6529] [2025-03-08 18:50:52,605 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6542] [2025-03-08 18:50:52,605 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6545] [2025-03-08 18:50:52,605 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6548] [2025-03-08 18:50:52,605 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6551] [2025-03-08 18:50:52,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6554] [2025-03-08 18:50:52,607 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6587-6588] [2025-03-08 18:50:52,607 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6591-6592] [2025-03-08 18:50:52,607 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6595-6596] [2025-03-08 18:50:52,607 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6599-6600] [2025-03-08 18:50:52,607 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6603-6604] [2025-03-08 18:50:52,621 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2025-03-08 18:50:52,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:50:52,706 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:50:52,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:52 WrapperNode [2025-03-08 18:50:52,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:50:52,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:50:52,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:50:52,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:50:52,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:52" (1/1) ... [2025-03-08 18:50:52,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:52" (1/1) ... [2025-03-08 18:50:52,812 INFO L138 Inliner]: procedures = 156, calls = 823, calls flagged for inlining = 81, calls inlined = 80, statements flattened = 3012 [2025-03-08 18:50:52,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:50:52,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:50:52,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:50:52,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:50:52,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:52" (1/1) ... [2025-03-08 18:50:52,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:52" (1/1) ... [2025-03-08 18:50:52,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:52" (1/1) ... [2025-03-08 18:50:53,070 INFO L175 MemorySlicer]: Split 420 memory accesses to 11 slices as follows [2, 336, 12, 1, 3, 36, 1, 4, 2, 22, 1]. 80 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0]. The 177 writes are split as follows [0, 105, 12, 0, 0, 36, 1, 1, 0, 22, 0]. [2025-03-08 18:50:53,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:52" (1/1) ... [2025-03-08 18:50:53,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:52" (1/1) ... [2025-03-08 18:50:53,145 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:52" (1/1) ... [2025-03-08 18:50:53,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:52" (1/1) ... [2025-03-08 18:50:53,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:52" (1/1) ... [2025-03-08 18:50:53,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:52" (1/1) ... [2025-03-08 18:50:53,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:50:53,194 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:50:53,194 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:50:53,194 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:50:53,195 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:52" (1/1) ... [2025-03-08 18:50:53,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:50:53,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:50:53,225 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-08 18:50:53,228 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-08 18:50:53,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 18:50:53,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 18:50:53,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 18:50:53,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 18:50:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 18:50:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 18:50:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 18:50:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2025-03-08 18:50:53,251 INFO L138 BoogieDeclarations]: Found implementation of procedure __xchg_wrong_size [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 18:50:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-08 18:50:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-03-08 18:50:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-03-08 18:50:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 18:50:53,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 18:50:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-08 18:50:53,253 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-08 18:50:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2025-03-08 18:50:53,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2025-03-08 18:50:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2025-03-08 18:50:53,255 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 18:50:53,256 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2025-03-08 18:50:53,256 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2025-03-08 18:50:53,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2025-03-08 18:50:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2025-03-08 18:50:53,257 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-08 18:50:53,257 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 18:50:53,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-03-08 18:50:53,257 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-03-08 18:50:53,257 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2025-03-08 18:50:53,257 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2025-03-08 18:50:53,257 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-03-08 18:50:53,257 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2025-03-08 18:50:53,257 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2025-03-08 18:50:53,257 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 18:50:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-03-08 18:50:53,257 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-03-08 18:50:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-03-08 18:50:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-03-08 18:50:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2025-03-08 18:50:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2025-03-08 18:50:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2025-03-08 18:50:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2025-03-08 18:50:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2025-03-08 18:50:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2025-03-08 18:50:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:50:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2025-03-08 18:50:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2025-03-08 18:50:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2025-03-08 18:50:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2025-03-08 18:50:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2025-03-08 18:50:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2025-03-08 18:50:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-08 18:50:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-08 18:50:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 18:50:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 18:50:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-08 18:50:53,261 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-08 18:50:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-08 18:50:53,261 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-08 18:50:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-08 18:50:53,261 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-08 18:50:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-03-08 18:50:53,261 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-03-08 18:50:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-08 18:50:53,261 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-08 18:50:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-08 18:50:53,261 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-08 18:50:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 18:50:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-03-08 18:50:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2025-03-08 18:50:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2025-03-08 18:50:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-03-08 18:50:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:50:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2025-03-08 18:50:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2025-03-08 18:50:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-03-08 18:50:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-03-08 18:50:53,674 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:50:53,676 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:50:53,793 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7183: havoc #t~nondet528; [2025-03-08 18:50:53,832 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4847: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-08 18:50:53,854 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4735: havoc #t~mem2;havoc #t~bitwise3; [2025-03-08 18:50:53,860 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop_returnLabel#1: assume { :end_inline_ldv_stop } true; [2025-03-08 18:50:53,945 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7186: havoc #t~ret529.base, #t~ret529.offset; [2025-03-08 18:50:54,009 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7179: havoc #t~nondet527; [2025-03-08 18:50:54,288 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7268: havoc slhc_uncompress_#t~nondet544#1; [2025-03-08 18:50:54,288 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7264: havoc slhc_remember_#t~nondet543#1; [2025-03-08 18:50:54,288 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7227: havoc netif_rx_#t~nondet534#1; [2025-03-08 18:50:54,506 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7150: havoc _copy_to_user_#t~nondet524#1; [2025-03-08 18:50:54,506 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7283: havoc tty_mode_ioctl_#t~nondet547#1; [2025-03-08 18:50:54,669 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7219: havoc #t~nondet532; [2025-03-08 18:50:54,753 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7276: havoc #t~nondet546; [2025-03-08 18:50:54,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7235: havoc #t~nondet536; [2025-03-08 18:50:54,766 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4857: havoc __kmalloc_#t~ret46#1.base, __kmalloc_#t~ret46#1.offset; [2025-03-08 18:50:54,774 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4897: havoc #t~mem56.base, #t~mem56.offset; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7172: havoc capable_#t~nondet526#1; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7239: havoc register_netdevice_#t~nondet537#1; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6843: 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-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7112-1: ldv_register_netdevice_2_#res#1 := ldv_register_netdevice_2_~ldv_func_res~1#1; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5593: call ULTIMATE.dealloc(sl_encaps_~#p~0#1.base, sl_encaps_~#p~0#1.offset);havoc sl_encaps_~#p~0#1.base, sl_encaps_~#p~0#1.offset; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6917: call ULTIMATE.dealloc(main_~#var_group3~0#1.base, main_~#var_group3~0#1.offset);havoc main_~#var_group3~0#1.base, main_~#var_group3~0#1.offset;call ULTIMATE.dealloc(main_~#var_group4~0#1.base, main_~#var_group4~0#1.offset);havoc main_~#var_group4~0#1.base, main_~#var_group4~0#1.offset;call ULTIMATE.dealloc(main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset);havoc main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7254: havoc slhc_compress_#t~nondet541#1; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7190: havoc dev_close_#t~nondet530#1; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7194: havoc dev_trans_start_#t~nondet531#1; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7260: havoc slhc_init_#t~ret542#1.base, slhc_init_#t~ret542#1.offset; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7272: havoc tty_chars_in_buffer_#t~nondet545#1; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7287: havoc tty_register_ldisc_#t~nondet548#1; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5966: 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;call ULTIMATE.dealloc(sl_alloc_~#__key___0~0#1.base, sl_alloc_~#__key___0~0#1.offset);havoc sl_alloc_~#__key___0~0#1.base, sl_alloc_~#__key___0~0#1.offset;call ULTIMATE.dealloc(sl_alloc_~#__key___1~0#1.base, sl_alloc_~#__key___1~0#1.offset);havoc sl_alloc_~#__key___1~0#1.base, sl_alloc_~#__key___1~0#1.offset; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7223: havoc msleep_interruptible_#t~nondet533#1; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7291: havoc tty_unregister_ldisc_#t~nondet549#1; [2025-03-08 18:50:59,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6102: havoc slip_open_#t~mem329#1.base, slip_open_#t~mem329#1.offset;havoc slip_open_#t~mem330#1; [2025-03-08 18:50:59,713 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7099-1: ldv_sl_alloc_bufs_1_#res#1 := ldv_sl_alloc_bufs_1_~ldv_func_res~0#1; [2025-03-08 18:50:59,713 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7168: havoc alloc_netdev_mqs_#t~ret525#1.base, alloc_netdev_mqs_#t~ret525#1.offset; [2025-03-08 18:50:59,730 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7231: havoc netpoll_trap_#t~nondet535#1; [2025-03-08 18:51:00,024 INFO L? ?]: Removed 1464 outVars from TransFormulas that were not future-live. [2025-03-08 18:51:00,024 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:51:00,062 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:51:00,062 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 18:51:00,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:51:00 BoogieIcfgContainer [2025-03-08 18:51:00,062 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:51:00,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:51:00,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:51:00,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:51:00,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:50:51" (1/3) ... [2025-03-08 18:51:00,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3363df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:51:00, skipping insertion in model container [2025-03-08 18:51:00,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:50:52" (2/3) ... [2025-03-08 18:51:00,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3363df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:51:00, skipping insertion in model container [2025-03-08 18:51:00,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:51:00" (3/3) ... [2025-03-08 18:51:00,069 INFO L128 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2025-03-08 18:51:00,079 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:51:00,080 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i that has 56 procedures, 1109 locations, 1 initial locations, 23 loop locations, and 1 error locations. [2025-03-08 18:51:00,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:51:00,155 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;@24761241, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:51:00,155 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:51:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 1059 states, 778 states have (on average 1.4254498714652957) internal successors, (1109), 816 states have internal predecessors, (1109), 234 states have call successors, (234), 45 states have call predecessors, (234), 45 states have return successors, (234), 232 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-08 18:51:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 18:51:00,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:51:00,171 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:51:00,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:51:00,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:51:00,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1585875523, now seen corresponding path program 1 times [2025-03-08 18:51:00,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:51:00,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489944663] [2025-03-08 18:51:00,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:51:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:51:00,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 18:51:00,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 18:51:00,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:51:00,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:51:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 18:51:00,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:51:00,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489944663] [2025-03-08 18:51:00,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489944663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:51:00,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:51:00,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 18:51:00,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969523603] [2025-03-08 18:51:00,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:51:00,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:51:00,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:51:00,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:51:00,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:51:00,963 INFO L87 Difference]: Start difference. First operand has 1059 states, 778 states have (on average 1.4254498714652957) internal successors, (1109), 816 states have internal predecessors, (1109), 234 states have call successors, (234), 45 states have call predecessors, (234), 45 states have return successors, (234), 232 states have call predecessors, (234), 234 states have call successors, (234) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:51:01,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:51:01,147 INFO L93 Difference]: Finished difference Result 2114 states and 3164 transitions. [2025-03-08 18:51:01,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:51:01,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2025-03-08 18:51:01,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:51:01,164 INFO L225 Difference]: With dead ends: 2114 [2025-03-08 18:51:01,165 INFO L226 Difference]: Without dead ends: 1016 [2025-03-08 18:51:01,175 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-08 18:51:01,177 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 1565 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:51:01,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 1545 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:51:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-03-08 18:51:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2025-03-08 18:51:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 746 states have (on average 1.415549597855228) internal successors, (1056), 781 states have internal predecessors, (1056), 224 states have call successors, (224), 45 states have call predecessors, (224), 45 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-08 18:51:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1504 transitions. [2025-03-08 18:51:01,280 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1504 transitions. Word has length 77 [2025-03-08 18:51:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:51:01,282 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1504 transitions. [2025-03-08 18:51:01,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:51:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1504 transitions. [2025-03-08 18:51:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 18:51:01,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:51:01,286 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:51:01,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 18:51:01,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:51:01,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:51:01,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1866225412, now seen corresponding path program 1 times [2025-03-08 18:51:01,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:51:01,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011466635] [2025-03-08 18:51:01,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:51:01,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:51:01,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 18:51:01,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 18:51:01,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:51:01,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:51:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 18:51:01,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:51:01,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011466635] [2025-03-08 18:51:01,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011466635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:51:01,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:51:01,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:51:01,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676382440] [2025-03-08 18:51:01,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:51:01,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:51:01,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:51:01,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:51:01,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:51:01,889 INFO L87 Difference]: Start difference. First operand 1016 states and 1504 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 18:51:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:51:02,025 INFO L93 Difference]: Finished difference Result 1020 states and 1508 transitions. [2025-03-08 18:51:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:51:02,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 77 [2025-03-08 18:51:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:51:02,036 INFO L225 Difference]: With dead ends: 1020 [2025-03-08 18:51:02,038 INFO L226 Difference]: Without dead ends: 1018 [2025-03-08 18:51:02,039 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-08 18:51:02,039 INFO L435 NwaCegarLoop]: 1487 mSDtfsCounter, 0 mSDsluCounter, 2967 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4454 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-08 18:51:02,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4454 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:51:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-03-08 18:51:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2025-03-08 18:51:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 748 states have (on average 1.414438502673797) internal successors, (1058), 783 states have internal predecessors, (1058), 224 states have call successors, (224), 45 states have call predecessors, (224), 45 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-08 18:51:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1506 transitions. [2025-03-08 18:51:02,097 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1506 transitions. Word has length 77 [2025-03-08 18:51:02,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:51:02,097 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1506 transitions. [2025-03-08 18:51:02,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 18:51:02,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1506 transitions. [2025-03-08 18:51:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 18:51:02,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:51:02,101 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:51:02,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 18:51:02,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:51:02,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:51:02,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1120328444, now seen corresponding path program 1 times [2025-03-08 18:51:02,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:51:02,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127759770] [2025-03-08 18:51:02,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:51:02,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:51:02,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 18:51:02,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 18:51:02,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:51:02,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:51:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 18:51:02,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:51:02,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127759770] [2025-03-08 18:51:02,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127759770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:51:02,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:51:02,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:51:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792077633] [2025-03-08 18:51:02,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:51:02,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:51:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:51:02,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:51:02,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:51:02,578 INFO L87 Difference]: Start difference. First operand 1018 states and 1506 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 18:51:06,589 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-08 18:51:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:51:07,393 INFO L93 Difference]: Finished difference Result 2016 states and 2986 transitions. [2025-03-08 18:51:07,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:51:07,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-03-08 18:51:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:51:07,399 INFO L225 Difference]: With dead ends: 2016 [2025-03-08 18:51:07,399 INFO L226 Difference]: Without dead ends: 1029 [2025-03-08 18:51:07,401 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-08 18:51:07,406 INFO L435 NwaCegarLoop]: 1478 mSDtfsCounter, 1487 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 2506 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 18:51:07,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 2506 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 500 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 18:51:07,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-03-08 18:51:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1019. [2025-03-08 18:51:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 749 states have (on average 1.4138851802403205) internal successors, (1059), 784 states have internal predecessors, (1059), 224 states have call successors, (224), 45 states have call predecessors, (224), 45 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-08 18:51:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1507 transitions. [2025-03-08 18:51:07,438 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1507 transitions. Word has length 87 [2025-03-08 18:51:07,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:51:07,438 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1507 transitions. [2025-03-08 18:51:07,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 18:51:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1507 transitions. [2025-03-08 18:51:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 18:51:07,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:51:07,441 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:51:07,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 18:51:07,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:51:07,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:51:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1939603937, now seen corresponding path program 1 times [2025-03-08 18:51:07,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:51:07,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139658062] [2025-03-08 18:51:07,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:51:07,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:51:07,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 18:51:07,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 18:51:07,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:51:07,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:51:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 18:51:07,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:51:07,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139658062] [2025-03-08 18:51:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139658062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:51:07,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:51:07,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:51:07,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749006130] [2025-03-08 18:51:07,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:51:07,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:51:07,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:51:07,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:51:07,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:51:07,915 INFO L87 Difference]: Start difference. First operand 1019 states and 1507 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:51:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:51:08,030 INFO L93 Difference]: Finished difference Result 1036 states and 1530 transitions. [2025-03-08 18:51:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:51:08,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 89 [2025-03-08 18:51:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:51:08,037 INFO L225 Difference]: With dead ends: 1036 [2025-03-08 18:51:08,037 INFO L226 Difference]: Without dead ends: 1034 [2025-03-08 18:51:08,039 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-08 18:51:08,041 INFO L435 NwaCegarLoop]: 1489 mSDtfsCounter, 120 mSDsluCounter, 4304 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 5793 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-08 18:51:08,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 5793 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:51:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-08 18:51:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1021. [2025-03-08 18:51:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 750 states have (on average 1.4133333333333333) internal successors, (1060), 784 states have internal predecessors, (1060), 225 states have call successors, (225), 45 states have call predecessors, (225), 45 states have return successors, (225), 223 states have call predecessors, (225), 225 states have call successors, (225) [2025-03-08 18:51:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1510 transitions. [2025-03-08 18:51:08,080 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1510 transitions. Word has length 89 [2025-03-08 18:51:08,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:51:08,081 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1510 transitions. [2025-03-08 18:51:08,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:51:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1510 transitions. [2025-03-08 18:51:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 18:51:08,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:51:08,089 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:51:08,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 18:51:08,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:51:08,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:51:08,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1284542712, now seen corresponding path program 1 times [2025-03-08 18:51:08,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:51:08,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928778291] [2025-03-08 18:51:08,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:51:08,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:51:08,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 18:51:08,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 18:51:08,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:51:08,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:51:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:51:08,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:51:08,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928778291] [2025-03-08 18:51:08,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928778291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:51:08,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:51:08,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 18:51:08,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940764207] [2025-03-08 18:51:08,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:51:08,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:51:08,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:51:08,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:51:08,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:51:08,422 INFO L87 Difference]: Start difference. First operand 1021 states and 1510 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 18:51:12,430 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-08 18:51:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:51:12,629 INFO L93 Difference]: Finished difference Result 2974 states and 4404 transitions. [2025-03-08 18:51:12,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:51:12,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-03-08 18:51:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:51:12,643 INFO L225 Difference]: With dead ends: 2974 [2025-03-08 18:51:12,643 INFO L226 Difference]: Without dead ends: 1984 [2025-03-08 18:51:12,647 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-08 18:51:12,647 INFO L435 NwaCegarLoop]: 1754 mSDtfsCounter, 1438 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:51:12,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 3176 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 18:51:12,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2025-03-08 18:51:12,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1982. [2025-03-08 18:51:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1457 states have (on average 1.4172958133150309) internal successors, (2065), 1524 states have internal predecessors, (2065), 435 states have call successors, (435), 89 states have call predecessors, (435), 89 states have return successors, (435), 431 states have call predecessors, (435), 435 states have call successors, (435) [2025-03-08 18:51:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2935 transitions. [2025-03-08 18:51:12,744 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2935 transitions. Word has length 121 [2025-03-08 18:51:12,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:51:12,745 INFO L471 AbstractCegarLoop]: Abstraction has 1982 states and 2935 transitions. [2025-03-08 18:51:12,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 18:51:12,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2935 transitions. [2025-03-08 18:51:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 18:51:12,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:51:12,753 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:51:12,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 18:51:12,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:51:12,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:51:12,754 INFO L85 PathProgramCache]: Analyzing trace with hash 23113996, now seen corresponding path program 1 times [2025-03-08 18:51:12,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:51:12,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476964718] [2025-03-08 18:51:12,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:51:12,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:51:13,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 18:51:13,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 18:51:13,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:51:13,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:51:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 18:51:13,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:51:13,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476964718] [2025-03-08 18:51:13,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476964718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:51:13,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:51:13,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:51:13,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471773271] [2025-03-08 18:51:13,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:51:13,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:51:13,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:51:13,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:51:13,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:51:13,223 INFO L87 Difference]: Start difference. First operand 1982 states and 2935 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 18:51:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:51:13,338 INFO L93 Difference]: Finished difference Result 2995 states and 4422 transitions. [2025-03-08 18:51:13,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:51:13,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2025-03-08 18:51:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:51:13,346 INFO L225 Difference]: With dead ends: 2995 [2025-03-08 18:51:13,346 INFO L226 Difference]: Without dead ends: 1042 [2025-03-08 18:51:13,351 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-08 18:51:13,352 INFO L435 NwaCegarLoop]: 1488 mSDtfsCounter, 0 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4457 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:51:13,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4457 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:51:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2025-03-08 18:51:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2025-03-08 18:51:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 765 states have (on average 1.4039215686274509) internal successors, (1074), 799 states have internal predecessors, (1074), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-03-08 18:51:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1526 transitions. [2025-03-08 18:51:13,404 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1526 transitions. Word has length 123 [2025-03-08 18:51:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:51:13,405 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1526 transitions. [2025-03-08 18:51:13,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 18:51:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1526 transitions. [2025-03-08 18:51:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 18:51:13,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:51:13,409 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:51:13,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 18:51:13,410 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:51:13,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:51:13,411 INFO L85 PathProgramCache]: Analyzing trace with hash 736583098, now seen corresponding path program 1 times [2025-03-08 18:51:13,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:51:13,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578294726] [2025-03-08 18:51:13,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:51:13,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:51:13,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 18:51:13,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 18:51:13,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:51:13,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:51:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:51:13,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:51:13,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578294726] [2025-03-08 18:51:13,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578294726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:51:13,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:51:13,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:51:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732350136] [2025-03-08 18:51:13,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:51:13,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:51:13,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:51:13,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:51:13,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:51:13,825 INFO L87 Difference]: Start difference. First operand 1042 states and 1526 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 18:51:17,834 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-08 18:51:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:51:18,631 INFO L93 Difference]: Finished difference Result 2059 states and 3033 transitions. [2025-03-08 18:51:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:51:18,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-08 18:51:18,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:51:18,638 INFO L225 Difference]: With dead ends: 2059 [2025-03-08 18:51:18,638 INFO L226 Difference]: Without dead ends: 1069 [2025-03-08 18:51:18,641 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-08 18:51:18,642 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 1492 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 18:51:18,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 2498 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 513 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 18:51:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-03-08 18:51:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1046. [2025-03-08 18:51:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 769 states have (on average 1.4031209362808843) internal successors, (1079), 803 states have internal predecessors, (1079), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-03-08 18:51:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1531 transitions. [2025-03-08 18:51:18,687 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1531 transitions. Word has length 123 [2025-03-08 18:51:18,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:51:18,687 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1531 transitions. [2025-03-08 18:51:18,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 18:51:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1531 transitions. [2025-03-08 18:51:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 18:51:18,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:51:18,691 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:51:18,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 18:51:18,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:51:18,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:51:18,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1921514588, now seen corresponding path program 1 times [2025-03-08 18:51:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:51:18,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855570983] [2025-03-08 18:51:18,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:51:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:51:18,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 18:51:18,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 18:51:18,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:51:18,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:51:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 18:51:19,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:51:19,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855570983] [2025-03-08 18:51:19,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855570983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:51:19,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:51:19,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 18:51:19,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768241504] [2025-03-08 18:51:19,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:51:19,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:51:19,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:51:19,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:51:19,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:51:19,006 INFO L87 Difference]: Start difference. First operand 1046 states and 1531 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 18:51:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:51:19,079 INFO L93 Difference]: Finished difference Result 2040 states and 3010 transitions. [2025-03-08 18:51:19,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:51:19,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2025-03-08 18:51:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:51:19,085 INFO L225 Difference]: With dead ends: 2040 [2025-03-08 18:51:19,085 INFO L226 Difference]: Without dead ends: 1046 [2025-03-08 18:51:19,088 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-08 18:51:19,089 INFO L435 NwaCegarLoop]: 1478 mSDtfsCounter, 0 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2950 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:51:19,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2950 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:51:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-03-08 18:51:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2025-03-08 18:51:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 769 states have (on average 1.399219765929779) internal successors, (1076), 803 states have internal predecessors, (1076), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-03-08 18:51:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1528 transitions. [2025-03-08 18:51:19,126 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1528 transitions. Word has length 126 [2025-03-08 18:51:19,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:51:19,127 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1528 transitions. [2025-03-08 18:51:19,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 18:51:19,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1528 transitions. [2025-03-08 18:51:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 18:51:19,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:51:19,131 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:51:19,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 18:51:19,131 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:51:19,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:51:19,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1517026557, now seen corresponding path program 1 times [2025-03-08 18:51:19,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:51:19,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3510383] [2025-03-08 18:51:19,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:51:19,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:51:19,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 18:51:19,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 18:51:19,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:51:19,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:51:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:51:19,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:51:19,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3510383] [2025-03-08 18:51:19,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3510383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:51:19,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489585149] [2025-03-08 18:51:19,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:51:19,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:51:19,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:51:19,532 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-08 18:51:19,533 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-08 18:51:20,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 18:51:20,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 18:51:20,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:51:20,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:51:20,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 18:51:20,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:51:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 18:51:20,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:51:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:51:20,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489585149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:51:20,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:51:20,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2025-03-08 18:51:20,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034630401] [2025-03-08 18:51:20,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:51:20,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:51:20,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:51:20,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:51:20,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 18:51:20,656 INFO L87 Difference]: Start difference. First operand 1046 states and 1528 transitions. Second operand has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-08 18:51:24,665 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-08 18:51:28,674 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-08 18:51:32,686 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-08 18:51:36,691 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-08 18:51:40,698 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-08 18:51:44,703 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-08 18:51:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:51:45,517 INFO L93 Difference]: Finished difference Result 2120 states and 3117 transitions. [2025-03-08 18:51:45,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:51:45,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 129 [2025-03-08 18:51:45,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:51:45,524 INFO L225 Difference]: With dead ends: 2120 [2025-03-08 18:51:45,524 INFO L226 Difference]: Without dead ends: 1126 [2025-03-08 18:51:45,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-08 18:51:45,528 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 1639 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 53 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2025-03-08 18:51:45,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 2547 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 561 Invalid, 6 Unknown, 0 Unchecked, 24.8s Time] [2025-03-08 18:51:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2025-03-08 18:51:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1053. [2025-03-08 18:51:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 776 states have (on average 1.3981958762886597) internal successors, (1085), 810 states have internal predecessors, (1085), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-03-08 18:51:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1537 transitions. [2025-03-08 18:51:45,563 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1537 transitions. Word has length 129 [2025-03-08 18:51:45,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:51:45,563 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1537 transitions. [2025-03-08 18:51:45,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-08 18:51:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1537 transitions. [2025-03-08 18:51:45,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 18:51:45,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:51:45,568 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:51:45,578 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-08 18:51:45,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:51:45,773 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:51:45,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:51:45,773 INFO L85 PathProgramCache]: Analyzing trace with hash 278823847, now seen corresponding path program 2 times [2025-03-08 18:51:45,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:51:45,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836769479] [2025-03-08 18:51:45,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 18:51:45,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:51:46,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 138 statements into 2 equivalence classes. [2025-03-08 18:51:46,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 83 of 138 statements. [2025-03-08 18:51:46,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 18:51:46,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:51:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 18:51:46,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:51:46,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836769479] [2025-03-08 18:51:46,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836769479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:51:46,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:51:46,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 18:51:46,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598039048] [2025-03-08 18:51:46,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:51:46,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 18:51:46,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:51:46,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 18:51:46,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:51:46,598 INFO L87 Difference]: Start difference. First operand 1053 states and 1537 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 18:51:46,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:51:46,855 INFO L93 Difference]: Finished difference Result 2077 states and 3049 transitions. [2025-03-08 18:51:46,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 18:51:46,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2025-03-08 18:51:46,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:51:46,863 INFO L225 Difference]: With dead ends: 2077 [2025-03-08 18:51:46,863 INFO L226 Difference]: Without dead ends: 1061 [2025-03-08 18:51:46,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:51:46,866 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 51 mSDsluCounter, 10307 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 11786 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:51:46,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 11786 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:51:46,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-08 18:51:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1055. [2025-03-08 18:51:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 777 states have (on average 1.3976833976833978) internal successors, (1086), 812 states have internal predecessors, (1086), 226 states have call successors, (226), 50 states have call predecessors, (226), 51 states have return successors, (227), 224 states have call predecessors, (227), 226 states have call successors, (227) [2025-03-08 18:51:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1539 transitions. [2025-03-08 18:51:46,930 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1539 transitions. Word has length 138 [2025-03-08 18:51:46,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:51:46,930 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1539 transitions. [2025-03-08 18:51:46,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 18:51:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1539 transitions. [2025-03-08 18:51:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 18:51:46,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:51:46,935 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:51:46,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 18:51:46,936 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:51:46,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:51:46,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1637015260, now seen corresponding path program 1 times [2025-03-08 18:51:46,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:51:46,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124328127] [2025-03-08 18:51:46,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:51:46,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:51:47,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 18:51:47,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 18:51:47,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:51:47,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:51:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:51:47,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:51:47,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124328127] [2025-03-08 18:51:47,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124328127] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:51:47,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518744403] [2025-03-08 18:51:47,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:51:47,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:51:47,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:51:47,406 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-08 18:51:47,407 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-08 18:51:48,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 18:51:48,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 18:51:48,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:51:48,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:51:48,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 1270 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 18:51:48,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:51:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 18:51:48,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:51:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:51:48,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518744403] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:51:48,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:51:48,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 19 [2025-03-08 18:51:48,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425621530] [2025-03-08 18:51:48,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:51:48,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 18:51:48,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:51:48,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 18:51:48,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-03-08 18:51:48,737 INFO L87 Difference]: Start difference. First operand 1055 states and 1539 transitions. Second operand has 19 states, 19 states have (on average 11.0) internal successors, (209), 19 states have internal predecessors, (209), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-08 18:51:52,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:51:56,762 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-08 18:52:00,771 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-08 18:52:04,777 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-08 18:52:08,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:52:12,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:52:16,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:52:20,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:52:24,854 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 []