./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6e17534f736f8f0727327ccce9421d9a9e89801b3a6ab68095fc479caa060175 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 15:10:54,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:10:54,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 15:10:54,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:10:54,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:10:54,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:10:54,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:10:54,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:10:54,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:10:54,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:10:54,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:10:54,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:10:54,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:10:54,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:10:54,519 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:10:54,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:10:54,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:10:54,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 15:10:54,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:10:54,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:10:54,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:10:54,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:10:54,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:10:54,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:10:54,524 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:10:54,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:10:54,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:10:54,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:10:54,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:10:54,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:10:54,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:10:54,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:10:54,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:10:54,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 15:10:54,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 15:10:54,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:10:54,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:10:54,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:10:54,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:10:54,529 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 6e17534f736f8f0727327ccce9421d9a9e89801b3a6ab68095fc479caa060175 [2024-10-11 15:10:54,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:10:54,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:10:54,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:10:54,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:10:54,837 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:10:54,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2024-10-11 15:10:56,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:10:56,909 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:10:56,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2024-10-11 15:10:56,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ab040f898/19f18c6d585d40a286492f60be503182/FLAGf68d75efd [2024-10-11 15:10:56,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ab040f898/19f18c6d585d40a286492f60be503182 [2024-10-11 15:10:56,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:10:56,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:10:56,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:10:56,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:10:56,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:10:56,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:10:56" (1/1) ... [2024-10-11 15:10:56,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564f72b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:56, skipping insertion in model container [2024-10-11 15:10:56,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:10:56" (1/1) ... [2024-10-11 15:10:57,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:10:58,678 WARN L248 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.i[202834,202847] [2024-10-11 15:10:58,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:10:58,724 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:10:58,828 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] [2024-10-11 15:10:58,831 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] [2024-10-11 15:10:58,832 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] [2024-10-11 15:10:58,832 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] [2024-10-11 15:10:58,834 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4750] [2024-10-11 15:10:58,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4753] [2024-10-11 15:10:58,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4756] [2024-10-11 15:10:58,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4759] [2024-10-11 15:10:58,851 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5123] [2024-10-11 15:10:58,851 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5127] [2024-10-11 15:10:58,852 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5131] [2024-10-11 15:10:58,852 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5135] [2024-10-11 15:10:58,852 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] [2024-10-11 15:10:58,853 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] [2024-10-11 15:10:58,853 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] [2024-10-11 15:10:58,855 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] [2024-10-11 15:10:58,857 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] [2024-10-11 15:10:58,858 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] [2024-10-11 15:10:58,858 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] [2024-10-11 15:10:58,858 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] [2024-10-11 15:10:58,859 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] [2024-10-11 15:10:58,859 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] [2024-10-11 15:10:58,860 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] [2024-10-11 15:10:58,860 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] [2024-10-11 15:10:58,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5254] [2024-10-11 15:10:58,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5258] [2024-10-11 15:10:58,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5262] [2024-10-11 15:10:58,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5266] [2024-10-11 15:10:58,864 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] [2024-10-11 15:10:58,865 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] [2024-10-11 15:10:58,865 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] [2024-10-11 15:10:58,866 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] [2024-10-11 15:10:58,866 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] [2024-10-11 15:10:58,866 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] [2024-10-11 15:10:58,867 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] [2024-10-11 15:10:58,867 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] [2024-10-11 15:10:58,868 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] [2024-10-11 15:10:58,868 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] [2024-10-11 15:10:58,868 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] [2024-10-11 15:10:58,869 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] [2024-10-11 15:10:58,871 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5409] [2024-10-11 15:10:58,873 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5413] [2024-10-11 15:10:58,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5417] [2024-10-11 15:10:58,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5421] [2024-10-11 15:10:58,875 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] [2024-10-11 15:10:58,875 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] [2024-10-11 15:10:58,875 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] [2024-10-11 15:10:58,875 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] [2024-10-11 15:10:58,876 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] [2024-10-11 15:10:58,876 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] [2024-10-11 15:10:58,876 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] [2024-10-11 15:10:58,877 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] [2024-10-11 15:10:58,951 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] [2024-10-11 15:10:58,952 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] [2024-10-11 15:10:58,952 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] [2024-10-11 15:10:58,953 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] [2024-10-11 15:10:58,953 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] [2024-10-11 15:10:58,954 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] [2024-10-11 15:10:58,954 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] [2024-10-11 15:10:58,954 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] [2024-10-11 15:10:58,954 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] [2024-10-11 15:10:58,955 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] [2024-10-11 15:10:58,956 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] [2024-10-11 15:10:58,957 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] [2024-10-11 15:10:58,958 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] [2024-10-11 15:10:58,958 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] [2024-10-11 15:10:58,958 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] [2024-10-11 15:10:58,959 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] [2024-10-11 15:10:58,960 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] [2024-10-11 15:10:58,960 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] [2024-10-11 15:10:58,960 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] [2024-10-11 15:10:58,962 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] [2024-10-11 15:10:58,962 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] [2024-10-11 15:10:58,962 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] [2024-10-11 15:10:58,963 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] [2024-10-11 15:10:58,963 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] [2024-10-11 15:10:58,963 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] [2024-10-11 15:10:58,965 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] [2024-10-11 15:10:58,965 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] [2024-10-11 15:10:58,965 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] [2024-10-11 15:10:58,966 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] [2024-10-11 15:10:58,967 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] [2024-10-11 15:10:58,995 WARN L248 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.i[202834,202847] [2024-10-11 15:10:59,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:10:59,130 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:10:59,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:59 WrapperNode [2024-10-11 15:10:59,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:10:59,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:10:59,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:10:59,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:10:59,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:59" (1/1) ... [2024-10-11 15:10:59,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:59" (1/1) ... [2024-10-11 15:10:59,302 INFO L138 Inliner]: procedures = 157, calls = 809, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 3028 [2024-10-11 15:10:59,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:10:59,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:10:59,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:10:59,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:10:59,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:59" (1/1) ... [2024-10-11 15:10:59,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:59" (1/1) ... [2024-10-11 15:10:59,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:59" (1/1) ... [2024-10-11 15:10:59,641 INFO L175 MemorySlicer]: Split 415 memory accesses to 11 slices as follows [2, 334, 2, 1, 1, 1, 35, 20, 12, 3, 4]. 80 percent of accesses are in the largest equivalence class. The 62 initializations are split as follows [2, 5, 0, 0, 0, 0, 35, 20, 0, 0, 0]. The 119 writes are split as follows [0, 105, 0, 0, 1, 0, 0, 0, 12, 0, 1]. [2024-10-11 15:10:59,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:59" (1/1) ... [2024-10-11 15:10:59,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:59" (1/1) ... [2024-10-11 15:10:59,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:59" (1/1) ... [2024-10-11 15:10:59,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:59" (1/1) ... [2024-10-11 15:10:59,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:59" (1/1) ... [2024-10-11 15:10:59,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:59" (1/1) ... [2024-10-11 15:10:59,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:10:59,828 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:10:59,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:10:59,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:10:59,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:59" (1/1) ... [2024-10-11 15:10:59,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:10:59,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:10:59,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 15:10:59,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 15:10:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-11 15:10:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-11 15:10:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-11 15:10:59,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-11 15:10:59,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-11 15:10:59,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-11 15:10:59,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-11 15:10:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-11 15:10:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-11 15:10:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-11 15:10:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-10-11 15:10:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-11 15:10:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-11 15:10:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-11 15:10:59,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-11 15:10:59,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-11 15:10:59,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-11 15:10:59,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-11 15:10:59,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-11 15:10:59,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-10-11 15:10:59,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2024-10-11 15:10:59,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2024-10-11 15:10:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-11 15:10:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-11 15:10:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-11 15:10:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-11 15:10:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-11 15:10:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-11 15:10:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-11 15:10:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-11 15:10:59,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-10-11 15:10:59,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-10-11 15:10:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2024-10-11 15:10:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 15:10:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 15:10:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 15:10:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 15:10:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 15:10:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 15:10:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 15:10:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 15:10:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 15:10:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 15:10:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 15:10:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2024-10-11 15:10:59,925 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2024-10-11 15:10:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2024-10-11 15:10:59,925 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2024-10-11 15:10:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2024-10-11 15:10:59,925 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2024-10-11 15:10:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-10-11 15:10:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-10-11 15:10:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2024-10-11 15:10:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2024-10-11 15:10:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2024-10-11 15:10:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2024-10-11 15:10:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2024-10-11 15:10:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2024-10-11 15:10:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2024-10-11 15:10:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2024-10-11 15:10:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2024-10-11 15:10:59,925 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-10-11 15:10:59,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-10-11 15:10:59,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2024-10-11 15:10:59,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2024-10-11 15:10:59,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2024-10-11 15:10:59,976 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2024-10-11 15:10:59,976 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2024-10-11 15:10:59,976 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2024-10-11 15:10:59,976 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2024-10-11 15:10:59,976 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2024-10-11 15:10:59,976 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2024-10-11 15:10:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2024-10-11 15:10:59,976 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2024-10-11 15:10:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 15:10:59,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 15:10:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2024-10-11 15:10:59,976 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2024-10-11 15:10:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2024-10-11 15:10:59,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2024-10-11 15:10:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2024-10-11 15:10:59,977 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2024-10-11 15:10:59,977 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 15:10:59,977 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 15:10:59,977 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2024-10-11 15:10:59,977 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2024-10-11 15:10:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 15:10:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 15:10:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 15:10:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 15:10:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 15:10:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 15:10:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 15:10:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 15:10:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 15:10:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 15:10:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 15:10:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2024-10-11 15:10:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2024-10-11 15:10:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2024-10-11 15:10:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2024-10-11 15:10:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2024-10-11 15:10:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2024-10-11 15:10:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-11 15:10:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-11 15:10:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2024-10-11 15:10:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2024-10-11 15:10:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2024-10-11 15:10:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2024-10-11 15:10:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:10:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2024-10-11 15:10:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2024-10-11 15:10:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2024-10-11 15:10:59,980 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2024-10-11 15:10:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:10:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2024-10-11 15:10:59,980 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2024-10-11 15:10:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2024-10-11 15:10:59,980 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2024-10-11 15:10:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 15:10:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 15:10:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 15:10:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 15:10:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 15:10:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 15:10:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 15:10:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 15:10:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 15:10:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 15:10:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-11 15:10:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-11 15:10:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2024-10-11 15:10:59,981 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2024-10-11 15:10:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:10:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:10:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:10:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 15:10:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 15:10:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 15:10:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 15:10:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 15:10:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 15:10:59,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 15:10:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-11 15:10:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2024-10-11 15:10:59,986 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2024-10-11 15:10:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2024-10-11 15:10:59,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2024-10-11 15:10:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2024-10-11 15:10:59,986 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2024-10-11 15:10:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2024-10-11 15:10:59,986 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2024-10-11 15:10:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2024-10-11 15:10:59,987 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2024-10-11 15:10:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:10:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2024-10-11 15:10:59,987 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2024-10-11 15:10:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:10:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:10:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:10:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 15:10:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 15:10:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 15:10:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 15:10:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 15:10:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 15:10:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 15:10:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-11 15:10:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2024-10-11 15:10:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2024-10-11 15:10:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2024-10-11 15:10:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2024-10-11 15:10:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2024-10-11 15:10:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2024-10-11 15:10:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-11 15:10:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-11 15:10:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-11 15:10:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-11 15:10:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2024-10-11 15:10:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2024-10-11 15:10:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2024-10-11 15:10:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2024-10-11 15:10:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2024-10-11 15:10:59,989 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2024-10-11 15:10:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2024-10-11 15:10:59,989 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2024-10-11 15:10:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2024-10-11 15:10:59,989 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2024-10-11 15:10:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 15:10:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 15:10:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 15:10:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 15:10:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 15:10:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 15:10:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 15:10:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 15:10:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 15:10:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 15:10:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 15:10:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2024-10-11 15:10:59,990 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2024-10-11 15:10:59,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2024-10-11 15:10:59,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2024-10-11 15:10:59,991 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2024-10-11 15:10:59,991 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2024-10-11 15:10:59,991 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2024-10-11 15:10:59,991 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2024-10-11 15:10:59,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-11 15:10:59,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-11 15:10:59,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-11 15:10:59,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-11 15:10:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-11 15:10:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-11 15:10:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-11 15:10:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-11 15:10:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-10-11 15:10:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2024-10-11 15:10:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2024-10-11 15:10:59,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:10:59,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:10:59,993 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2024-10-11 15:10:59,993 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2024-10-11 15:10:59,993 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2024-10-11 15:10:59,993 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2024-10-11 15:11:00,469 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:11:00,472 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:11:03,307 INFO L? ?]: Removed 1466 outVars from TransFormulas that were not future-live. [2024-10-11 15:11:03,308 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:11:03,532 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:11:03,532 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-11 15:11:03,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:11:03 BoogieIcfgContainer [2024-10-11 15:11:03,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:11:03,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:11:03,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:11:03,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:11:03,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:10:56" (1/3) ... [2024-10-11 15:11:03,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3797f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:11:03, skipping insertion in model container [2024-10-11 15:11:03,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:59" (2/3) ... [2024-10-11 15:11:03,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3797f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:11:03, skipping insertion in model container [2024-10-11 15:11:03,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:11:03" (3/3) ... [2024-10-11 15:11:03,544 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2024-10-11 15:11:03,562 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:11:03,562 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-10-11 15:11:03,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:11:03,679 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;@7883497e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:11:03,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-11 15:11:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 960 states, 679 states have (on average 1.5228276877761413) internal successors, (1034), 718 states have internal predecessors, (1034), 223 states have call successors, (223), 44 states have call predecessors, (223), 44 states have return successors, (223), 221 states have call predecessors, (223), 223 states have call successors, (223) [2024-10-11 15:11:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 15:11:03,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:03,702 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:11:03,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:03,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:03,708 INFO L85 PathProgramCache]: Analyzing trace with hash -883939047, now seen corresponding path program 1 times [2024-10-11 15:11:03,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:03,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787392171] [2024-10-11 15:11:03,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:03,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:11:04,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:04,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787392171] [2024-10-11 15:11:04,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787392171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:04,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:04,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:04,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724460178] [2024-10-11 15:11:04,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:04,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:04,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:04,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:04,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:04,407 INFO L87 Difference]: Start difference. First operand has 960 states, 679 states have (on average 1.5228276877761413) internal successors, (1034), 718 states have internal predecessors, (1034), 223 states have call successors, (223), 44 states have call predecessors, (223), 44 states have return successors, (223), 221 states have call predecessors, (223), 223 states have call successors, (223) Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 15:11:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:06,615 INFO L93 Difference]: Finished difference Result 1932 states and 3010 transitions. [2024-10-11 15:11:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 2 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 66 [2024-10-11 15:11:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:06,648 INFO L225 Difference]: With dead ends: 1932 [2024-10-11 15:11:06,648 INFO L226 Difference]: Without dead ends: 939 [2024-10-11 15:11:06,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:06,664 INFO L432 NwaCegarLoop]: 989 mSDtfsCounter, 1554 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:06,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 1562 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 15:11:06,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-10-11 15:11:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 925. [2024-10-11 15:11:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 655 states have (on average 1.4732824427480915) internal successors, (965), 691 states have internal predecessors, (965), 213 states have call successors, (213), 44 states have call predecessors, (213), 44 states have return successors, (213), 211 states have call predecessors, (213), 213 states have call successors, (213) [2024-10-11 15:11:06,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1391 transitions. [2024-10-11 15:11:06,818 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1391 transitions. Word has length 66 [2024-10-11 15:11:06,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:06,819 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1391 transitions. [2024-10-11 15:11:06,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 15:11:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1391 transitions. [2024-10-11 15:11:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 15:11:06,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:06,826 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:11:06,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 15:11:06,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:06,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:06,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1382442139, now seen corresponding path program 1 times [2024-10-11 15:11:06,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:06,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385028536] [2024-10-11 15:11:06,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:06,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:07,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:07,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:07,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:07,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:07,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:07,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:07,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:07,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:11:07,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:07,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385028536] [2024-10-11 15:11:07,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385028536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:07,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:07,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:11:07,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490494873] [2024-10-11 15:11:07,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:07,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:11:07,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:07,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:11:07,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:07,115 INFO L87 Difference]: Start difference. First operand 925 states and 1391 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 15:11:09,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:09,870 INFO L93 Difference]: Finished difference Result 943 states and 1423 transitions. [2024-10-11 15:11:09,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:11:09,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 2 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 66 [2024-10-11 15:11:09,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:09,877 INFO L225 Difference]: With dead ends: 943 [2024-10-11 15:11:09,878 INFO L226 Difference]: Without dead ends: 941 [2024-10-11 15:11:09,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:09,879 INFO L432 NwaCegarLoop]: 949 mSDtfsCounter, 397 mSDsluCounter, 2167 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 3116 SdHoareTripleChecker+Invalid, 2052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:09,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 3116 Invalid, 2052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 15:11:09,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-10-11 15:11:09,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 927. [2024-10-11 15:11:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 657 states have (on average 1.4718417047184171) internal successors, (967), 693 states have internal predecessors, (967), 213 states have call successors, (213), 44 states have call predecessors, (213), 44 states have return successors, (213), 211 states have call predecessors, (213), 213 states have call successors, (213) [2024-10-11 15:11:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1393 transitions. [2024-10-11 15:11:09,926 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1393 transitions. Word has length 66 [2024-10-11 15:11:09,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:09,927 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1393 transitions. [2024-10-11 15:11:09,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 15:11:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1393 transitions. [2024-10-11 15:11:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 15:11:09,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:09,930 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:11:09,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 15:11:09,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:09,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:09,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1242471176, now seen corresponding path program 1 times [2024-10-11 15:11:09,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:09,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861175266] [2024-10-11 15:11:09,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:09,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 15:11:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 15:11:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:11:10,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:10,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861175266] [2024-10-11 15:11:10,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861175266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:10,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:10,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:10,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815615663] [2024-10-11 15:11:10,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:10,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:10,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:10,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:10,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:10,190 INFO L87 Difference]: Start difference. First operand 927 states and 1393 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 15:11:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:12,275 INFO L93 Difference]: Finished difference Result 2325 states and 3565 transitions. [2024-10-11 15:11:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:12,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 68 [2024-10-11 15:11:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:12,285 INFO L225 Difference]: With dead ends: 2325 [2024-10-11 15:11:12,286 INFO L226 Difference]: Without dead ends: 1426 [2024-10-11 15:11:12,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:12,290 INFO L432 NwaCegarLoop]: 946 mSDtfsCounter, 925 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:12,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 2270 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 15:11:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-10-11 15:11:12,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1396. [2024-10-11 15:11:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1001 states have (on average 1.4845154845154844) internal successors, (1486), 1054 states have internal predecessors, (1486), 338 states have call successors, (338), 44 states have call predecessors, (338), 44 states have return successors, (338), 335 states have call predecessors, (338), 338 states have call successors, (338) [2024-10-11 15:11:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2162 transitions. [2024-10-11 15:11:12,358 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2162 transitions. Word has length 68 [2024-10-11 15:11:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:12,358 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 2162 transitions. [2024-10-11 15:11:12,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 15:11:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2162 transitions. [2024-10-11 15:11:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 15:11:12,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:12,363 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:11:12,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 15:11:12,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:12,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:12,363 INFO L85 PathProgramCache]: Analyzing trace with hash 890001953, now seen corresponding path program 1 times [2024-10-11 15:11:12,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:12,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461048929] [2024-10-11 15:11:12,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:12,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:12,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:12,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:12,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:12,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:12,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:12,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:12,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:12,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:12,667 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:11:12,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:12,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461048929] [2024-10-11 15:11:12,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461048929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:12,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:12,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:11:12,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388002877] [2024-10-11 15:11:12,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:12,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:11:12,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:12,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:11:12,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:12,670 INFO L87 Difference]: Start difference. First operand 1396 states and 2162 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 15:11:15,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:15,132 INFO L93 Difference]: Finished difference Result 2796 states and 4352 transitions. [2024-10-11 15:11:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:11:15,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (10), 2 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 75 [2024-10-11 15:11:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:15,142 INFO L225 Difference]: With dead ends: 2796 [2024-10-11 15:11:15,142 INFO L226 Difference]: Without dead ends: 1428 [2024-10-11 15:11:15,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:11:15,148 INFO L432 NwaCegarLoop]: 934 mSDtfsCounter, 1484 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1620 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:15,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1620 Valid, 2087 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 15:11:15,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-10-11 15:11:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1398. [2024-10-11 15:11:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1003 states have (on average 1.4835493519441676) internal successors, (1488), 1056 states have internal predecessors, (1488), 338 states have call successors, (338), 44 states have call predecessors, (338), 44 states have return successors, (338), 335 states have call predecessors, (338), 338 states have call successors, (338) [2024-10-11 15:11:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2164 transitions. [2024-10-11 15:11:15,248 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2164 transitions. Word has length 75 [2024-10-11 15:11:15,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:15,250 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2164 transitions. [2024-10-11 15:11:15,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 15:11:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2164 transitions. [2024-10-11 15:11:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 15:11:15,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:15,253 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:11:15,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 15:11:15,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:15,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:15,254 INFO L85 PathProgramCache]: Analyzing trace with hash -52605181, now seen corresponding path program 1 times [2024-10-11 15:11:15,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:15,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670778329] [2024-10-11 15:11:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:15,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:11:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:11:15,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:15,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670778329] [2024-10-11 15:11:15,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670778329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:15,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:15,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:11:15,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600959228] [2024-10-11 15:11:15,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:15,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:11:15,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:15,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:11:15,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:11:15,547 INFO L87 Difference]: Start difference. First operand 1398 states and 2164 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 15:11:18,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:18,422 INFO L93 Difference]: Finished difference Result 1444 states and 2247 transitions. [2024-10-11 15:11:18,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 15:11:18,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (10), 2 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 76 [2024-10-11 15:11:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:18,435 INFO L225 Difference]: With dead ends: 1444 [2024-10-11 15:11:18,435 INFO L226 Difference]: Without dead ends: 1442 [2024-10-11 15:11:18,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:11:18,439 INFO L432 NwaCegarLoop]: 948 mSDtfsCounter, 512 mSDsluCounter, 2856 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 3804 SdHoareTripleChecker+Invalid, 2640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:18,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 3804 Invalid, 2640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 15:11:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2024-10-11 15:11:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1402. [2024-10-11 15:11:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1005 states have (on average 1.4825870646766168) internal successors, (1490), 1056 states have internal predecessors, (1490), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2170 transitions. [2024-10-11 15:11:18,517 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2170 transitions. Word has length 76 [2024-10-11 15:11:18,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:18,518 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 2170 transitions. [2024-10-11 15:11:18,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 15:11:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2170 transitions. [2024-10-11 15:11:18,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 15:11:18,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:18,522 INFO L215 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] [2024-10-11 15:11:18,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 15:11:18,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:18,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash 671980406, now seen corresponding path program 1 times [2024-10-11 15:11:18,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:18,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701595469] [2024-10-11 15:11:18,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:18,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:11:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:11:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:11:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:11:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 15:11:18,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:18,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701595469] [2024-10-11 15:11:18,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701595469] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:18,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819343361] [2024-10-11 15:11:18,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:18,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:18,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:18,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:18,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 15:11:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:11:19,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 15:11:19,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:19,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819343361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:19,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:19,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 15:11:19,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474982740] [2024-10-11 15:11:19,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:19,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:11:19,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:19,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:11:19,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:11:19,322 INFO L87 Difference]: Start difference. First operand 1402 states and 2170 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 15:11:19,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:19,922 INFO L93 Difference]: Finished difference Result 2772 states and 4299 transitions. [2024-10-11 15:11:19,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:11:19,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2024-10-11 15:11:19,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:19,931 INFO L225 Difference]: With dead ends: 2772 [2024-10-11 15:11:19,931 INFO L226 Difference]: Without dead ends: 1398 [2024-10-11 15:11:19,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:11:19,940 INFO L432 NwaCegarLoop]: 1294 mSDtfsCounter, 0 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:19,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2581 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 15:11:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-11 15:11:19,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2024-10-11 15:11:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1002 states have (on average 1.4820359281437125) internal successors, (1485), 1052 states have internal predecessors, (1485), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2165 transitions. [2024-10-11 15:11:20,004 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2165 transitions. Word has length 84 [2024-10-11 15:11:20,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:20,005 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2165 transitions. [2024-10-11 15:11:20,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 15:11:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2165 transitions. [2024-10-11 15:11:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 15:11:20,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:20,011 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:11:20,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 15:11:20,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:20,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting get_currentErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:20,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash 792813936, now seen corresponding path program 1 times [2024-10-11 15:11:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:20,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056975299] [2024-10-11 15:11:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:20,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:20,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:20,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:20,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:20,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:20,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:20,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:20,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 15:11:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:20,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:11:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:20,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 15:11:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:11:20,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:20,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056975299] [2024-10-11 15:11:20,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056975299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:20,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:20,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:20,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871531295] [2024-10-11 15:11:20,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:20,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:20,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:20,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:20,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:20,377 INFO L87 Difference]: Start difference. First operand 1398 states and 2165 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 15:11:22,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:22,893 INFO L93 Difference]: Finished difference Result 2778 states and 4337 transitions. [2024-10-11 15:11:22,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:22,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 85 [2024-10-11 15:11:22,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:22,903 INFO L225 Difference]: With dead ends: 2778 [2024-10-11 15:11:22,904 INFO L226 Difference]: Without dead ends: 1408 [2024-10-11 15:11:22,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:22,910 INFO L432 NwaCegarLoop]: 952 mSDtfsCounter, 387 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 2316 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:22,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 2316 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 15:11:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-10-11 15:11:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1394. [2024-10-11 15:11:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 999 states have (on average 1.4814814814814814) internal successors, (1480), 1048 states have internal predecessors, (1480), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2160 transitions. [2024-10-11 15:11:22,974 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2160 transitions. Word has length 85 [2024-10-11 15:11:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:22,976 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2160 transitions. [2024-10-11 15:11:22,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 15:11:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2160 transitions. [2024-10-11 15:11:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 15:11:22,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:22,980 INFO L215 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] [2024-10-11 15:11:22,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 15:11:22,980 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:22,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:22,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1553195907, now seen corresponding path program 1 times [2024-10-11 15:11:22,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:22,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92377342] [2024-10-11 15:11:22,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:22,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:11:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:11:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:11:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:11:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 15:11:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 15:11:23,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:23,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92377342] [2024-10-11 15:11:23,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92377342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:23,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256665739] [2024-10-11 15:11:23,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:23,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:23,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:23,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:23,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 15:11:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:23,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:11:23,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 15:11:23,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:23,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256665739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:23,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:23,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 15:11:23,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151147730] [2024-10-11 15:11:23,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:23,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:11:23,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:23,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:11:23,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:23,721 INFO L87 Difference]: Start difference. First operand 1394 states and 2160 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 15:11:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:24,458 INFO L93 Difference]: Finished difference Result 2760 states and 4283 transitions. [2024-10-11 15:11:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:11:24,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 89 [2024-10-11 15:11:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:24,467 INFO L225 Difference]: With dead ends: 2760 [2024-10-11 15:11:24,468 INFO L226 Difference]: Without dead ends: 1394 [2024-10-11 15:11:24,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:24,474 INFO L432 NwaCegarLoop]: 1284 mSDtfsCounter, 0 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2566 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:24,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2566 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 15:11:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-10-11 15:11:24,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2024-10-11 15:11:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 999 states have (on average 1.4784784784784786) internal successors, (1477), 1048 states have internal predecessors, (1477), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2157 transitions. [2024-10-11 15:11:24,532 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2157 transitions. Word has length 89 [2024-10-11 15:11:24,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:24,535 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2157 transitions. [2024-10-11 15:11:24,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 15:11:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2157 transitions. [2024-10-11 15:11:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 15:11:24,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:24,539 INFO L215 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] [2024-10-11 15:11:24,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 15:11:24,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:24,744 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:24,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:24,744 INFO L85 PathProgramCache]: Analyzing trace with hash 717557302, now seen corresponding path program 1 times [2024-10-11 15:11:24,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:24,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407814134] [2024-10-11 15:11:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:11:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:11:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:11:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:11:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 15:11:24,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:24,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407814134] [2024-10-11 15:11:24,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407814134] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:24,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466732462] [2024-10-11 15:11:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:24,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:24,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:24,936 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:24,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 15:11:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:25,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:11:25,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:25,434 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 15:11:25,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:25,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466732462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:25,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:25,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 15:11:25,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140142010] [2024-10-11 15:11:25,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:25,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:11:25,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:25,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:11:25,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:25,436 INFO L87 Difference]: Start difference. First operand 1394 states and 2157 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:25,845 INFO L93 Difference]: Finished difference Result 2756 states and 4273 transitions. [2024-10-11 15:11:25,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:11:25,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-10-11 15:11:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:25,854 INFO L225 Difference]: With dead ends: 2756 [2024-10-11 15:11:25,855 INFO L226 Difference]: Without dead ends: 1390 [2024-10-11 15:11:25,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:25,860 INFO L432 NwaCegarLoop]: 1281 mSDtfsCounter, 0 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:25,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2555 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 15:11:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-10-11 15:11:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1390. [2024-10-11 15:11:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 996 states have (on average 1.4779116465863453) internal successors, (1472), 1044 states have internal predecessors, (1472), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2152 transitions. [2024-10-11 15:11:25,911 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2152 transitions. Word has length 92 [2024-10-11 15:11:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:25,912 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2152 transitions. [2024-10-11 15:11:25,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2152 transitions. [2024-10-11 15:11:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 15:11:25,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:25,917 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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] [2024-10-11 15:11:25,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 15:11:26,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:26,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:26,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:26,118 INFO L85 PathProgramCache]: Analyzing trace with hash 363285868, now seen corresponding path program 1 times [2024-10-11 15:11:26,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:26,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294165749] [2024-10-11 15:11:26,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:26,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 15:11:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:11:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:11:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:11:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 15:11:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 15:11:26,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:26,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294165749] [2024-10-11 15:11:26,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294165749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:26,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:26,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:26,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300901041] [2024-10-11 15:11:26,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:26,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:26,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:26,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:26,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:26,327 INFO L87 Difference]: Start difference. First operand 1390 states and 2152 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:27,969 INFO L93 Difference]: Finished difference Result 2760 states and 4295 transitions. [2024-10-11 15:11:27,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:27,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 107 [2024-10-11 15:11:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:27,979 INFO L225 Difference]: With dead ends: 2760 [2024-10-11 15:11:27,979 INFO L226 Difference]: Without dead ends: 1398 [2024-10-11 15:11:27,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:27,985 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 384 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:27,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2274 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 15:11:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-11 15:11:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1384. [2024-10-11 15:11:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 991 states have (on average 1.4762865792129163) internal successors, (1463), 1038 states have internal predecessors, (1463), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2143 transitions. [2024-10-11 15:11:28,037 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2143 transitions. Word has length 107 [2024-10-11 15:11:28,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:28,038 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2143 transitions. [2024-10-11 15:11:28,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2143 transitions. [2024-10-11 15:11:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 15:11:28,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:28,043 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:28,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 15:11:28,043 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting sl_free_bufsErr2ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:28,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:28,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1052330697, now seen corresponding path program 1 times [2024-10-11 15:11:28,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:28,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340994597] [2024-10-11 15:11:28,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:28,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:11:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:11:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:11:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:11:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 15:11:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 15:11:28,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:28,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340994597] [2024-10-11 15:11:28,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340994597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:28,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296236371] [2024-10-11 15:11:28,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:28,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:28,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:28,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:28,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 15:11:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:28,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:11:28,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 15:11:28,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:28,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296236371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:28,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:28,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 15:11:28,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063858300] [2024-10-11 15:11:28,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:28,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:11:28,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:28,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:11:28,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:28,738 INFO L87 Difference]: Start difference. First operand 1384 states and 2143 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 15:11:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:29,254 INFO L93 Difference]: Finished difference Result 2740 states and 4249 transitions. [2024-10-11 15:11:29,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:11:29,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-10-11 15:11:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:29,264 INFO L225 Difference]: With dead ends: 2740 [2024-10-11 15:11:29,265 INFO L226 Difference]: Without dead ends: 1384 [2024-10-11 15:11:29,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:29,270 INFO L432 NwaCegarLoop]: 1271 mSDtfsCounter, 0 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:29,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2540 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 15:11:29,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-10-11 15:11:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2024-10-11 15:11:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 991 states have (on average 1.4732593340060545) internal successors, (1460), 1038 states have internal predecessors, (1460), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2140 transitions. [2024-10-11 15:11:29,327 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2140 transitions. Word has length 97 [2024-10-11 15:11:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:29,328 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2140 transitions. [2024-10-11 15:11:29,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 15:11:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2140 transitions. [2024-10-11 15:11:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 15:11:29,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:29,335 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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] [2024-10-11 15:11:29,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 15:11:29,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 15:11:29,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:29,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:29,536 INFO L85 PathProgramCache]: Analyzing trace with hash 109287725, now seen corresponding path program 1 times [2024-10-11 15:11:29,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:29,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907172130] [2024-10-11 15:11:29,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:29,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 15:11:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:11:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:11:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:11:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 15:11:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 15:11:29,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:29,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907172130] [2024-10-11 15:11:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907172130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:29,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:29,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430935476] [2024-10-11 15:11:29,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:29,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:29,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:29,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:29,709 INFO L87 Difference]: Start difference. First operand 1384 states and 2140 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:31,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:31,470 INFO L93 Difference]: Finished difference Result 2754 states and 4278 transitions. [2024-10-11 15:11:31,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:31,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-10-11 15:11:31,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:31,485 INFO L225 Difference]: With dead ends: 2754 [2024-10-11 15:11:31,485 INFO L226 Difference]: Without dead ends: 1398 [2024-10-11 15:11:31,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:31,490 INFO L432 NwaCegarLoop]: 926 mSDtfsCounter, 384 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:31,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2250 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 15:11:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-11 15:11:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1384. [2024-10-11 15:11:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 991 states have (on average 1.467204843592331) internal successors, (1454), 1038 states have internal predecessors, (1454), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:31,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2134 transitions. [2024-10-11 15:11:31,552 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2134 transitions. Word has length 109 [2024-10-11 15:11:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:31,555 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2134 transitions. [2024-10-11 15:11:31,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2134 transitions. [2024-10-11 15:11:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 15:11:31,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:31,559 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:31,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 15:11:31,560 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting sl_free_bufsErr2ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:31,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:31,560 INFO L85 PathProgramCache]: Analyzing trace with hash 362167959, now seen corresponding path program 1 times [2024-10-11 15:11:31,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:31,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439831552] [2024-10-11 15:11:31,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:31,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:11:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:11:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:11:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:11:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 15:11:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 15:11:31,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:31,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439831552] [2024-10-11 15:11:31,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439831552] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:31,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690210704] [2024-10-11 15:11:31,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:31,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:31,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:31,732 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:31,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 15:11:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:32,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:11:32,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 15:11:32,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:32,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690210704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:32,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:32,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 15:11:32,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362564029] [2024-10-11 15:11:32,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:32,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:11:32,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:32,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:11:32,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:32,249 INFO L87 Difference]: Start difference. First operand 1384 states and 2134 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 15:11:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:32,742 INFO L93 Difference]: Finished difference Result 2736 states and 4227 transitions. [2024-10-11 15:11:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:11:32,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-10-11 15:11:32,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:32,752 INFO L225 Difference]: With dead ends: 2736 [2024-10-11 15:11:32,752 INFO L226 Difference]: Without dead ends: 1380 [2024-10-11 15:11:32,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:32,757 INFO L432 NwaCegarLoop]: 1265 mSDtfsCounter, 0 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:32,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2523 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 15:11:32,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-10-11 15:11:32,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1380. [2024-10-11 15:11:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 988 states have (on average 1.4665991902834008) internal successors, (1449), 1034 states have internal predecessors, (1449), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2129 transitions. [2024-10-11 15:11:32,807 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2129 transitions. Word has length 100 [2024-10-11 15:11:32,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:32,808 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2129 transitions. [2024-10-11 15:11:32,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 15:11:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2129 transitions. [2024-10-11 15:11:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 15:11:32,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:32,814 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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] [2024-10-11 15:11:32,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 15:11:33,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 15:11:33,015 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:33,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:33,015 INFO L85 PathProgramCache]: Analyzing trace with hash -951940388, now seen corresponding path program 1 times [2024-10-11 15:11:33,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:33,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346621025] [2024-10-11 15:11:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 15:11:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:11:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:11:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:11:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 15:11:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 15:11:33,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:33,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346621025] [2024-10-11 15:11:33,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346621025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:33,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:33,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:33,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344154749] [2024-10-11 15:11:33,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:33,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:33,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:33,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:33,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:33,218 INFO L87 Difference]: Start difference. First operand 1380 states and 2129 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:34,925 INFO L93 Difference]: Finished difference Result 2740 states and 4249 transitions. [2024-10-11 15:11:34,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:34,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2024-10-11 15:11:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:34,935 INFO L225 Difference]: With dead ends: 2740 [2024-10-11 15:11:34,935 INFO L226 Difference]: Without dead ends: 1388 [2024-10-11 15:11:34,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:34,941 INFO L432 NwaCegarLoop]: 923 mSDtfsCounter, 384 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2234 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:34,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2234 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 15:11:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-10-11 15:11:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1374. [2024-10-11 15:11:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 983 states have (on average 1.4649033570701933) internal successors, (1440), 1028 states have internal predecessors, (1440), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2120 transitions. [2024-10-11 15:11:34,990 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2120 transitions. Word has length 112 [2024-10-11 15:11:34,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:34,991 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2120 transitions. [2024-10-11 15:11:34,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:34,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2120 transitions. [2024-10-11 15:11:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 15:11:34,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:34,996 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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] [2024-10-11 15:11:34,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 15:11:34,997 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:34,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1102758115, now seen corresponding path program 1 times [2024-10-11 15:11:34,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:34,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563365103] [2024-10-11 15:11:34,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:34,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 15:11:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:11:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:11:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:11:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 15:11:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 15:11:35,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:35,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563365103] [2024-10-11 15:11:35,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563365103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:35,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:35,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:35,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365152883] [2024-10-11 15:11:35,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:35,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:35,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:35,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:35,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:35,144 INFO L87 Difference]: Start difference. First operand 1374 states and 2120 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:36,922 INFO L93 Difference]: Finished difference Result 2734 states and 4238 transitions. [2024-10-11 15:11:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:36,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-11 15:11:36,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:36,932 INFO L225 Difference]: With dead ends: 2734 [2024-10-11 15:11:36,933 INFO L226 Difference]: Without dead ends: 1388 [2024-10-11 15:11:36,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:36,939 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 384 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:36,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2221 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 15:11:36,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-10-11 15:11:36,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1374. [2024-10-11 15:11:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 983 states have (on average 1.4587995930824007) internal successors, (1434), 1028 states have internal predecessors, (1434), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2114 transitions. [2024-10-11 15:11:36,994 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2114 transitions. Word has length 114 [2024-10-11 15:11:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:36,994 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2114 transitions. [2024-10-11 15:11:36,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2114 transitions. [2024-10-11 15:11:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 15:11:37,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:37,001 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:37,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 15:11:37,001 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting sl_free_bufsErr3ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:37,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:37,002 INFO L85 PathProgramCache]: Analyzing trace with hash -149991154, now seen corresponding path program 1 times [2024-10-11 15:11:37,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:37,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509851211] [2024-10-11 15:11:37,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:37,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:11:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:11:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:11:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:11:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 15:11:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 15:11:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 15:11:37,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:37,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509851211] [2024-10-11 15:11:37,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509851211] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:37,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041904018] [2024-10-11 15:11:37,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:37,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:37,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:37,186 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:37,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 15:11:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:37,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:11:37,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 15:11:37,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:37,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041904018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:37,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:37,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 15:11:37,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326110545] [2024-10-11 15:11:37,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:37,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:11:37,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:37,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:11:37,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:37,713 INFO L87 Difference]: Start difference. First operand 1374 states and 2114 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 15:11:38,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:38,162 INFO L93 Difference]: Finished difference Result 2720 states and 4191 transitions. [2024-10-11 15:11:38,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:11:38,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2024-10-11 15:11:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:38,174 INFO L225 Difference]: With dead ends: 2720 [2024-10-11 15:11:38,174 INFO L226 Difference]: Without dead ends: 1374 [2024-10-11 15:11:38,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:38,180 INFO L432 NwaCegarLoop]: 1252 mSDtfsCounter, 0 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:38,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2502 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 15:11:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2024-10-11 15:11:38,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2024-10-11 15:11:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 983 states have (on average 1.4557477110885046) internal successors, (1431), 1028 states have internal predecessors, (1431), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2111 transitions. [2024-10-11 15:11:38,237 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2111 transitions. Word has length 105 [2024-10-11 15:11:38,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:38,237 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2111 transitions. [2024-10-11 15:11:38,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 15:11:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2111 transitions. [2024-10-11 15:11:38,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 15:11:38,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:38,244 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:11:38,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 15:11:38,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 15:11:38,446 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:38,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:38,447 INFO L85 PathProgramCache]: Analyzing trace with hash 927811095, now seen corresponding path program 1 times [2024-10-11 15:11:38,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:38,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620832321] [2024-10-11 15:11:38,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:38,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:11:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 15:11:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 15:11:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 15:11:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 15:11:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 15:11:38,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:38,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620832321] [2024-10-11 15:11:38,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620832321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:38,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:38,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:38,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575203032] [2024-10-11 15:11:38,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:38,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:38,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:38,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:38,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:38,661 INFO L87 Difference]: Start difference. First operand 1374 states and 2111 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 15:11:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:42,455 INFO L93 Difference]: Finished difference Result 4054 states and 6258 transitions. [2024-10-11 15:11:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:11:42,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (14), 2 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 104 [2024-10-11 15:11:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:42,472 INFO L225 Difference]: With dead ends: 4054 [2024-10-11 15:11:42,472 INFO L226 Difference]: Without dead ends: 2708 [2024-10-11 15:11:42,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:42,483 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 1720 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:42,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 2393 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 15:11:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2024-10-11 15:11:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2666. [2024-10-11 15:11:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2666 states, 1913 states have (on average 1.4573967590172503) internal successors, (2788), 1996 states have internal predecessors, (2788), 659 states have call successors, (659), 87 states have call predecessors, (659), 87 states have return successors, (659), 653 states have call predecessors, (659), 659 states have call successors, (659) [2024-10-11 15:11:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 4106 transitions. [2024-10-11 15:11:42,694 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 4106 transitions. Word has length 104 [2024-10-11 15:11:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:42,698 INFO L471 AbstractCegarLoop]: Abstraction has 2666 states and 4106 transitions. [2024-10-11 15:11:42,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 15:11:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4106 transitions. [2024-10-11 15:11:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 15:11:42,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:42,708 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:42,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 15:11:42,708 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:42,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:42,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2120740402, now seen corresponding path program 1 times [2024-10-11 15:11:42,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:42,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169526307] [2024-10-11 15:11:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:42,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 15:11:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 15:11:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:11:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 15:11:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:11:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:11:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 15:11:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:42,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169526307] [2024-10-11 15:11:42,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169526307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:42,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:42,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:11:42,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347106629] [2024-10-11 15:11:42,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:42,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:11:42,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:42,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:11:42,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:42,897 INFO L87 Difference]: Start difference. First operand 2666 states and 4106 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 15:11:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:45,134 INFO L93 Difference]: Finished difference Result 4050 states and 6234 transitions. [2024-10-11 15:11:45,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:11:45,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 2 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 106 [2024-10-11 15:11:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:45,144 INFO L225 Difference]: With dead ends: 4050 [2024-10-11 15:11:45,144 INFO L226 Difference]: Without dead ends: 1410 [2024-10-11 15:11:45,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:45,157 INFO L432 NwaCegarLoop]: 910 mSDtfsCounter, 384 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2988 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:45,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2988 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 15:11:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-10-11 15:11:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1390. [2024-10-11 15:11:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 993 states have (on average 1.4491440080563949) internal successors, (1439), 1038 states have internal predecessors, (1439), 341 states have call successors, (341), 49 states have call predecessors, (341), 49 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2024-10-11 15:11:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2121 transitions. [2024-10-11 15:11:45,247 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2121 transitions. Word has length 106 [2024-10-11 15:11:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:45,247 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2121 transitions. [2024-10-11 15:11:45,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 15:11:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2121 transitions. [2024-10-11 15:11:45,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 15:11:45,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:45,253 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:45,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 15:11:45,254 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting sl_free_bufsErr3ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:45,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:45,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2072118375, now seen corresponding path program 1 times [2024-10-11 15:11:45,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:45,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576608248] [2024-10-11 15:11:45,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:45,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:11:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:11:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:11:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:11:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 15:11:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 15:11:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 15:11:45,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:45,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576608248] [2024-10-11 15:11:45,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576608248] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:45,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999441669] [2024-10-11 15:11:45,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:45,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:45,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:45,491 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:45,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 15:11:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:45,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:11:45,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 15:11:45,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:45,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999441669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:45,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:45,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 15:11:45,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716679905] [2024-10-11 15:11:45,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:45,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:11:45,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:45,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:11:45,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:45,964 INFO L87 Difference]: Start difference. First operand 1390 states and 2121 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 15:11:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:46,401 INFO L93 Difference]: Finished difference Result 2732 states and 4189 transitions. [2024-10-11 15:11:46,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:11:46,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-10-11 15:11:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:46,410 INFO L225 Difference]: With dead ends: 2732 [2024-10-11 15:11:46,410 INFO L226 Difference]: Without dead ends: 1386 [2024-10-11 15:11:46,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:46,415 INFO L432 NwaCegarLoop]: 1244 mSDtfsCounter, 0 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:46,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2481 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 15:11:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-10-11 15:11:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1386. [2024-10-11 15:11:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 990 states have (on average 1.4484848484848485) internal successors, (1434), 1034 states have internal predecessors, (1434), 341 states have call successors, (341), 49 states have call predecessors, (341), 49 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2024-10-11 15:11:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2116 transitions. [2024-10-11 15:11:46,504 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2116 transitions. Word has length 108 [2024-10-11 15:11:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:46,505 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2116 transitions. [2024-10-11 15:11:46,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 15:11:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2116 transitions. [2024-10-11 15:11:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 15:11:46,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:46,510 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:11:46,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 15:11:46,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:46,711 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:46,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:46,712 INFO L85 PathProgramCache]: Analyzing trace with hash -308473827, now seen corresponding path program 1 times [2024-10-11 15:11:46,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:46,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625485001] [2024-10-11 15:11:46,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:46,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:11:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 15:11:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:11:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:11:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 15:11:46,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:46,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625485001] [2024-10-11 15:11:46,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625485001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:46,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:46,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:11:46,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885497399] [2024-10-11 15:11:46,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:46,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:11:46,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:46,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:11:46,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:46,995 INFO L87 Difference]: Start difference. First operand 1386 states and 2116 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 15:11:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:48,894 INFO L93 Difference]: Finished difference Result 2790 states and 4295 transitions. [2024-10-11 15:11:48,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:11:48,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (14), 2 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 106 [2024-10-11 15:11:48,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:48,902 INFO L225 Difference]: With dead ends: 2790 [2024-10-11 15:11:48,902 INFO L226 Difference]: Without dead ends: 1448 [2024-10-11 15:11:48,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:11:48,907 INFO L432 NwaCegarLoop]: 900 mSDtfsCounter, 1417 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:48,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 1996 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 15:11:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2024-10-11 15:11:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1392. [2024-10-11 15:11:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 996 states have (on average 1.4477911646586346) internal successors, (1442), 1040 states have internal predecessors, (1442), 341 states have call successors, (341), 49 states have call predecessors, (341), 49 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2024-10-11 15:11:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2124 transitions. [2024-10-11 15:11:48,992 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2124 transitions. Word has length 106 [2024-10-11 15:11:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:48,993 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 2124 transitions. [2024-10-11 15:11:48,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 15:11:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2124 transitions. [2024-10-11 15:11:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 15:11:48,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:48,999 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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] [2024-10-11 15:11:48,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 15:11:48,999 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:49,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:49,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1219466608, now seen corresponding path program 1 times [2024-10-11 15:11:49,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:49,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899916460] [2024-10-11 15:11:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:49,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 15:11:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:11:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:11:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:11:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 15:11:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 15:11:49,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:49,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899916460] [2024-10-11 15:11:49,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899916460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:49,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:49,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:49,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505765069] [2024-10-11 15:11:49,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:49,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:49,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:49,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:49,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:49,158 INFO L87 Difference]: Start difference. First operand 1392 states and 2124 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:50,826 INFO L93 Difference]: Finished difference Result 2754 states and 4232 transitions. [2024-10-11 15:11:50,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:50,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-10-11 15:11:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:50,834 INFO L225 Difference]: With dead ends: 2754 [2024-10-11 15:11:50,834 INFO L226 Difference]: Without dead ends: 1406 [2024-10-11 15:11:50,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:50,839 INFO L432 NwaCegarLoop]: 895 mSDtfsCounter, 384 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:50,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2172 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 15:11:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-10-11 15:11:50,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1386. [2024-10-11 15:11:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 991 states have (on average 1.4460141271442988) internal successors, (1433), 1034 states have internal predecessors, (1433), 341 states have call successors, (341), 49 states have call predecessors, (341), 49 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2024-10-11 15:11:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2115 transitions. [2024-10-11 15:11:50,922 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2115 transitions. Word has length 117 [2024-10-11 15:11:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:50,922 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2115 transitions. [2024-10-11 15:11:50,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2115 transitions. [2024-10-11 15:11:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 15:11:50,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:50,928 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:11:50,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 15:11:50,928 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:50,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash -481793694, now seen corresponding path program 1 times [2024-10-11 15:11:50,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:50,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104726008] [2024-10-11 15:11:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:50,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:11:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 15:11:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 15:11:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 15:11:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 15:11:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 15:11:51,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104726008] [2024-10-11 15:11:51,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104726008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:51,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:51,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:51,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114074383] [2024-10-11 15:11:51,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:51,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:51,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:51,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:51,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:51,068 INFO L87 Difference]: Start difference. First operand 1386 states and 2115 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 15:11:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:52,719 INFO L93 Difference]: Finished difference Result 2748 states and 4234 transitions. [2024-10-11 15:11:52,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:52,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 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 108 [2024-10-11 15:11:52,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:52,727 INFO L225 Difference]: With dead ends: 2748 [2024-10-11 15:11:52,727 INFO L226 Difference]: Without dead ends: 1406 [2024-10-11 15:11:52,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:52,735 INFO L432 NwaCegarLoop]: 895 mSDtfsCounter, 381 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:52,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2180 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 15:11:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-10-11 15:11:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1386. [2024-10-11 15:11:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 991 states have (on average 1.442986881937437) internal successors, (1430), 1034 states have internal predecessors, (1430), 341 states have call successors, (341), 49 states have call predecessors, (341), 49 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2024-10-11 15:11:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2112 transitions. [2024-10-11 15:11:52,815 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2112 transitions. Word has length 108 [2024-10-11 15:11:52,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:52,816 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2112 transitions. [2024-10-11 15:11:52,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 15:11:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2112 transitions. [2024-10-11 15:11:52,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 15:11:52,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:52,822 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:11:52,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 15:11:52,822 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:52,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:52,823 INFO L85 PathProgramCache]: Analyzing trace with hash -227698928, now seen corresponding path program 1 times [2024-10-11 15:11:52,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:52,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466435698] [2024-10-11 15:11:52,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:52,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:11:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 15:11:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 15:11:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 15:11:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 15:11:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 15:11:53,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:53,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466435698] [2024-10-11 15:11:53,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466435698] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:53,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177263578] [2024-10-11 15:11:53,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:53,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:53,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:53,095 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:53,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 15:11:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:53,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 15:11:53,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:11:53,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:11:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 15:11:53,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177263578] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:11:53,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 15:11:53,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 11 [2024-10-11 15:11:53,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359279785] [2024-10-11 15:11:53,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 15:11:53,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 15:11:53,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:53,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 15:11:53,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-11 15:11:53,949 INFO L87 Difference]: Start difference. First operand 1386 states and 2112 transitions. Second operand has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 4 states have call successors, (38), 4 states have call predecessors, (38), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-10-11 15:11:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:56,542 INFO L93 Difference]: Finished difference Result 2874 states and 4429 transitions. [2024-10-11 15:11:56,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:11:56,543 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 4 states have call successors, (38), 4 states have call predecessors, (38), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 111 [2024-10-11 15:11:56,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:56,551 INFO L225 Difference]: With dead ends: 2874 [2024-10-11 15:11:56,551 INFO L226 Difference]: Without dead ends: 1532 [2024-10-11 15:11:56,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-10-11 15:11:56,556 INFO L432 NwaCegarLoop]: 889 mSDtfsCounter, 1552 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:56,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 2553 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 15:11:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-10-11 15:11:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1396. [2024-10-11 15:11:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1001 states have (on average 1.4425574425574426) internal successors, (1444), 1044 states have internal predecessors, (1444), 341 states have call successors, (341), 49 states have call predecessors, (341), 49 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2024-10-11 15:11:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2126 transitions. [2024-10-11 15:11:56,638 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2126 transitions. Word has length 111 [2024-10-11 15:11:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:56,639 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 2126 transitions. [2024-10-11 15:11:56,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 4 states have call successors, (38), 4 states have call predecessors, (38), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-10-11 15:11:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2126 transitions. [2024-10-11 15:11:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 15:11:56,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:56,645 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-11 15:11:56,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 15:11:56,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 15:11:56,846 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:56,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:56,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1808016481, now seen corresponding path program 2 times [2024-10-11 15:11:56,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:56,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022219677] [2024-10-11 15:11:56,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:56,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:11:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 15:11:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 15:11:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:11:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 15:11:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 15:11:57,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:57,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022219677] [2024-10-11 15:11:57,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022219677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:57,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:57,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:11:57,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998591932] [2024-10-11 15:11:57,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:57,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:11:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:57,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:11:57,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:57,142 INFO L87 Difference]: Start difference. First operand 1396 states and 2126 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:58,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:58,925 INFO L93 Difference]: Finished difference Result 1422 states and 2176 transitions. [2024-10-11 15:11:58,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:11:58,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-10-11 15:11:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:58,932 INFO L225 Difference]: With dead ends: 1422 [2024-10-11 15:11:58,932 INFO L226 Difference]: Without dead ends: 1420 [2024-10-11 15:11:58,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:58,933 INFO L432 NwaCegarLoop]: 894 mSDtfsCounter, 381 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2931 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:58,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2931 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 15:11:58,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-10-11 15:11:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1396. [2024-10-11 15:11:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1001 states have (on average 1.4425574425574426) internal successors, (1444), 1044 states have internal predecessors, (1444), 341 states have call successors, (341), 49 states have call predecessors, (341), 49 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2024-10-11 15:11:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2126 transitions. [2024-10-11 15:11:59,021 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2126 transitions. Word has length 117 [2024-10-11 15:11:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:59,022 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 2126 transitions. [2024-10-11 15:11:59,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2126 transitions. [2024-10-11 15:11:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 15:11:59,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:59,029 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:59,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 15:11:59,029 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:59,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:59,030 INFO L85 PathProgramCache]: Analyzing trace with hash -239582564, now seen corresponding path program 1 times [2024-10-11 15:11:59,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:59,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450552162] [2024-10-11 15:11:59,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:11:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 15:11:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 15:11:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:11:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 15:11:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 15:11:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 15:11:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 15:11:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 15:11:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 15:11:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 15:11:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 15:11:59,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:59,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450552162] [2024-10-11 15:11:59,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450552162] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:59,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826465493] [2024-10-11 15:11:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:59,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:59,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:59,555 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:59,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 15:12:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:12:00,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 15:12:00,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:12:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 15:12:00,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:12:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 15:12:00,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826465493] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:12:00,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 15:12:00,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 21 [2024-10-11 15:12:00,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99774306] [2024-10-11 15:12:00,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 15:12:00,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 15:12:00,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:12:00,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 15:12:00,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2024-10-11 15:12:00,661 INFO L87 Difference]: Start difference. First operand 1396 states and 2126 transitions. Second operand has 21 states, 21 states have (on average 8.619047619047619) internal successors, (181), 19 states have internal predecessors, (181), 4 states have call successors, (55), 5 states have call predecessors, (55), 3 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49)