./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 a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6e17534f736f8f0727327ccce9421d9a9e89801b3a6ab68095fc479caa060175 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 07:51:44,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 07:51:44,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-13 07:51:44,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 07:51:44,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 07:51:44,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 07:51:44,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 07:51:44,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 07:51:44,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 07:51:44,540 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 07:51:44,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 07:51:44,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 07:51:44,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 07:51:44,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 07:51:44,541 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 07:51:44,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 07:51:44,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 07:51:44,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 07:51:44,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 07:51:44,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 07:51:44,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 07:51:44,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 07:51:44,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 07:51:44,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 07:51:44,544 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 07:51:44,544 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 07:51:44,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 07:51:44,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 07:51:44,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 07:51:44,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 07:51:44,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 07:51:44,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 07:51:44,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 07:51:44,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 07:51:44,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 07:51:44,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 07:51:44,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 07:51:44,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 07:51:44,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 07:51:44,548 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/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/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-13 07:51:44,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 07:51:44,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 07:51:44,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 07:51:44,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 07:51:44,747 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 07:51:44,749 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-13 07:51:46,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 07:51:46,535 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 07:51:46,536 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-13 07:51:46,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e98a055/24e37d5a895d4fa19db2cbb30f43b6a8/FLAG7b838442b [2024-10-13 07:51:46,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e98a055/24e37d5a895d4fa19db2cbb30f43b6a8 [2024-10-13 07:51:46,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 07:51:46,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 07:51:46,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 07:51:46,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 07:51:46,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 07:51:46,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:51:46" (1/1) ... [2024-10-13 07:51:46,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2226111f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:46, skipping insertion in model container [2024-10-13 07:51:46,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:51:46" (1/1) ... [2024-10-13 07:51:46,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 07:51:48,170 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-13 07:51:48,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 07:51:48,218 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 07:51:48,301 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-13 07:51:48,302 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-13 07:51:48,303 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-13 07:51:48,303 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-13 07:51:48,305 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4750] [2024-10-13 07:51:48,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4753] [2024-10-13 07:51:48,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4756] [2024-10-13 07:51:48,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4759] [2024-10-13 07:51:48,324 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-13 07:51:48,325 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-13 07:51:48,325 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-13 07:51:48,325 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-13 07:51:48,326 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-13 07:51:48,326 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-13 07:51:48,327 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-13 07:51:48,327 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-13 07:51:48,327 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-13 07:51:48,328 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-13 07:51:48,329 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-13 07:51:48,329 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-13 07:51:48,329 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-13 07:51:48,329 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-13 07:51:48,330 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-13 07:51:48,330 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-13 07:51:48,332 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-13 07:51:48,332 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-13 07:51:48,332 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-13 07:51:48,333 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-13 07:51:48,333 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-13 07:51:48,334 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-13 07:51:48,334 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-13 07:51:48,334 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-13 07:51:48,334 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-13 07:51:48,335 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-13 07:51:48,335 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-13 07:51:48,335 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-13 07:51:48,336 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-13 07:51:48,336 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-13 07:51:48,336 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-13 07:51:48,336 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-13 07:51:48,338 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-13 07:51:48,340 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-13 07:51:48,341 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-13 07:51:48,341 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-13 07:51:48,341 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-13 07:51:48,342 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-13 07:51:48,342 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-13 07:51:48,342 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-13 07:51:48,342 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-13 07:51:48,342 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-13 07:51:48,343 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-13 07:51:48,343 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-13 07:51:48,418 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-13 07:51:48,419 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-13 07:51:48,419 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-13 07:51:48,420 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-13 07:51:48,420 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-13 07:51:48,421 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-13 07:51:48,421 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-13 07:51:48,421 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-13 07:51:48,422 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-13 07:51:48,422 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-13 07:51:48,425 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-13 07:51:48,425 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-13 07:51:48,425 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-13 07:51:48,426 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-13 07:51:48,427 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-13 07:51:48,429 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-13 07:51:48,430 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-13 07:51:48,430 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-13 07:51:48,431 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-13 07:51:48,431 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-13 07:51:48,432 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-13 07:51:48,433 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-13 07:51:48,433 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-13 07:51:48,433 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-13 07:51:48,434 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-13 07:51:48,435 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-13 07:51:48,436 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-13 07:51:48,436 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-13 07:51:48,437 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-13 07:51:48,437 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-13 07:51:48,466 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-13 07:51:48,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 07:51:48,630 INFO L204 MainTranslator]: Completed translation [2024-10-13 07:51:48,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:48 WrapperNode [2024-10-13 07:51:48,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 07:51:48,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 07:51:48,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 07:51:48,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 07:51:48,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:48" (1/1) ... [2024-10-13 07:51:48,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:48" (1/1) ... [2024-10-13 07:51:48,983 INFO L138 Inliner]: procedures = 157, calls = 809, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 3028 [2024-10-13 07:51:48,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 07:51:48,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 07:51:48,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 07:51:48,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 07:51:49,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:48" (1/1) ... [2024-10-13 07:51:49,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:48" (1/1) ... [2024-10-13 07:51:49,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:48" (1/1) ... [2024-10-13 07:51:49,365 INFO L175 MemorySlicer]: Split 415 memory accesses to 11 slices as follows [2, 334, 12, 3, 4, 1, 35, 2, 1, 20, 1]. 80 percent of accesses are in the largest equivalence class. The 62 initializations are split as follows [2, 5, 0, 0, 0, 0, 35, 0, 0, 20, 0]. The 119 writes are split as follows [0, 105, 12, 0, 1, 1, 0, 0, 0, 0, 0]. [2024-10-13 07:51:49,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:48" (1/1) ... [2024-10-13 07:51:49,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:48" (1/1) ... [2024-10-13 07:51:49,413 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:48" (1/1) ... [2024-10-13 07:51:49,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:48" (1/1) ... [2024-10-13 07:51:49,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:48" (1/1) ... [2024-10-13 07:51:49,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:48" (1/1) ... [2024-10-13 07:51:49,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 07:51:49,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 07:51:49,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 07:51:49,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 07:51:49,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:48" (1/1) ... [2024-10-13 07:51:49,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 07:51:49,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:51:49,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 07:51:49,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 07:51:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-13 07:51:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-13 07:51:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-13 07:51:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-13 07:51:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-13 07:51:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-13 07:51:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-13 07:51:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-13 07:51:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-13 07:51:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-13 07:51:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-10-13 07:51:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-13 07:51:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-13 07:51:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-13 07:51:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-13 07:51:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-13 07:51:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-13 07:51:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-13 07:51:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-13 07:51:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-10-13 07:51:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2024-10-13 07:51:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2024-10-13 07:51:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-13 07:51:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-13 07:51:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-13 07:51:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-13 07:51:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-13 07:51:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-13 07:51:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-13 07:51:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-13 07:51:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-10-13 07:51:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-10-13 07:51:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2024-10-13 07:51:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2024-10-13 07:51:49,552 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2024-10-13 07:51:49,552 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2024-10-13 07:51:49,552 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-10-13 07:51:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-10-13 07:51:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2024-10-13 07:51:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2024-10-13 07:51:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2024-10-13 07:51:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2024-10-13 07:51:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2024-10-13 07:51:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2024-10-13 07:51:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2024-10-13 07:51:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2024-10-13 07:51:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2024-10-13 07:51:49,553 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-10-13 07:51:49,553 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-10-13 07:51:49,553 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2024-10-13 07:51:49,553 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2024-10-13 07:51:49,553 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2024-10-13 07:51:49,553 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2024-10-13 07:51:49,553 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2024-10-13 07:51:49,553 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2024-10-13 07:51:49,553 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2024-10-13 07:51:49,553 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2024-10-13 07:51:49,553 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2024-10-13 07:51:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2024-10-13 07:51:49,554 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2024-10-13 07:51:49,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-13 07:51:49,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-13 07:51:49,554 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2024-10-13 07:51:49,554 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2024-10-13 07:51:49,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2024-10-13 07:51:49,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2024-10-13 07:51:49,554 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2024-10-13 07:51:49,554 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2024-10-13 07:51:49,554 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-13 07:51:49,555 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-13 07:51:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2024-10-13 07:51:49,556 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2024-10-13 07:51:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 07:51:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 07:51:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 07:51:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 07:51:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 07:51:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 07:51:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 07:51:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 07:51:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-13 07:51:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-13 07:51:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-13 07:51:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2024-10-13 07:51:49,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2024-10-13 07:51:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2024-10-13 07:51:49,557 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2024-10-13 07:51:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2024-10-13 07:51:49,558 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2024-10-13 07:51:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-13 07:51:49,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-13 07:51:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2024-10-13 07:51:49,558 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2024-10-13 07:51:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2024-10-13 07:51:49,558 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2024-10-13 07:51:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 07:51:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2024-10-13 07:51:49,559 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2024-10-13 07:51:49,559 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2024-10-13 07:51:49,560 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2024-10-13 07:51:49,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 07:51:49,560 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2024-10-13 07:51:49,560 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2024-10-13 07:51:49,560 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2024-10-13 07:51:49,560 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2024-10-13 07:51:49,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 07:51:49,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 07:51:49,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 07:51:49,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 07:51:49,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 07:51:49,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-13 07:51:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-13 07:51:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-13 07:51:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-13 07:51:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-13 07:51:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-13 07:51:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-13 07:51:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2024-10-13 07:51:49,561 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2024-10-13 07:51:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 07:51:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 07:51:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 07:51:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 07:51:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-13 07:51:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-13 07:51:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-13 07:51:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-13 07:51:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-13 07:51:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-13 07:51:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-13 07:51:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2024-10-13 07:51:49,562 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2024-10-13 07:51:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2024-10-13 07:51:49,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2024-10-13 07:51:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2024-10-13 07:51:49,563 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2024-10-13 07:51:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2024-10-13 07:51:49,563 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2024-10-13 07:51:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2024-10-13 07:51:49,563 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2024-10-13 07:51:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 07:51:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2024-10-13 07:51:49,563 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2024-10-13 07:51:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 07:51:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 07:51:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 07:51:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-13 07:51:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-13 07:51:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-13 07:51:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-13 07:51:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-13 07:51:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-13 07:51:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-13 07:51:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-13 07:51:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2024-10-13 07:51:49,564 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2024-10-13 07:51:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2024-10-13 07:51:49,564 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2024-10-13 07:51:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2024-10-13 07:51:49,564 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2024-10-13 07:51:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-13 07:51:49,564 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-13 07:51:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-13 07:51:49,565 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-13 07:51:49,565 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2024-10-13 07:51:49,565 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2024-10-13 07:51:49,565 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2024-10-13 07:51:49,565 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2024-10-13 07:51:49,565 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2024-10-13 07:51:49,565 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2024-10-13 07:51:49,565 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2024-10-13 07:51:49,565 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2024-10-13 07:51:49,567 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2024-10-13 07:51:49,567 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2024-10-13 07:51:49,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 07:51:49,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 07:51:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 07:51:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 07:51:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 07:51:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 07:51:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 07:51:49,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 07:51:49,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-13 07:51:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-13 07:51:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-13 07:51:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2024-10-13 07:51:49,571 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2024-10-13 07:51:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2024-10-13 07:51:49,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2024-10-13 07:51:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2024-10-13 07:51:49,571 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2024-10-13 07:51:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2024-10-13 07:51:49,571 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2024-10-13 07:51:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-13 07:51:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-13 07:51:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-13 07:51:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-13 07:51:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-13 07:51:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-13 07:51:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-13 07:51:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-13 07:51:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-10-13 07:51:49,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2024-10-13 07:51:49,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2024-10-13 07:51:49,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 07:51:49,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 07:51:49,572 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2024-10-13 07:51:49,572 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2024-10-13 07:51:49,572 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2024-10-13 07:51:49,572 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2024-10-13 07:51:49,975 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 07:51:49,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 07:51:52,058 INFO L? ?]: Removed 1466 outVars from TransFormulas that were not future-live. [2024-10-13 07:51:52,058 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 07:51:52,186 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 07:51:52,187 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-13 07:51:52,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:52 BoogieIcfgContainer [2024-10-13 07:51:52,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 07:51:52,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 07:51:52,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 07:51:52,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 07:51:52,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:51:46" (1/3) ... [2024-10-13 07:51:52,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ec6dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:51:52, skipping insertion in model container [2024-10-13 07:51:52,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:48" (2/3) ... [2024-10-13 07:51:52,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ec6dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:51:52, skipping insertion in model container [2024-10-13 07:51:52,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:52" (3/3) ... [2024-10-13 07:51:52,193 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2024-10-13 07:51:52,205 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 07:51:52,205 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-10-13 07:51:52,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 07:51:52,267 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;@29d8daad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 07:51:52,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-13 07:51:52,272 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-13 07:51:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 07:51:52,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:52,283 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-13 07:51:52,283 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-13 07:51:52,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:52,287 INFO L85 PathProgramCache]: Analyzing trace with hash -883939047, now seen corresponding path program 1 times [2024-10-13 07:51:52,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:52,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345704982] [2024-10-13 07:51:52,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:52,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:52,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:51:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:52,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:51:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:52,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:51:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:52,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:51:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:52,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:52,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:52,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:51:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:52,713 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-13 07:51:52,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:52,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345704982] [2024-10-13 07:51:52,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345704982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:52,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:52,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:51:52,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548942048] [2024-10-13 07:51:52,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:52,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:51:52,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:52,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:51:52,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:51:52,737 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-13 07:51:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:54,295 INFO L93 Difference]: Finished difference Result 1932 states and 3010 transitions. [2024-10-13 07:51:54,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:51:54,301 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-13 07:51:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:54,322 INFO L225 Difference]: With dead ends: 1932 [2024-10-13 07:51:54,322 INFO L226 Difference]: Without dead ends: 939 [2024-10-13 07:51:54,330 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-13 07:51:54,333 INFO L432 NwaCegarLoop]: 989 mSDtfsCounter, 1554 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:54,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 1562 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 07:51:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-10-13 07:51:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 925. [2024-10-13 07:51:54,427 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-13 07:51:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1391 transitions. [2024-10-13 07:51:54,435 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1391 transitions. Word has length 66 [2024-10-13 07:51:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:54,435 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1391 transitions. [2024-10-13 07:51:54,435 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-13 07:51:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1391 transitions. [2024-10-13 07:51:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 07:51:54,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:54,441 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-13 07:51:54,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 07:51:54,442 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-13 07:51:54,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:54,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1382442139, now seen corresponding path program 1 times [2024-10-13 07:51:54,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:54,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4777153] [2024-10-13 07:51:54,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:54,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:54,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:54,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:54,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:51:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:54,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:51:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:54,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:51:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:54,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:51:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:54,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:54,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:54,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:51:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:54,677 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-13 07:51:54,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:54,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4777153] [2024-10-13 07:51:54,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4777153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:54,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:54,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 07:51:54,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584826736] [2024-10-13 07:51:54,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:54,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 07:51:54,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:54,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 07:51:54,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 07:51:54,680 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-13 07:51:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:56,971 INFO L93 Difference]: Finished difference Result 943 states and 1423 transitions. [2024-10-13 07:51:56,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 07:51:56,972 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-13 07:51:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:56,977 INFO L225 Difference]: With dead ends: 943 [2024-10-13 07:51:56,977 INFO L226 Difference]: Without dead ends: 941 [2024-10-13 07:51:56,978 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-13 07:51:56,978 INFO L432 NwaCegarLoop]: 939 mSDtfsCounter, 397 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:56,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 3088 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 07:51:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-10-13 07:51:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 927. [2024-10-13 07:51:57,006 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-13 07:51:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1393 transitions. [2024-10-13 07:51:57,010 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1393 transitions. Word has length 66 [2024-10-13 07:51:57,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:57,011 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1393 transitions. [2024-10-13 07:51:57,011 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-13 07:51:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1393 transitions. [2024-10-13 07:51:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 07:51:57,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:57,013 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-13 07:51:57,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 07:51:57,013 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-13 07:51:57,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1242471176, now seen corresponding path program 1 times [2024-10-13 07:51:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092847664] [2024-10-13 07:51:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:57,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:57,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:57,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:51:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:51:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:57,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:51:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:57,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:51:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:57,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:57,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:57,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 07:51:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:57,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 07:51:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:57,222 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-13 07:51:57,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:57,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092847664] [2024-10-13 07:51:57,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092847664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:57,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:57,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:51:57,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541401950] [2024-10-13 07:51:57,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:57,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:51:57,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:57,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:51:57,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:51:57,225 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-13 07:51:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:59,621 INFO L93 Difference]: Finished difference Result 2325 states and 3565 transitions. [2024-10-13 07:51:59,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:51:59,622 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-13 07:51:59,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:59,636 INFO L225 Difference]: With dead ends: 2325 [2024-10-13 07:51:59,636 INFO L226 Difference]: Without dead ends: 1426 [2024-10-13 07:51:59,640 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-13 07:51:59,642 INFO L432 NwaCegarLoop]: 948 mSDtfsCounter, 925 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:59,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 2275 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 07:51:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-10-13 07:51:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1396. [2024-10-13 07:51:59,714 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-13 07:51:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2162 transitions. [2024-10-13 07:51:59,722 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2162 transitions. Word has length 68 [2024-10-13 07:51:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:59,723 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 2162 transitions. [2024-10-13 07:51:59,723 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-13 07:51:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2162 transitions. [2024-10-13 07:51:59,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-13 07:51:59,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:59,728 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-13 07:51:59,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 07:51:59,728 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-13 07:51:59,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:59,728 INFO L85 PathProgramCache]: Analyzing trace with hash 890001953, now seen corresponding path program 1 times [2024-10-13 07:51:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:59,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383041290] [2024-10-13 07:51:59,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:59,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:59,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:59,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:51:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:59,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:51:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:59,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:51:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:59,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:51:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:59,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:59,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:59,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:51:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:59,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 07:51:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:00,001 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-13 07:52:00,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:00,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383041290] [2024-10-13 07:52:00,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383041290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:00,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:00,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 07:52:00,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418383265] [2024-10-13 07:52:00,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:00,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 07:52:00,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:00,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 07:52:00,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 07:52:00,005 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-13 07:52:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:02,375 INFO L93 Difference]: Finished difference Result 2796 states and 4352 transitions. [2024-10-13 07:52:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 07:52:02,376 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-13 07:52:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:02,386 INFO L225 Difference]: With dead ends: 2796 [2024-10-13 07:52:02,387 INFO L226 Difference]: Without dead ends: 1428 [2024-10-13 07:52:02,394 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-13 07:52:02,396 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 1480 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:02,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 2092 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 07:52:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-10-13 07:52:02,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1398. [2024-10-13 07:52:02,454 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-13 07:52:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2164 transitions. [2024-10-13 07:52:02,461 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2164 transitions. Word has length 75 [2024-10-13 07:52:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:02,462 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2164 transitions. [2024-10-13 07:52:02,462 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-13 07:52:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2164 transitions. [2024-10-13 07:52:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-13 07:52:02,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:02,465 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-13 07:52:02,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 07:52:02,465 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-13 07:52:02,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash -52605181, now seen corresponding path program 1 times [2024-10-13 07:52:02,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:02,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842347621] [2024-10-13 07:52:02,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:02,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:02,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:02,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:02,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:02,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:02,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:02,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:02,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:02,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:02,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:52:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:02,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:52:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:02,726 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-13 07:52:02,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:02,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842347621] [2024-10-13 07:52:02,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842347621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:02,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:02,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 07:52:02,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896597228] [2024-10-13 07:52:02,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:02,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 07:52:02,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:02,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 07:52:02,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 07:52:02,730 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-13 07:52:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:06,597 INFO L93 Difference]: Finished difference Result 1444 states and 2247 transitions. [2024-10-13 07:52:06,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 07:52:06,598 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-13 07:52:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:06,606 INFO L225 Difference]: With dead ends: 1444 [2024-10-13 07:52:06,606 INFO L226 Difference]: Without dead ends: 1442 [2024-10-13 07:52:06,607 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-13 07:52:06,608 INFO L432 NwaCegarLoop]: 949 mSDtfsCounter, 512 mSDsluCounter, 2859 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 3808 SdHoareTripleChecker+Invalid, 2640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:06,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 3808 Invalid, 2640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-13 07:52:06,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2024-10-13 07:52:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1402. [2024-10-13 07:52:06,653 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-13 07:52:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2170 transitions. [2024-10-13 07:52:06,660 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2170 transitions. Word has length 76 [2024-10-13 07:52:06,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:06,660 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 2170 transitions. [2024-10-13 07:52:06,660 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-13 07:52:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2170 transitions. [2024-10-13 07:52:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 07:52:06,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:06,663 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-13 07:52:06,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 07:52:06,663 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-13 07:52:06,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:06,664 INFO L85 PathProgramCache]: Analyzing trace with hash 671980406, now seen corresponding path program 1 times [2024-10-13 07:52:06,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:06,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516920295] [2024-10-13 07:52:06,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:06,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:06,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:06,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:06,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:06,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:06,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:06,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:06,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:06,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-13 07:52:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:06,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 07:52:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:06,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:52:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:06,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 07:52:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:06,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 07:52:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:06,865 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-13 07:52:06,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:06,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516920295] [2024-10-13 07:52:06,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516920295] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:52:06,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255356049] [2024-10-13 07:52:06,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:06,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:52:06,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:52:06,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:52:06,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 07:52:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:07,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 07:52:07,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:52:07,384 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-13 07:52:07,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 07:52:07,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255356049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:07,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 07:52:07,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-13 07:52:07,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095023507] [2024-10-13 07:52:07,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:07,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:52:07,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:07,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:52:07,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 07:52:07,387 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-13 07:52:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:07,909 INFO L93 Difference]: Finished difference Result 2772 states and 4299 transitions. [2024-10-13 07:52:07,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:52:07,909 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-13 07:52:07,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:07,915 INFO L225 Difference]: With dead ends: 2772 [2024-10-13 07:52:07,915 INFO L226 Difference]: Without dead ends: 1398 [2024-10-13 07:52:07,918 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-13 07:52:07,918 INFO L432 NwaCegarLoop]: 1294 mSDtfsCounter, 0 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-13 07:52:07,919 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-13 07:52:07,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-13 07:52:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2024-10-13 07:52:07,948 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-13 07:52:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2165 transitions. [2024-10-13 07:52:07,953 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2165 transitions. Word has length 84 [2024-10-13 07:52:07,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:07,954 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2165 transitions. [2024-10-13 07:52:07,954 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-13 07:52:07,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2165 transitions. [2024-10-13 07:52:07,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 07:52:07,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:07,956 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-13 07:52:08,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 07:52:08,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 07:52:08,160 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-13 07:52:08,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash 792813936, now seen corresponding path program 1 times [2024-10-13 07:52:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:08,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638440312] [2024-10-13 07:52:08,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:08,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:08,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:08,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:08,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:08,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:08,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:08,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:08,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:08,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:08,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 07:52:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:08,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:52:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:08,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 07:52:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:08,305 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-13 07:52:08,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:08,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638440312] [2024-10-13 07:52:08,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638440312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:08,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:08,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:52:08,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901508682] [2024-10-13 07:52:08,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:08,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:52:08,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:08,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:52:08,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:52:08,309 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-13 07:52:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:10,359 INFO L93 Difference]: Finished difference Result 2778 states and 4337 transitions. [2024-10-13 07:52:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:52:10,360 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-13 07:52:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:10,366 INFO L225 Difference]: With dead ends: 2778 [2024-10-13 07:52:10,367 INFO L226 Difference]: Without dead ends: 1408 [2024-10-13 07:52:10,370 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-13 07:52:10,371 INFO L432 NwaCegarLoop]: 952 mSDtfsCounter, 387 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:10,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 2316 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 07:52:10,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-10-13 07:52:10,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1394. [2024-10-13 07:52:10,406 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-13 07:52:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2160 transitions. [2024-10-13 07:52:10,411 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2160 transitions. Word has length 85 [2024-10-13 07:52:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:10,412 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2160 transitions. [2024-10-13 07:52:10,412 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-13 07:52:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2160 transitions. [2024-10-13 07:52:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 07:52:10,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:10,414 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-13 07:52:10,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 07:52:10,414 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-13 07:52:10,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:10,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1553195907, now seen corresponding path program 1 times [2024-10-13 07:52:10,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:10,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743890886] [2024-10-13 07:52:10,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:10,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-13 07:52:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 07:52:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:52:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 07:52:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 07:52:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 07:52:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:10,608 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-13 07:52:10,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:10,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743890886] [2024-10-13 07:52:10,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743890886] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:52:10,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439601777] [2024-10-13 07:52:10,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:10,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:52:10,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:52:10,611 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:52:10,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 07:52:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:11,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 07:52:11,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:52:11,108 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-13 07:52:11,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 07:52:11,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439601777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:11,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 07:52:11,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-13 07:52:11,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657535705] [2024-10-13 07:52:11,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:11,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:52:11,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:11,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:52:11,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:52:11,111 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-13 07:52:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:11,732 INFO L93 Difference]: Finished difference Result 2760 states and 4283 transitions. [2024-10-13 07:52:11,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:52:11,733 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-13 07:52:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:11,743 INFO L225 Difference]: With dead ends: 2760 [2024-10-13 07:52:11,743 INFO L226 Difference]: Without dead ends: 1394 [2024-10-13 07:52:11,749 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-13 07:52:11,751 INFO L432 NwaCegarLoop]: 1284 mSDtfsCounter, 0 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:11,751 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.6s Time] [2024-10-13 07:52:11,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-10-13 07:52:11,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2024-10-13 07:52:11,812 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-13 07:52:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2157 transitions. [2024-10-13 07:52:11,821 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2157 transitions. Word has length 89 [2024-10-13 07:52:11,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:11,822 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2157 transitions. [2024-10-13 07:52:11,822 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-13 07:52:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2157 transitions. [2024-10-13 07:52:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 07:52:11,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:11,826 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-13 07:52:11,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 07:52:12,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-13 07:52:12,028 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-13 07:52:12,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:12,029 INFO L85 PathProgramCache]: Analyzing trace with hash 717557302, now seen corresponding path program 1 times [2024-10-13 07:52:12,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:12,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745828852] [2024-10-13 07:52:12,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:12,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-13 07:52:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 07:52:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:52:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 07:52:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 07:52:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 07:52:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,297 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-13 07:52:12,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:12,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745828852] [2024-10-13 07:52:12,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745828852] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:52:12,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113886701] [2024-10-13 07:52:12,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:12,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:52:12,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:52:12,304 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:52:12,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 07:52:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:12,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 07:52:12,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:52:12,875 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-13 07:52:12,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 07:52:12,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113886701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:12,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 07:52:12,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-13 07:52:12,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602594779] [2024-10-13 07:52:12,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:12,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:52:12,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:12,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:52:12,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:52:12,877 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-13 07:52:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:13,575 INFO L93 Difference]: Finished difference Result 2756 states and 4273 transitions. [2024-10-13 07:52:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:52:13,576 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-13 07:52:13,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:13,585 INFO L225 Difference]: With dead ends: 2756 [2024-10-13 07:52:13,585 INFO L226 Difference]: Without dead ends: 1390 [2024-10-13 07:52:13,589 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-13 07:52:13,590 INFO L432 NwaCegarLoop]: 1281 mSDtfsCounter, 0 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:13,590 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.7s Time] [2024-10-13 07:52:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-10-13 07:52:13,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1390. [2024-10-13 07:52:13,632 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-13 07:52:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2152 transitions. [2024-10-13 07:52:13,639 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2152 transitions. Word has length 92 [2024-10-13 07:52:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:13,640 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2152 transitions. [2024-10-13 07:52:13,640 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-13 07:52:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2152 transitions. [2024-10-13 07:52:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 07:52:13,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:13,644 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-13 07:52:13,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 07:52:13,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:52:13,846 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-13 07:52:13,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash 363285868, now seen corresponding path program 1 times [2024-10-13 07:52:13,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:13,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598708652] [2024-10-13 07:52:13,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:13,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:13,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:13,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:13,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:13,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:13,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:13,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 07:52:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:13,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:52:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:13,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 07:52:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:13,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:13,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 07:52:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:14,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:14,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 07:52:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:14,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:14,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 07:52:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:14,021 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-13 07:52:14,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:14,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598708652] [2024-10-13 07:52:14,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598708652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:14,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:14,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:52:14,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664377844] [2024-10-13 07:52:14,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:14,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:52:14,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:14,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:52:14,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:52:14,023 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-13 07:52:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:16,283 INFO L93 Difference]: Finished difference Result 2760 states and 4295 transitions. [2024-10-13 07:52:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:52:16,284 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-13 07:52:16,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:16,291 INFO L225 Difference]: With dead ends: 2760 [2024-10-13 07:52:16,291 INFO L226 Difference]: Without dead ends: 1398 [2024-10-13 07:52:16,294 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-13 07:52:16,295 INFO L432 NwaCegarLoop]: 937 mSDtfsCounter, 384 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:16,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2271 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 07:52:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-13 07:52:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1384. [2024-10-13 07:52:16,325 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-13 07:52:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2143 transitions. [2024-10-13 07:52:16,330 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2143 transitions. Word has length 107 [2024-10-13 07:52:16,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:16,331 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2143 transitions. [2024-10-13 07:52:16,331 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-13 07:52:16,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2143 transitions. [2024-10-13 07:52:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 07:52:16,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:16,334 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-13 07:52:16,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 07:52:16,335 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-13 07:52:16,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:16,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1052330697, now seen corresponding path program 1 times [2024-10-13 07:52:16,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:16,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119762204] [2024-10-13 07:52:16,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:16,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-13 07:52:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 07:52:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:52:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 07:52:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 07:52:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 07:52:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 07:52:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,481 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-13 07:52:16,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:16,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119762204] [2024-10-13 07:52:16,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119762204] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:52:16,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377699322] [2024-10-13 07:52:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:16,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:52:16,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:52:16,483 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:52:16,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 07:52:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:16,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 07:52:16,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:52:16,881 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-13 07:52:16,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 07:52:16,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377699322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:16,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 07:52:16,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-13 07:52:16,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731246671] [2024-10-13 07:52:16,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:16,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:52:16,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:16,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:52:16,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:52:16,883 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-13 07:52:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:17,398 INFO L93 Difference]: Finished difference Result 2740 states and 4249 transitions. [2024-10-13 07:52:17,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:52:17,399 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-13 07:52:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:17,406 INFO L225 Difference]: With dead ends: 2740 [2024-10-13 07:52:17,407 INFO L226 Difference]: Without dead ends: 1384 [2024-10-13 07:52:17,411 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-13 07:52:17,411 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-13 07:52:17,412 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-13 07:52:17,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-10-13 07:52:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2024-10-13 07:52:17,442 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-13 07:52:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2140 transitions. [2024-10-13 07:52:17,448 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2140 transitions. Word has length 97 [2024-10-13 07:52:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:17,448 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2140 transitions. [2024-10-13 07:52:17,449 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-13 07:52:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2140 transitions. [2024-10-13 07:52:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 07:52:17,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:17,452 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-13 07:52:17,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 07:52:17,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:52:17,656 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-13 07:52:17,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash 109287725, now seen corresponding path program 1 times [2024-10-13 07:52:17,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:17,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889106353] [2024-10-13 07:52:17,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:17,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 07:52:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:52:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 07:52:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 07:52:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 07:52:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 07:52:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:17,857 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-13 07:52:17,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:17,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889106353] [2024-10-13 07:52:17,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889106353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:17,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:17,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:52:17,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501827631] [2024-10-13 07:52:17,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:17,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:52:17,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:17,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:52:17,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:52:17,858 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-13 07:52:19,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:19,343 INFO L93 Difference]: Finished difference Result 2754 states and 4278 transitions. [2024-10-13 07:52:19,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:52:19,343 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-13 07:52:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:19,349 INFO L225 Difference]: With dead ends: 2754 [2024-10-13 07:52:19,349 INFO L226 Difference]: Without dead ends: 1398 [2024-10-13 07:52:19,352 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-13 07:52:19,353 INFO L432 NwaCegarLoop]: 929 mSDtfsCounter, 384 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:19,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2255 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 07:52:19,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-13 07:52:19,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1384. [2024-10-13 07:52:19,392 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-13 07:52:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2134 transitions. [2024-10-13 07:52:19,400 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2134 transitions. Word has length 109 [2024-10-13 07:52:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:19,401 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2134 transitions. [2024-10-13 07:52:19,401 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-13 07:52:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2134 transitions. [2024-10-13 07:52:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 07:52:19,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:19,406 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-13 07:52:19,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 07:52:19,406 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-13 07:52:19,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:19,406 INFO L85 PathProgramCache]: Analyzing trace with hash 362167959, now seen corresponding path program 1 times [2024-10-13 07:52:19,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:19,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970984096] [2024-10-13 07:52:19,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:19,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-13 07:52:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 07:52:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:52:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 07:52:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 07:52:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 07:52:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 07:52:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,592 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-13 07:52:19,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:19,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970984096] [2024-10-13 07:52:19,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970984096] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:52:19,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286499893] [2024-10-13 07:52:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:19,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:52:19,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:52:19,597 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:52:19,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 07:52:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:19,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 07:52:19,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:52:20,011 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-13 07:52:20,011 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 07:52:20,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286499893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:20,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 07:52:20,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-13 07:52:20,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316275524] [2024-10-13 07:52:20,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:20,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:52:20,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:20,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:52:20,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:52:20,013 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-13 07:52:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:20,337 INFO L93 Difference]: Finished difference Result 2736 states and 4227 transitions. [2024-10-13 07:52:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:52:20,340 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-13 07:52:20,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:20,350 INFO L225 Difference]: With dead ends: 2736 [2024-10-13 07:52:20,350 INFO L226 Difference]: Without dead ends: 1380 [2024-10-13 07:52:20,356 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-13 07:52:20,356 INFO L432 NwaCegarLoop]: 1265 mSDtfsCounter, 0 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:20,357 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.3s Time] [2024-10-13 07:52:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-10-13 07:52:20,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1380. [2024-10-13 07:52:20,387 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-13 07:52:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2129 transitions. [2024-10-13 07:52:20,394 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2129 transitions. Word has length 100 [2024-10-13 07:52:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:20,395 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2129 transitions. [2024-10-13 07:52:20,395 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-13 07:52:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2129 transitions. [2024-10-13 07:52:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 07:52:20,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:20,398 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-13 07:52:20,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 07:52:20,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 07:52:20,598 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-13 07:52:20,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash -951940388, now seen corresponding path program 1 times [2024-10-13 07:52:20,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:20,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326679724] [2024-10-13 07:52:20,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:20,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 07:52:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:52:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 07:52:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 07:52:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 07:52:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 07:52:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:20,737 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-13 07:52:20,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:20,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326679724] [2024-10-13 07:52:20,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326679724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:20,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:20,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:52:20,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442115] [2024-10-13 07:52:20,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:20,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:52:20,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:20,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:52:20,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:52:20,738 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-13 07:52:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:22,359 INFO L93 Difference]: Finished difference Result 2740 states and 4249 transitions. [2024-10-13 07:52:22,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:52:22,364 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-13 07:52:22,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:22,376 INFO L225 Difference]: With dead ends: 2740 [2024-10-13 07:52:22,376 INFO L226 Difference]: Without dead ends: 1388 [2024-10-13 07:52:22,380 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-13 07:52:22,380 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-13 07:52:22,381 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-13 07:52:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-10-13 07:52:22,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1374. [2024-10-13 07:52:22,419 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-13 07:52:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2120 transitions. [2024-10-13 07:52:22,426 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2120 transitions. Word has length 112 [2024-10-13 07:52:22,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:22,426 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2120 transitions. [2024-10-13 07:52:22,426 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-13 07:52:22,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2120 transitions. [2024-10-13 07:52:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 07:52:22,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:22,431 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-13 07:52:22,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 07:52:22,431 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-13 07:52:22,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1102758115, now seen corresponding path program 1 times [2024-10-13 07:52:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:22,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195759104] [2024-10-13 07:52:22,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 07:52:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:52:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 07:52:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 07:52:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 07:52:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 07:52:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:22,561 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-13 07:52:22,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:22,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195759104] [2024-10-13 07:52:22,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195759104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:22,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:22,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:52:22,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686023370] [2024-10-13 07:52:22,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:22,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:52:22,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:52:22,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:52:22,564 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-13 07:52:24,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:24,650 INFO L93 Difference]: Finished difference Result 2734 states and 4238 transitions. [2024-10-13 07:52:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:52:24,651 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-13 07:52:24,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:24,659 INFO L225 Difference]: With dead ends: 2734 [2024-10-13 07:52:24,659 INFO L226 Difference]: Without dead ends: 1388 [2024-10-13 07:52:24,664 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-13 07:52:24,664 INFO L432 NwaCegarLoop]: 919 mSDtfsCounter, 384 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:24,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2227 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 07:52:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-10-13 07:52:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1374. [2024-10-13 07:52:24,703 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-13 07:52:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2114 transitions. [2024-10-13 07:52:24,710 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2114 transitions. Word has length 114 [2024-10-13 07:52:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:24,710 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2114 transitions. [2024-10-13 07:52:24,710 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-13 07:52:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2114 transitions. [2024-10-13 07:52:24,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 07:52:24,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:24,717 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-13 07:52:24,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 07:52:24,718 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-13 07:52:24,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:24,718 INFO L85 PathProgramCache]: Analyzing trace with hash -149991154, now seen corresponding path program 1 times [2024-10-13 07:52:24,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:24,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458971942] [2024-10-13 07:52:24,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:24,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-13 07:52:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 07:52:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:52:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 07:52:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 07:52:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 07:52:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 07:52:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 07:52:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:24,899 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-13 07:52:24,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:24,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458971942] [2024-10-13 07:52:24,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458971942] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:52:24,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609752400] [2024-10-13 07:52:24,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:24,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:52:24,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:52:24,903 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:52:24,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 07:52:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:25,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 07:52:25,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:52:25,331 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-13 07:52:25,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 07:52:25,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609752400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:25,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 07:52:25,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-13 07:52:25,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023158071] [2024-10-13 07:52:25,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:25,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:52:25,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:25,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:52:25,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:52:25,333 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-13 07:52:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:25,657 INFO L93 Difference]: Finished difference Result 2720 states and 4191 transitions. [2024-10-13 07:52:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:52:25,658 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-13 07:52:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:25,664 INFO L225 Difference]: With dead ends: 2720 [2024-10-13 07:52:25,664 INFO L226 Difference]: Without dead ends: 1374 [2024-10-13 07:52:25,667 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-13 07:52:25,667 INFO L432 NwaCegarLoop]: 1252 mSDtfsCounter, 0 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:25,667 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.3s Time] [2024-10-13 07:52:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2024-10-13 07:52:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2024-10-13 07:52:25,693 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-13 07:52:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2111 transitions. [2024-10-13 07:52:25,699 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2111 transitions. Word has length 105 [2024-10-13 07:52:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:25,699 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2111 transitions. [2024-10-13 07:52:25,699 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-13 07:52:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2111 transitions. [2024-10-13 07:52:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 07:52:25,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:25,703 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-13 07:52:25,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 07:52:25,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-13 07:52:25,905 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-13 07:52:25,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:25,905 INFO L85 PathProgramCache]: Analyzing trace with hash 927811095, now seen corresponding path program 1 times [2024-10-13 07:52:25,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:25,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529865744] [2024-10-13 07:52:25,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:25,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:52:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:52:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 07:52:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 07:52:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 07:52:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 07:52:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:26,106 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-13 07:52:26,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:26,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529865744] [2024-10-13 07:52:26,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529865744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:26,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:26,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:52:26,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319276260] [2024-10-13 07:52:26,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:26,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:52:26,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:26,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:52:26,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:52:26,107 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-13 07:52:29,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:29,554 INFO L93 Difference]: Finished difference Result 4054 states and 6258 transitions. [2024-10-13 07:52:29,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 07:52:29,554 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-13 07:52:29,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:29,569 INFO L225 Difference]: With dead ends: 4054 [2024-10-13 07:52:29,569 INFO L226 Difference]: Without dead ends: 2708 [2024-10-13 07:52:29,573 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-13 07:52:29,574 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 1720 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1906 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:29,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1906 Valid, 2392 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 07:52:29,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2024-10-13 07:52:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2666. [2024-10-13 07:52:29,678 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-13 07:52:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 4106 transitions. [2024-10-13 07:52:29,688 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 4106 transitions. Word has length 104 [2024-10-13 07:52:29,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:29,689 INFO L471 AbstractCegarLoop]: Abstraction has 2666 states and 4106 transitions. [2024-10-13 07:52:29,689 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-13 07:52:29,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4106 transitions. [2024-10-13 07:52:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 07:52:29,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:29,698 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-13 07:52:29,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 07:52:29,698 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-13 07:52:29,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:29,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2120740402, now seen corresponding path program 1 times [2024-10-13 07:52:29,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:29,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087726128] [2024-10-13 07:52:29,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:29,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 07:52:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 07:52:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 07:52:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 07:52:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 07:52:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 07:52:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:52:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:29,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-13 07:52:29,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:29,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087726128] [2024-10-13 07:52:29,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087726128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:29,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:29,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 07:52:29,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457681387] [2024-10-13 07:52:29,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:29,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 07:52:29,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:29,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 07:52:29,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 07:52:29,901 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-13 07:52:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:31,969 INFO L93 Difference]: Finished difference Result 4050 states and 6234 transitions. [2024-10-13 07:52:31,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 07:52:31,970 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-13 07:52:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:31,980 INFO L225 Difference]: With dead ends: 4050 [2024-10-13 07:52:31,983 INFO L226 Difference]: Without dead ends: 1410 [2024-10-13 07:52:31,987 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-13 07:52:31,988 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 384 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2980 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.0s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:31,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2980 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 07:52:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-10-13 07:52:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1390. [2024-10-13 07:52:32,028 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-13 07:52:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2121 transitions. [2024-10-13 07:52:32,037 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2121 transitions. Word has length 106 [2024-10-13 07:52:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:32,038 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2121 transitions. [2024-10-13 07:52:32,038 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-13 07:52:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2121 transitions. [2024-10-13 07:52:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 07:52:32,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:32,042 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-13 07:52:32,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 07:52:32,043 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-13 07:52:32,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:32,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2072118375, now seen corresponding path program 1 times [2024-10-13 07:52:32,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:32,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538148443] [2024-10-13 07:52:32,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:32,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-13 07:52:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 07:52:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:52:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 07:52:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 07:52:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 07:52:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 07:52:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 07:52:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,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-13 07:52:32,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538148443] [2024-10-13 07:52:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538148443] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:52:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976887101] [2024-10-13 07:52:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:32,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:52:32,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:52:32,185 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:52:32,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 07:52:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:32,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 07:52:32,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:52:32,602 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-13 07:52:32,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 07:52:32,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976887101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:32,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 07:52:32,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-13 07:52:32,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315865573] [2024-10-13 07:52:32,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:32,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:52:32,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:32,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:52:32,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:52:32,603 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-13 07:52:33,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:33,087 INFO L93 Difference]: Finished difference Result 2732 states and 4189 transitions. [2024-10-13 07:52:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:52:33,087 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-13 07:52:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:33,101 INFO L225 Difference]: With dead ends: 2732 [2024-10-13 07:52:33,105 INFO L226 Difference]: Without dead ends: 1386 [2024-10-13 07:52:33,108 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-13 07:52:33,108 INFO L432 NwaCegarLoop]: 1244 mSDtfsCounter, 0 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-13 07:52:33,108 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-13 07:52:33,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-10-13 07:52:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1386. [2024-10-13 07:52:33,155 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-13 07:52:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2116 transitions. [2024-10-13 07:52:33,160 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2116 transitions. Word has length 108 [2024-10-13 07:52:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:33,160 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2116 transitions. [2024-10-13 07:52:33,160 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-13 07:52:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2116 transitions. [2024-10-13 07:52:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 07:52:33,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:33,164 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-13 07:52:33,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 07:52:33,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:52:33,365 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-13 07:52:33,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:33,365 INFO L85 PathProgramCache]: Analyzing trace with hash -308473827, now seen corresponding path program 1 times [2024-10-13 07:52:33,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:33,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187983773] [2024-10-13 07:52:33,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:33,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:52:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:52:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 07:52:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 07:52:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 07:52:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:52:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:33,553 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-13 07:52:33,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:33,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187983773] [2024-10-13 07:52:33,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187983773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:33,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:33,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 07:52:33,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844824908] [2024-10-13 07:52:33,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:33,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 07:52:33,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:33,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 07:52:33,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 07:52:33,555 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-13 07:52:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:35,826 INFO L93 Difference]: Finished difference Result 2790 states and 4295 transitions. [2024-10-13 07:52:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 07:52:35,826 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-13 07:52:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:35,839 INFO L225 Difference]: With dead ends: 2790 [2024-10-13 07:52:35,843 INFO L226 Difference]: Without dead ends: 1448 [2024-10-13 07:52:35,848 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-13 07:52:35,849 INFO L432 NwaCegarLoop]: 898 mSDtfsCounter, 1417 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:35,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 1992 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 07:52:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2024-10-13 07:52:35,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1392. [2024-10-13 07:52:35,919 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-13 07:52:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2124 transitions. [2024-10-13 07:52:35,926 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2124 transitions. Word has length 106 [2024-10-13 07:52:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:35,926 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 2124 transitions. [2024-10-13 07:52:35,926 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-13 07:52:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2124 transitions. [2024-10-13 07:52:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 07:52:35,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:35,933 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-13 07:52:35,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 07:52:35,933 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-13 07:52:35,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:35,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1219466608, now seen corresponding path program 1 times [2024-10-13 07:52:35,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:35,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455190316] [2024-10-13 07:52:35,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 07:52:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:52:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 07:52:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 07:52:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 07:52:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 07:52:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:36,068 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-13 07:52:36,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:36,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455190316] [2024-10-13 07:52:36,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455190316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:36,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:36,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:52:36,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071942933] [2024-10-13 07:52:36,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:36,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:52:36,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:36,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:52:36,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:52:36,071 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-13 07:52:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:38,416 INFO L93 Difference]: Finished difference Result 2754 states and 4232 transitions. [2024-10-13 07:52:38,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:52:38,417 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-13 07:52:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:38,428 INFO L225 Difference]: With dead ends: 2754 [2024-10-13 07:52:38,429 INFO L226 Difference]: Without dead ends: 1406 [2024-10-13 07:52:38,433 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-13 07:52:38,434 INFO L432 NwaCegarLoop]: 896 mSDtfsCounter, 384 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:38,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2175 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 07:52:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-10-13 07:52:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1386. [2024-10-13 07:52:38,483 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-13 07:52:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2115 transitions. [2024-10-13 07:52:38,490 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2115 transitions. Word has length 117 [2024-10-13 07:52:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:38,492 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2115 transitions. [2024-10-13 07:52:38,492 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-13 07:52:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2115 transitions. [2024-10-13 07:52:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 07:52:38,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:38,497 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-13 07:52:38,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 07:52:38,497 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-13 07:52:38,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash -481793694, now seen corresponding path program 1 times [2024-10-13 07:52:38,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:38,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459142566] [2024-10-13 07:52:38,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:38,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:52:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:52:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 07:52:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 07:52:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 07:52:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 07:52:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:38,731 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-13 07:52:38,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:38,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459142566] [2024-10-13 07:52:38,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459142566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:38,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:38,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:52:38,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196492873] [2024-10-13 07:52:38,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:38,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:52:38,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:38,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:52:38,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:52:38,736 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-13 07:52:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:40,305 INFO L93 Difference]: Finished difference Result 2748 states and 4234 transitions. [2024-10-13 07:52:40,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:52:40,306 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-13 07:52:40,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:40,315 INFO L225 Difference]: With dead ends: 2748 [2024-10-13 07:52:40,322 INFO L226 Difference]: Without dead ends: 1406 [2024-10-13 07:52:40,331 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-13 07:52:40,332 INFO L432 NwaCegarLoop]: 896 mSDtfsCounter, 381 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2183 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-13 07:52:40,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2183 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 07:52:40,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-10-13 07:52:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1386. [2024-10-13 07:52:40,421 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-13 07:52:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2112 transitions. [2024-10-13 07:52:40,433 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2112 transitions. Word has length 108 [2024-10-13 07:52:40,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:40,433 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2112 transitions. [2024-10-13 07:52:40,433 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-13 07:52:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2112 transitions. [2024-10-13 07:52:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 07:52:40,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:40,441 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-13 07:52:40,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 07:52:40,442 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-13 07:52:40,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash -227698928, now seen corresponding path program 1 times [2024-10-13 07:52:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:40,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421248685] [2024-10-13 07:52:40,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:40,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:52:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:52:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 07:52:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 07:52:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 07:52:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 07:52:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:40,687 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-13 07:52:40,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:40,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421248685] [2024-10-13 07:52:40,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421248685] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:52:40,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117397629] [2024-10-13 07:52:40,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:40,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:52:40,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:52:40,690 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:52:40,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 07:52:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:41,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 07:52:41,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:52:41,380 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-13 07:52:41,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:52:41,534 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-13 07:52:41,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117397629] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:52:41,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:52:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 11 [2024-10-13 07:52:41,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341467636] [2024-10-13 07:52:41,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:52:41,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 07:52:41,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:41,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 07:52:41,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-13 07:52:41,536 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-13 07:52:44,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:44,942 INFO L93 Difference]: Finished difference Result 2874 states and 4429 transitions. [2024-10-13 07:52:44,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 07:52:44,943 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-13 07:52:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:44,949 INFO L225 Difference]: With dead ends: 2874 [2024-10-13 07:52:44,949 INFO L226 Difference]: Without dead ends: 1532 [2024-10-13 07:52:44,952 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-13 07:52:44,952 INFO L432 NwaCegarLoop]: 889 mSDtfsCounter, 1552 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:44,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 2553 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 07:52:44,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-10-13 07:52:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1396. [2024-10-13 07:52:44,995 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-13 07:52:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2126 transitions. [2024-10-13 07:52:45,001 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2126 transitions. Word has length 111 [2024-10-13 07:52:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:45,001 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 2126 transitions. [2024-10-13 07:52:45,001 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-13 07:52:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2126 transitions. [2024-10-13 07:52:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 07:52:45,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:45,006 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-13 07:52:45,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-13 07:52:45,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-13 07:52:45,209 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-13 07:52:45,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:45,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1808016481, now seen corresponding path program 2 times [2024-10-13 07:52:45,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:45,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557041783] [2024-10-13 07:52:45,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:45,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:52:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:52:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 07:52:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 07:52:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:52:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 07:52:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:45,433 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-13 07:52:45,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:45,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557041783] [2024-10-13 07:52:45,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557041783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:45,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:45,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 07:52:45,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17290231] [2024-10-13 07:52:45,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:45,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 07:52:45,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:45,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 07:52:45,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 07:52:45,439 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-13 07:52:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:47,559 INFO L93 Difference]: Finished difference Result 1422 states and 2176 transitions. [2024-10-13 07:52:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 07:52:47,559 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-13 07:52:47,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:47,566 INFO L225 Difference]: With dead ends: 1422 [2024-10-13 07:52:47,566 INFO L226 Difference]: Without dead ends: 1420 [2024-10-13 07:52:47,566 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-13 07:52:47,567 INFO L432 NwaCegarLoop]: 896 mSDtfsCounter, 381 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:47,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2939 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 07:52:47,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-10-13 07:52:47,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1396. [2024-10-13 07:52:47,644 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-13 07:52:47,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2126 transitions. [2024-10-13 07:52:47,654 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2126 transitions. Word has length 117 [2024-10-13 07:52:47,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:47,655 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 2126 transitions. [2024-10-13 07:52:47,655 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-13 07:52:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2126 transitions. [2024-10-13 07:52:47,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 07:52:47,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:47,663 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-13 07:52:47,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 07:52:47,663 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-13 07:52:47,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:47,664 INFO L85 PathProgramCache]: Analyzing trace with hash -239582564, now seen corresponding path program 1 times [2024-10-13 07:52:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:47,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533843337] [2024-10-13 07:52:47,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:47,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:47,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:47,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:47,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:47,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:47,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:47,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:47,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:47,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:47,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:52:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:47,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:52:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:47,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 07:52:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:47,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 07:52:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:47,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:52:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:47,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 07:52:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:48,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:48,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 07:52:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:48,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 07:52:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:48,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 07:52:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:48,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 07:52:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:48,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 07:52:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:48,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 07:52:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:48,037 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-13 07:52:48,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:48,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533843337] [2024-10-13 07:52:48,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533843337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:52:48,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026574226] [2024-10-13 07:52:48,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:48,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:52:48,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:52:48,040 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:52:48,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 07:52:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:48,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 07:52:48,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:52:48,851 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-13 07:52:48,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:52:49,059 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-13 07:52:49,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026574226] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:52:49,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:52:49,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 21 [2024-10-13 07:52:49,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607246598] [2024-10-13 07:52:49,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:52:49,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 07:52:49,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:49,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 07:52:49,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2024-10-13 07:52:49,062 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) [2024-10-13 07:52:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:53,929 INFO L93 Difference]: Finished difference Result 3136 states and 4851 transitions. [2024-10-13 07:52:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 07:52:53,929 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 146 [2024-10-13 07:52:53,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:53,937 INFO L225 Difference]: With dead ends: 3136 [2024-10-13 07:52:53,937 INFO L226 Difference]: Without dead ends: 1784 [2024-10-13 07:52:53,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2024-10-13 07:52:53,944 INFO L432 NwaCegarLoop]: 888 mSDtfsCounter, 1693 mSDsluCounter, 3992 mSDsCounter, 0 mSdLazyCounter, 4940 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 4880 SdHoareTripleChecker+Invalid, 5484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 4940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:53,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 4880 Invalid, 5484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 4940 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-13 07:52:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2024-10-13 07:52:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1420. [2024-10-13 07:52:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1025 states have (on average 1.4439024390243902) internal successors, (1480), 1068 states have internal predecessors, (1480), 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-13 07:52:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2162 transitions. [2024-10-13 07:52:54,030 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2162 transitions. Word has length 146 [2024-10-13 07:52:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:54,030 INFO L471 AbstractCegarLoop]: Abstraction has 1420 states and 2162 transitions. [2024-10-13 07:52:54,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-10-13 07:52:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2162 transitions. [2024-10-13 07:52:54,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 07:52:54,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:54,038 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:52:54,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 07:52:54,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-13 07:52:54,243 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-13 07:52:54,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2063692314, now seen corresponding path program 1 times [2024-10-13 07:52:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:54,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504077610] [2024-10-13 07:52:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:54,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:52:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:52:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 07:52:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 07:52:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 07:52:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 07:52:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 07:52:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 07:52:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 07:52:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 07:52:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 07:52:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 07:52:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 07:52:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:54,585 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-13 07:52:54,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:54,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504077610] [2024-10-13 07:52:54,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504077610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:54,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:54,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 07:52:54,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437065820] [2024-10-13 07:52:54,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:54,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 07:52:54,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:54,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 07:52:54,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 07:52:54,587 INFO L87 Difference]: Start difference. First operand 1420 states and 2162 transitions. Second operand has 9 states, 8 states have (on average 11.0) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 07:52:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:57,486 INFO L93 Difference]: Finished difference Result 1472 states and 2252 transitions. [2024-10-13 07:52:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 07:52:57,487 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.0) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 149 [2024-10-13 07:52:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:57,491 INFO L225 Difference]: With dead ends: 1472 [2024-10-13 07:52:57,492 INFO L226 Difference]: Without dead ends: 1470 [2024-10-13 07:52:57,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 07:52:57,492 INFO L432 NwaCegarLoop]: 891 mSDtfsCounter, 828 mSDsluCounter, 4212 mSDsCounter, 0 mSdLazyCounter, 3499 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 5103 SdHoareTripleChecker+Invalid, 3938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 3499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:57,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 5103 Invalid, 3938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 3499 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 07:52:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2024-10-13 07:52:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1424. [2024-10-13 07:52:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1027 states have (on average 1.4430379746835442) internal successors, (1482), 1070 states have internal predecessors, (1482), 343 states have call successors, (343), 49 states have call predecessors, (343), 49 states have return successors, (343), 340 states have call predecessors, (343), 343 states have call successors, (343) [2024-10-13 07:52:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 2168 transitions. [2024-10-13 07:52:57,539 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 2168 transitions. Word has length 149 [2024-10-13 07:52:57,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:57,540 INFO L471 AbstractCegarLoop]: Abstraction has 1424 states and 2168 transitions. [2024-10-13 07:52:57,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.0) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 07:52:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2168 transitions. [2024-10-13 07:52:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 07:52:57,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:57,548 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:52:57,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 07:52:57,548 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-13 07:52:57,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:57,548 INFO L85 PathProgramCache]: Analyzing trace with hash 131865625, now seen corresponding path program 1 times [2024-10-13 07:52:57,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:57,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959551494] [2024-10-13 07:52:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:52:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:52:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:52:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:52:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:52:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:52:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:52:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:52:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 07:52:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 07:52:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 07:52:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 07:52:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 07:52:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 07:52:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 07:52:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:52:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 07:52:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 07:52:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:52:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-13 07:52:57,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:52:57,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959551494] [2024-10-13 07:52:57,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959551494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:52:57,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:52:57,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:52:57,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33391966] [2024-10-13 07:52:57,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:52:57,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:52:57,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:52:57,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:52:57,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:52:57,689 INFO L87 Difference]: Start difference. First operand 1424 states and 2168 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 07:52:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:52:59,783 INFO L93 Difference]: Finished difference Result 2818 states and 4320 transitions. [2024-10-13 07:52:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:52:59,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-10-13 07:52:59,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:52:59,790 INFO L225 Difference]: With dead ends: 2818 [2024-10-13 07:52:59,790 INFO L226 Difference]: Without dead ends: 1438 [2024-10-13 07:52:59,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 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-13 07:52:59,797 INFO L432 NwaCegarLoop]: 891 mSDtfsCounter, 381 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 07:52:59,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2160 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 07:52:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2024-10-13 07:52:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1418. [2024-10-13 07:52:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1022 states have (on average 1.4412915851272015) internal successors, (1473), 1064 states have internal predecessors, (1473), 343 states have call successors, (343), 49 states have call predecessors, (343), 49 states have return successors, (343), 340 states have call predecessors, (343), 343 states have call successors, (343) [2024-10-13 07:52:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2159 transitions. [2024-10-13 07:52:59,934 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2159 transitions. Word has length 161 [2024-10-13 07:52:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:52:59,938 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 2159 transitions. [2024-10-13 07:52:59,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 07:52:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2159 transitions. [2024-10-13 07:52:59,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 07:52:59,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:52:59,955 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:52:59,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 07:52:59,956 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-13 07:52:59,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:52:59,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1052747034, now seen corresponding path program 1 times [2024-10-13 07:52:59,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:52:59,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844820942] [2024-10-13 07:52:59,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:52:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:53:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:53:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:53:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:53:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:53:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:53:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:53:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:53:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 07:53:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 07:53:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 07:53:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 07:53:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 07:53:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 07:53:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 07:53:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 07:53:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 07:53:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-13 07:53:00,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:53:00,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844820942] [2024-10-13 07:53:00,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844820942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:53:00,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:53:00,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:53:00,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288852995] [2024-10-13 07:53:00,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:53:00,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:53:00,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:53:00,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:53:00,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:53:00,378 INFO L87 Difference]: Start difference. First operand 1418 states and 2159 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 07:53:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:53:01,992 INFO L93 Difference]: Finished difference Result 2812 states and 4309 transitions. [2024-10-13 07:53:01,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:53:01,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 163 [2024-10-13 07:53:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:53:01,998 INFO L225 Difference]: With dead ends: 2812 [2024-10-13 07:53:01,999 INFO L226 Difference]: Without dead ends: 1438 [2024-10-13 07:53:02,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 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-13 07:53:02,002 INFO L432 NwaCegarLoop]: 883 mSDtfsCounter, 381 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 07:53:02,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2141 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 07:53:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2024-10-13 07:53:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1418. [2024-10-13 07:53:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1022 states have (on average 1.4354207436399218) internal successors, (1467), 1064 states have internal predecessors, (1467), 343 states have call successors, (343), 49 states have call predecessors, (343), 49 states have return successors, (343), 340 states have call predecessors, (343), 343 states have call successors, (343) [2024-10-13 07:53:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2153 transitions. [2024-10-13 07:53:02,055 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2153 transitions. Word has length 163 [2024-10-13 07:53:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:53:02,055 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 2153 transitions. [2024-10-13 07:53:02,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 07:53:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2153 transitions. [2024-10-13 07:53:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 07:53:02,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:53:02,062 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:53:02,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 07:53:02,063 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-13 07:53:02,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:53:02,063 INFO L85 PathProgramCache]: Analyzing trace with hash -621233933, now seen corresponding path program 1 times [2024-10-13 07:53:02,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:53:02,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289698477] [2024-10-13 07:53:02,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:53:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:53:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:53:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:53:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:53:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:53:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:53:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:53:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:53:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 07:53:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 07:53:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 07:53:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 07:53:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 07:53:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 07:53:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 07:53:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 07:53:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 07:53:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-13 07:53:02,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:53:02,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289698477] [2024-10-13 07:53:02,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289698477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:53:02,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:53:02,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:53:02,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779404490] [2024-10-13 07:53:02,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:53:02,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:53:02,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:53:02,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:53:02,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:53:02,216 INFO L87 Difference]: Start difference. First operand 1418 states and 2153 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 07:53:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:53:03,882 INFO L93 Difference]: Finished difference Result 2806 states and 4290 transitions. [2024-10-13 07:53:03,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:53:03,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 166 [2024-10-13 07:53:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:53:03,890 INFO L225 Difference]: With dead ends: 2806 [2024-10-13 07:53:03,890 INFO L226 Difference]: Without dead ends: 1432 [2024-10-13 07:53:03,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 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-13 07:53:03,894 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 381 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 07:53:03,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2130 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 07:53:03,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2024-10-13 07:53:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1412. [2024-10-13 07:53:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1017 states have (on average 1.4336283185840708) internal successors, (1458), 1058 states have internal predecessors, (1458), 343 states have call successors, (343), 49 states have call predecessors, (343), 49 states have return successors, (343), 340 states have call predecessors, (343), 343 states have call successors, (343) [2024-10-13 07:53:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2144 transitions. [2024-10-13 07:53:03,948 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2144 transitions. Word has length 166 [2024-10-13 07:53:03,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:53:03,949 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2144 transitions. [2024-10-13 07:53:03,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 07:53:03,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2144 transitions. [2024-10-13 07:53:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-13 07:53:03,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:53:03,955 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:53:03,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 07:53:03,955 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-13 07:53:03,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:53:03,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1121421324, now seen corresponding path program 1 times [2024-10-13 07:53:03,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:53:03,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781151021] [2024-10-13 07:53:03,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:53:03,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:53:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:53:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:53:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:53:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:53:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:53:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:53:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:53:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 07:53:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 07:53:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 07:53:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 07:53:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 07:53:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 07:53:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 07:53:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 07:53:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 07:53:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-13 07:53:04,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:53:04,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781151021] [2024-10-13 07:53:04,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781151021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:53:04,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:53:04,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:53:04,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037637519] [2024-10-13 07:53:04,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:53:04,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:53:04,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:53:04,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:53:04,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:53:04,116 INFO L87 Difference]: Start difference. First operand 1412 states and 2144 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 07:53:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:53:06,137 INFO L93 Difference]: Finished difference Result 2800 states and 4279 transitions. [2024-10-13 07:53:06,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:53:06,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 168 [2024-10-13 07:53:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:53:06,144 INFO L225 Difference]: With dead ends: 2800 [2024-10-13 07:53:06,144 INFO L226 Difference]: Without dead ends: 1432 [2024-10-13 07:53:06,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 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-13 07:53:06,148 INFO L432 NwaCegarLoop]: 875 mSDtfsCounter, 381 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 07:53:06,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2117 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 07:53:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2024-10-13 07:53:06,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1412. [2024-10-13 07:53:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1017 states have (on average 1.4277286135693215) internal successors, (1452), 1058 states have internal predecessors, (1452), 343 states have call successors, (343), 49 states have call predecessors, (343), 49 states have return successors, (343), 340 states have call predecessors, (343), 343 states have call successors, (343) [2024-10-13 07:53:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2138 transitions. [2024-10-13 07:53:06,227 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2138 transitions. Word has length 168 [2024-10-13 07:53:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:53:06,228 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2138 transitions. [2024-10-13 07:53:06,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 07:53:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2138 transitions. [2024-10-13 07:53:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 07:53:06,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:53:06,234 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:53:06,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-13 07:53:06,235 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-13 07:53:06,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:53:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1131039613, now seen corresponding path program 1 times [2024-10-13 07:53:06,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:53:06,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125869746] [2024-10-13 07:53:06,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:53:06,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:53:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:53:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:53:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:53:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:53:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:53:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:53:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:53:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 07:53:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 07:53:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 07:53:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 07:53:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 07:53:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 07:53:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 07:53:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 07:53:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 07:53:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-13 07:53:06,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:53:06,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125869746] [2024-10-13 07:53:06,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125869746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:53:06,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:53:06,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:53:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245472560] [2024-10-13 07:53:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:53:06,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:53:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:53:06,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:53:06,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:53:06,442 INFO L87 Difference]: Start difference. First operand 1412 states and 2138 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 07:53:08,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:53:08,478 INFO L93 Difference]: Finished difference Result 2794 states and 4260 transitions. [2024-10-13 07:53:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:53:08,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 171 [2024-10-13 07:53:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:53:08,495 INFO L225 Difference]: With dead ends: 2794 [2024-10-13 07:53:08,496 INFO L226 Difference]: Without dead ends: 1426 [2024-10-13 07:53:08,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 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-13 07:53:08,506 INFO L432 NwaCegarLoop]: 872 mSDtfsCounter, 381 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 07:53:08,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2103 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 07:53:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-10-13 07:53:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1406. [2024-10-13 07:53:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1012 states have (on average 1.4258893280632412) internal successors, (1443), 1052 states have internal predecessors, (1443), 343 states have call successors, (343), 49 states have call predecessors, (343), 49 states have return successors, (343), 340 states have call predecessors, (343), 343 states have call successors, (343) [2024-10-13 07:53:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2129 transitions. [2024-10-13 07:53:08,617 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2129 transitions. Word has length 171 [2024-10-13 07:53:08,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:53:08,622 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 2129 transitions. [2024-10-13 07:53:08,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 07:53:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2129 transitions. [2024-10-13 07:53:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 07:53:08,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:53:08,635 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:53:08,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-13 07:53:08,636 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-13 07:53:08,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:53:08,637 INFO L85 PathProgramCache]: Analyzing trace with hash -813722498, now seen corresponding path program 1 times [2024-10-13 07:53:08,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:53:08,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936802629] [2024-10-13 07:53:08,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:53:08,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:53:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:53:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:53:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:53:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:53:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:53:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:53:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:53:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 07:53:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 07:53:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 07:53:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 07:53:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 07:53:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 07:53:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 07:53:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 07:53:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 07:53:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-13 07:53:08,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:53:08,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936802629] [2024-10-13 07:53:08,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936802629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:53:08,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:53:08,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:53:08,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22991756] [2024-10-13 07:53:08,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:53:08,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:53:08,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:53:08,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:53:08,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:53:08,992 INFO L87 Difference]: Start difference. First operand 1406 states and 2129 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 07:53:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:53:10,536 INFO L93 Difference]: Finished difference Result 2788 states and 4249 transitions. [2024-10-13 07:53:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:53:10,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 173 [2024-10-13 07:53:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:53:10,543 INFO L225 Difference]: With dead ends: 2788 [2024-10-13 07:53:10,543 INFO L226 Difference]: Without dead ends: 1426 [2024-10-13 07:53:10,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 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-13 07:53:10,546 INFO L432 NwaCegarLoop]: 866 mSDtfsCounter, 381 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 07:53:10,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2090 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 07:53:10,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-10-13 07:53:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1406. [2024-10-13 07:53:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1012 states have (on average 1.4199604743083003) internal successors, (1437), 1052 states have internal predecessors, (1437), 343 states have call successors, (343), 49 states have call predecessors, (343), 49 states have return successors, (343), 340 states have call predecessors, (343), 343 states have call successors, (343) [2024-10-13 07:53:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2123 transitions. [2024-10-13 07:53:10,600 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2123 transitions. Word has length 173 [2024-10-13 07:53:10,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:53:10,600 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 2123 transitions. [2024-10-13 07:53:10,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 07:53:10,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2123 transitions. [2024-10-13 07:53:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-13 07:53:10,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:53:10,607 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:53:10,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-13 07:53:10,608 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-13 07:53:10,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:53:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1968376233, now seen corresponding path program 1 times [2024-10-13 07:53:10,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:53:10,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728057166] [2024-10-13 07:53:10,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:53:10,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:53:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:53:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 07:53:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:53:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 07:53:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:53:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:53:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 07:53:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 07:53:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 07:53:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 07:53:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 07:53:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 07:53:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 07:53:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 07:53:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:53:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 07:53:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 07:53:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:53:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-13 07:53:10,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:53:10,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728057166] [2024-10-13 07:53:10,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728057166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:53:10,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:53:10,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:53:10,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397359176] [2024-10-13 07:53:10,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:53:10,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:53:10,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:53:10,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:53:10,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:53:10,781 INFO L87 Difference]: Start difference. First operand 1406 states and 2123 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)