./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fba957c5 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 ../../../trunk/examples/svcomp/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-fba957c-m [2023-11-23 10:20:41,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 10:20:41,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 10:20:41,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 10:20:41,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 10:20:41,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 10:20:41,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 10:20:41,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 10:20:41,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 10:20:41,467 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 10:20:41,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 10:20:41,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 10:20:41,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 10:20:41,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 10:20:41,469 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 10:20:41,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 10:20:41,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 10:20:41,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 10:20:41,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 10:20:41,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 10:20:41,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 10:20:41,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 10:20:41,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 10:20:41,473 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 10:20:41,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 10:20:41,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 10:20:41,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 10:20:41,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 10:20:41,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 10:20:41,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 10:20:41,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 10:20:41,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 10:20:41,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 10:20:41,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 10:20:41,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 10:20:41,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 10:20:41,477 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 10:20:41,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 10:20:41,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 10:20:41,478 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 -> 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 10:20:41,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 10:20:41,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 10:20:41,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 10:20:41,718 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 10:20:41,718 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 10:20:41,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2023-11-23 10:20:42,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 10:20:43,300 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 10:20:43,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2023-11-23 10:20:43,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d876433b/f44ff5a7ad964b80b9ea06652368fc3e/FLAGc7608d753 [2023-11-23 10:20:43,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d876433b/f44ff5a7ad964b80b9ea06652368fc3e [2023-11-23 10:20:43,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 10:20:43,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 10:20:43,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 10:20:43,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 10:20:43,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 10:20:43,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:20:43" (1/1) ... [2023-11-23 10:20:43,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d77ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:43, skipping insertion in model container [2023-11-23 10:20:43,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:20:43" (1/1) ... [2023-11-23 10:20:43,496 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 10:20:43,975 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2023-11-23 10:20:44,497 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 10:20:44,518 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 10:20:44,588 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4690] [2023-11-23 10:20:44,590 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4697] [2023-11-23 10:20:44,591 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4705-4706] [2023-11-23 10:20:44,591 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4714-4715] [2023-11-23 10:20:44,593 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2023-11-23 10:20:44,594 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4838] [2023-11-23 10:20:44,595 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4841] [2023-11-23 10:20:44,595 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4844] [2023-11-23 10:20:44,595 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4847] [2023-11-23 10:20:44,608 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5229] [2023-11-23 10:20:44,608 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5233] [2023-11-23 10:20:44,609 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5237] [2023-11-23 10:20:44,609 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5241] [2023-11-23 10:20:44,609 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5252] [2023-11-23 10:20:44,610 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5256] [2023-11-23 10:20:44,610 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5260] [2023-11-23 10:20:44,611 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5264] [2023-11-23 10:20:44,611 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5275] [2023-11-23 10:20:44,611 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5279] [2023-11-23 10:20:44,612 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5283] [2023-11-23 10:20:44,612 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5287] [2023-11-23 10:20:44,612 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5298] [2023-11-23 10:20:44,612 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5302] [2023-11-23 10:20:44,613 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5306] [2023-11-23 10:20:44,613 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5310] [2023-11-23 10:20:44,614 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5360] [2023-11-23 10:20:44,616 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5364] [2023-11-23 10:20:44,616 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5368] [2023-11-23 10:20:44,617 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5372] [2023-11-23 10:20:44,617 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5383] [2023-11-23 10:20:44,617 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5387] [2023-11-23 10:20:44,618 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5391] [2023-11-23 10:20:44,619 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5395] [2023-11-23 10:20:44,620 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5406] [2023-11-23 10:20:44,620 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5410] [2023-11-23 10:20:44,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5414] [2023-11-23 10:20:44,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5418] [2023-11-23 10:20:44,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5429] [2023-11-23 10:20:44,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5433] [2023-11-23 10:20:44,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5437] [2023-11-23 10:20:44,623 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5441] [2023-11-23 10:20:44,628 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5515] [2023-11-23 10:20:44,628 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5519] [2023-11-23 10:20:44,628 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5523] [2023-11-23 10:20:44,629 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5527] [2023-11-23 10:20:44,629 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5538] [2023-11-23 10:20:44,629 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5542] [2023-11-23 10:20:44,631 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5546] [2023-11-23 10:20:44,631 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5550] [2023-11-23 10:20:44,631 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5561] [2023-11-23 10:20:44,631 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5565] [2023-11-23 10:20:44,632 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5569] [2023-11-23 10:20:44,632 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5573] [2023-11-23 10:20:44,686 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6512] [2023-11-23 10:20:44,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6515] [2023-11-23 10:20:44,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6518] [2023-11-23 10:20:44,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6521] [2023-11-23 10:20:44,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6524] [2023-11-23 10:20:44,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6537] [2023-11-23 10:20:44,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6540] [2023-11-23 10:20:44,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6543] [2023-11-23 10:20:44,689 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6546] [2023-11-23 10:20:44,690 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6549] [2023-11-23 10:20:44,690 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6571] [2023-11-23 10:20:44,691 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6574] [2023-11-23 10:20:44,691 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6577] [2023-11-23 10:20:44,692 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6580] [2023-11-23 10:20:44,692 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6583] [2023-11-23 10:20:44,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6616-6617] [2023-11-23 10:20:44,694 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6620-6621] [2023-11-23 10:20:44,694 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6624-6625] [2023-11-23 10:20:44,694 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6628-6629] [2023-11-23 10:20:44,695 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6632-6633] [2023-11-23 10:20:44,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6646] [2023-11-23 10:20:44,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6649] [2023-11-23 10:20:44,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6652] [2023-11-23 10:20:44,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6655] [2023-11-23 10:20:44,697 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6658] [2023-11-23 10:20:44,698 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6691-6692] [2023-11-23 10:20:44,698 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6695-6696] [2023-11-23 10:20:44,698 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6699-6700] [2023-11-23 10:20:44,699 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6703-6704] [2023-11-23 10:20:44,700 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6707-6708] [2023-11-23 10:20:44,813 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 10:20:44,918 WARN L675 CHandler]: The function __xchg_wrong_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 10:20:44,918 WARN L675 CHandler]: The function __bad_percpu_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 10:20:44,919 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 10:20:44,925 INFO L206 MainTranslator]: Completed translation [2023-11-23 10:20:44,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:44 WrapperNode [2023-11-23 10:20:44,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 10:20:44,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 10:20:44,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 10:20:44,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 10:20:44,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:44" (1/1) ... [2023-11-23 10:20:44,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:44" (1/1) ... [2023-11-23 10:20:45,083 INFO L138 Inliner]: procedures = 184, calls = 845, calls flagged for inlining = 92, calls inlined = 90, statements flattened = 3344 [2023-11-23 10:20:45,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 10:20:45,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 10:20:45,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 10:20:45,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 10:20:45,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:44" (1/1) ... [2023-11-23 10:20:45,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:44" (1/1) ... [2023-11-23 10:20:45,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:44" (1/1) ... [2023-11-23 10:20:45,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:44" (1/1) ... [2023-11-23 10:20:45,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:44" (1/1) ... [2023-11-23 10:20:45,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:44" (1/1) ... [2023-11-23 10:20:45,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:44" (1/1) ... [2023-11-23 10:20:45,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:44" (1/1) ... [2023-11-23 10:20:45,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 10:20:45,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 10:20:45,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 10:20:45,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 10:20:45,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:44" (1/1) ... [2023-11-23 10:20:45,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 10:20:45,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:20:45,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 10:20:45,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 10:20:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2023-11-23 10:20:45,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2023-11-23 10:20:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2023-11-23 10:20:45,408 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2023-11-23 10:20:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-23 10:20:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2023-11-23 10:20:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2023-11-23 10:20:45,410 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2023-11-23 10:20:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-23 10:20:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-23 10:20:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-23 10:20:45,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-23 10:20:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 10:20:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2023-11-23 10:20:45,411 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2023-11-23 10:20:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2023-11-23 10:20:45,411 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2023-11-23 10:20:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2023-11-23 10:20:45,411 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2023-11-23 10:20:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2023-11-23 10:20:45,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2023-11-23 10:20:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2023-11-23 10:20:45,411 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2023-11-23 10:20:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-23 10:20:45,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-23 10:20:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2023-11-23 10:20:45,412 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2023-11-23 10:20:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2023-11-23 10:20:45,412 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2023-11-23 10:20:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-23 10:20:45,413 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-23 10:20:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2023-11-23 10:20:45,413 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2023-11-23 10:20:45,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 10:20:45,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-23 10:20:45,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-23 10:20:45,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-23 10:20:45,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-23 10:20:45,414 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2023-11-23 10:20:45,415 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2023-11-23 10:20:45,415 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 10:20:45,415 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 10:20:45,415 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2023-11-23 10:20:45,415 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2023-11-23 10:20:45,415 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2023-11-23 10:20:45,416 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2023-11-23 10:20:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 10:20:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2023-11-23 10:20:45,416 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2023-11-23 10:20:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2023-11-23 10:20:45,416 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2023-11-23 10:20:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2023-11-23 10:20:45,416 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2023-11-23 10:20:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 10:20:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2023-11-23 10:20:45,417 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2023-11-23 10:20:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2023-11-23 10:20:45,417 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2023-11-23 10:20:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 10:20:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 10:20:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-23 10:20:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2023-11-23 10:20:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2023-11-23 10:20:45,419 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2023-11-23 10:20:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2023-11-23 10:20:45,419 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2023-11-23 10:20:45,420 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2023-11-23 10:20:45,421 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2023-11-23 10:20:45,422 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2023-11-23 10:20:45,422 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2023-11-23 10:20:45,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 10:20:45,423 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2023-11-23 10:20:45,423 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2023-11-23 10:20:45,423 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2023-11-23 10:20:45,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2023-11-23 10:20:45,423 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2023-11-23 10:20:45,423 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2023-11-23 10:20:45,428 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2023-11-23 10:20:45,429 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2023-11-23 10:20:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2023-11-23 10:20:45,429 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2023-11-23 10:20:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 10:20:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2023-11-23 10:20:45,429 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2023-11-23 10:20:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 10:20:45,429 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2023-11-23 10:20:45,429 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2023-11-23 10:20:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2023-11-23 10:20:45,430 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2023-11-23 10:20:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-23 10:20:45,430 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-23 10:20:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2023-11-23 10:20:45,430 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2023-11-23 10:20:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-23 10:20:45,430 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-23 10:20:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2023-11-23 10:20:45,430 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2023-11-23 10:20:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2023-11-23 10:20:45,431 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2023-11-23 10:20:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2023-11-23 10:20:45,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2023-11-23 10:20:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2023-11-23 10:20:45,431 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2023-11-23 10:20:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2023-11-23 10:20:45,431 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2023-11-23 10:20:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2023-11-23 10:20:45,431 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2023-11-23 10:20:45,432 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2023-11-23 10:20:45,432 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2023-11-23 10:20:45,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 10:20:45,432 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2023-11-23 10:20:45,432 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2023-11-23 10:20:45,432 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2023-11-23 10:20:45,432 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2023-11-23 10:20:45,432 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2023-11-23 10:20:45,432 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2023-11-23 10:20:45,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-23 10:20:45,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-11-23 10:20:45,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-11-23 10:20:45,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 10:20:45,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 10:20:45,434 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2023-11-23 10:20:45,434 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2023-11-23 10:20:45,434 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2023-11-23 10:20:45,434 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2023-11-23 10:20:45,873 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 10:20:45,875 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 10:20:46,087 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-23 10:20:47,827 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 10:20:47,962 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 10:20:47,962 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 10:20:47,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:20:47 BoogieIcfgContainer [2023-11-23 10:20:47,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 10:20:47,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 10:20:47,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 10:20:47,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 10:20:47,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:20:43" (1/3) ... [2023-11-23 10:20:47,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbd1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:20:47, skipping insertion in model container [2023-11-23 10:20:47,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:44" (2/3) ... [2023-11-23 10:20:47,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbd1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:20:47, skipping insertion in model container [2023-11-23 10:20:47,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:20:47" (3/3) ... [2023-11-23 10:20:47,971 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2023-11-23 10:20:47,985 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 10:20:47,985 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 10:20:48,031 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 10:20:48,036 INFO L357 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, mHoare=true, 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;@165264f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 10:20:48,037 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 10:20:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 1026 states, 727 states have (on average 1.5075653370013755) internal successors, (1096), 760 states have internal predecessors, (1096), 245 states have call successors, (245), 53 states have call predecessors, (245), 52 states have return successors, (240), 238 states have call predecessors, (240), 240 states have call successors, (240) [2023-11-23 10:20:48,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-23 10:20:48,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:20:48,061 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:20:48,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:20:48,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:20:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash 226412890, now seen corresponding path program 1 times [2023-11-23 10:20:48,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:20:48,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687686551] [2023-11-23 10:20:48,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:20:48,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:20:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:48,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:20:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:48,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:20:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:48,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:20:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:48,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:20:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:48,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:20:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:48,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:20:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:48,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:20:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-23 10:20:48,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:20:48,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687686551] [2023-11-23 10:20:48,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687686551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:20:48,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:20:48,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 10:20:48,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877596897] [2023-11-23 10:20:48,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:20:48,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 10:20:48,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:20:48,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 10:20:48,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 10:20:48,496 INFO L87 Difference]: Start difference. First operand has 1026 states, 727 states have (on average 1.5075653370013755) internal successors, (1096), 760 states have internal predecessors, (1096), 245 states have call successors, (245), 53 states have call predecessors, (245), 52 states have return successors, (240), 238 states have call predecessors, (240), 240 states have call successors, (240) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-23 10:20:52,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:20:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:20:53,776 INFO L93 Difference]: Finished difference Result 2767 states and 4311 transitions. [2023-11-23 10:20:53,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 10:20:53,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2023-11-23 10:20:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:20:53,802 INFO L225 Difference]: With dead ends: 2767 [2023-11-23 10:20:53,802 INFO L226 Difference]: Without dead ends: 1667 [2023-11-23 10:20:53,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 10:20:53,815 INFO L413 NwaCegarLoop]: 1127 mSDtfsCounter, 1387 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 2585 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-11-23 10:20:53,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 2585 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-11-23 10:20:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2023-11-23 10:20:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1515. [2023-11-23 10:20:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1066 states have (on average 1.474671669793621) internal successors, (1572), 1099 states have internal predecessors, (1572), 358 states have call successors, (358), 91 states have call predecessors, (358), 90 states have return successors, (357), 354 states have call predecessors, (357), 357 states have call successors, (357) [2023-11-23 10:20:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2287 transitions. [2023-11-23 10:20:53,964 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2287 transitions. Word has length 60 [2023-11-23 10:20:53,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:20:53,964 INFO L495 AbstractCegarLoop]: Abstraction has 1515 states and 2287 transitions. [2023-11-23 10:20:53,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-23 10:20:53,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2287 transitions. [2023-11-23 10:20:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 10:20:53,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:20:53,971 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:20:53,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 10:20:53,972 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:20:53,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:20:53,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1136121569, now seen corresponding path program 1 times [2023-11-23 10:20:53,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:20:53,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227315867] [2023-11-23 10:20:53,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:20:53,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:20:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:20:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:20:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:20:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:20:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:20:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:20:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:20:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:20:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:20:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:20:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 10:20:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:20:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:20:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 10:20:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-23 10:20:54,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:20:54,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227315867] [2023-11-23 10:20:54,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227315867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:20:54,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:20:54,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 10:20:54,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790340683] [2023-11-23 10:20:54,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:20:54,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 10:20:54,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:20:54,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 10:20:54,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 10:20:54,196 INFO L87 Difference]: Start difference. First operand 1515 states and 2287 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-23 10:20:55,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:20:57,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:20:57,500 INFO L93 Difference]: Finished difference Result 3193 states and 4875 transitions. [2023-11-23 10:20:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 10:20:57,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 110 [2023-11-23 10:20:57,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:20:57,509 INFO L225 Difference]: With dead ends: 3193 [2023-11-23 10:20:57,510 INFO L226 Difference]: Without dead ends: 1699 [2023-11-23 10:20:57,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:20:57,515 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 2246 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 833 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2382 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 833 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-23 10:20:57,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2382 Valid, 1477 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [833 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-23 10:20:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2023-11-23 10:20:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1515. [2023-11-23 10:20:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1066 states have (on average 1.472795497185741) internal successors, (1570), 1099 states have internal predecessors, (1570), 358 states have call successors, (358), 91 states have call predecessors, (358), 90 states have return successors, (357), 354 states have call predecessors, (357), 357 states have call successors, (357) [2023-11-23 10:20:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2285 transitions. [2023-11-23 10:20:57,570 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2285 transitions. Word has length 110 [2023-11-23 10:20:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:20:57,571 INFO L495 AbstractCegarLoop]: Abstraction has 1515 states and 2285 transitions. [2023-11-23 10:20:57,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-23 10:20:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2285 transitions. [2023-11-23 10:20:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 10:20:57,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:20:57,574 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:20:57,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 10:20:57,575 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:20:57,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:20:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1696821347, now seen corresponding path program 1 times [2023-11-23 10:20:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:20:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528970316] [2023-11-23 10:20:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:20:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:20:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:20:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:20:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:20:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:20:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:20:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:20:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:20:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:20:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:20:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:20:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 10:20:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:20:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:20:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 10:20:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:20:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-23 10:20:57,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:20:57,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528970316] [2023-11-23 10:20:57,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528970316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:20:57,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:20:57,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:20:57,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616815858] [2023-11-23 10:20:57,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:20:57,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:20:57,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:20:57,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:20:57,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:20:57,960 INFO L87 Difference]: Start difference. First operand 1515 states and 2285 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-23 10:21:01,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:21:03,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:21:03,798 INFO L93 Difference]: Finished difference Result 2174 states and 3437 transitions. [2023-11-23 10:21:03,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 10:21:03,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 4 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 110 [2023-11-23 10:21:03,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:21:03,812 INFO L225 Difference]: With dead ends: 2174 [2023-11-23 10:21:03,813 INFO L226 Difference]: Without dead ends: 2171 [2023-11-23 10:21:03,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:21:03,819 INFO L413 NwaCegarLoop]: 1359 mSDtfsCounter, 880 mSDsluCounter, 3646 mSDsCounter, 0 mSdLazyCounter, 3042 mSolverCounterSat, 241 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 5005 SdHoareTripleChecker+Invalid, 3284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 3042 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-11-23 10:21:03,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 5005 Invalid, 3284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 3042 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2023-11-23 10:21:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2023-11-23 10:21:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 1517. [2023-11-23 10:21:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1068 states have (on average 1.4719101123595506) internal successors, (1572), 1101 states have internal predecessors, (1572), 358 states have call successors, (358), 91 states have call predecessors, (358), 90 states have return successors, (357), 354 states have call predecessors, (357), 357 states have call successors, (357) [2023-11-23 10:21:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2287 transitions. [2023-11-23 10:21:03,912 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2287 transitions. Word has length 110 [2023-11-23 10:21:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:21:03,914 INFO L495 AbstractCegarLoop]: Abstraction has 1517 states and 2287 transitions. [2023-11-23 10:21:03,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-23 10:21:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2287 transitions. [2023-11-23 10:21:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-23 10:21:03,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:21:03,923 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:21:03,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 10:21:03,924 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:21:03,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:21:03,924 INFO L85 PathProgramCache]: Analyzing trace with hash 499142790, now seen corresponding path program 1 times [2023-11-23 10:21:03,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:21:03,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734341583] [2023-11-23 10:21:03,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:03,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:21:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:21:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:21:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:21:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:21:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:21:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:21:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:21:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:21:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:21:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 10:21:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:21:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 10:21:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 10:21:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-23 10:21:04,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:21:04,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734341583] [2023-11-23 10:21:04,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734341583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:21:04,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:21:04,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:21:04,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100355413] [2023-11-23 10:21:04,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:21:04,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:21:04,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:21:04,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:21:04,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:21:04,211 INFO L87 Difference]: Start difference. First operand 1517 states and 2287 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-23 10:21:06,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:21:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:21:07,880 INFO L93 Difference]: Finished difference Result 3206 states and 4890 transitions. [2023-11-23 10:21:07,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 10:21:07,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 119 [2023-11-23 10:21:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:21:07,889 INFO L225 Difference]: With dead ends: 3206 [2023-11-23 10:21:07,890 INFO L226 Difference]: Without dead ends: 1710 [2023-11-23 10:21:07,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-23 10:21:07,896 INFO L413 NwaCegarLoop]: 917 mSDtfsCounter, 2231 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 835 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2363 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 835 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-23 10:21:07,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2363 Valid, 2087 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [835 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-23 10:21:07,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2023-11-23 10:21:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1518. [2023-11-23 10:21:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1069 states have (on average 1.471468662301216) internal successors, (1573), 1102 states have internal predecessors, (1573), 358 states have call successors, (358), 91 states have call predecessors, (358), 90 states have return successors, (357), 354 states have call predecessors, (357), 357 states have call successors, (357) [2023-11-23 10:21:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 2288 transitions. [2023-11-23 10:21:07,953 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 2288 transitions. Word has length 119 [2023-11-23 10:21:07,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:21:07,954 INFO L495 AbstractCegarLoop]: Abstraction has 1518 states and 2288 transitions. [2023-11-23 10:21:07,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-23 10:21:07,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 2288 transitions. [2023-11-23 10:21:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-23 10:21:07,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:21:07,986 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:21:07,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 10:21:07,986 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:21:07,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:21:07,987 INFO L85 PathProgramCache]: Analyzing trace with hash -85328744, now seen corresponding path program 1 times [2023-11-23 10:21:07,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:21:07,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856159500] [2023-11-23 10:21:07,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:07,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:21:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:21:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:21:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:21:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:21:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:21:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:21:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:21:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:21:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:21:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 10:21:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:21:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 10:21:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-23 10:21:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-23 10:21:08,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:21:08,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856159500] [2023-11-23 10:21:08,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856159500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:21:08,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:21:08,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 10:21:08,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138490629] [2023-11-23 10:21:08,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:21:08,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 10:21:08,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:21:08,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 10:21:08,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:21:08,246 INFO L87 Difference]: Start difference. First operand 1518 states and 2288 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 10:21:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:21:12,899 INFO L93 Difference]: Finished difference Result 2190 states and 3459 transitions. [2023-11-23 10:21:12,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 10:21:12,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2023-11-23 10:21:12,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:21:12,909 INFO L225 Difference]: With dead ends: 2190 [2023-11-23 10:21:12,909 INFO L226 Difference]: Without dead ends: 2187 [2023-11-23 10:21:12,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-23 10:21:12,910 INFO L413 NwaCegarLoop]: 1296 mSDtfsCounter, 1442 mSDsluCounter, 3822 mSDsCounter, 0 mSdLazyCounter, 3419 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1663 SdHoareTripleChecker+Valid, 5118 SdHoareTripleChecker+Invalid, 3958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 3419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-23 10:21:12,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1663 Valid, 5118 Invalid, 3958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 3419 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-23 10:21:12,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2023-11-23 10:21:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 1520. [2023-11-23 10:21:12,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1070 states have (on average 1.4710280373831777) internal successors, (1574), 1102 states have internal predecessors, (1574), 359 states have call successors, (359), 91 states have call predecessors, (359), 90 states have return successors, (358), 355 states have call predecessors, (358), 358 states have call successors, (358) [2023-11-23 10:21:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2291 transitions. [2023-11-23 10:21:12,966 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2291 transitions. Word has length 120 [2023-11-23 10:21:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:21:12,967 INFO L495 AbstractCegarLoop]: Abstraction has 1520 states and 2291 transitions. [2023-11-23 10:21:12,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 10:21:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2291 transitions. [2023-11-23 10:21:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-23 10:21:12,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:21:12,972 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:21:12,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 10:21:12,973 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:21:12,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:21:12,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1381898376, now seen corresponding path program 1 times [2023-11-23 10:21:12,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:21:12,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369679872] [2023-11-23 10:21:12,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:12,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:21:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:21:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:21:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:21:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:21:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:21:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:21:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:21:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:21:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:21:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 10:21:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:21:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 10:21:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-23 10:21:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 10:21:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:21:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 10:21:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-23 10:21:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-11-23 10:21:13,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:21:13,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369679872] [2023-11-23 10:21:13,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369679872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:21:13,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:21:13,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 10:21:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761476162] [2023-11-23 10:21:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:21:13,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 10:21:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:21:13,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 10:21:13,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 10:21:13,171 INFO L87 Difference]: Start difference. First operand 1520 states and 2291 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 10:21:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:21:19,295 INFO L93 Difference]: Finished difference Result 4849 states and 7408 transitions. [2023-11-23 10:21:19,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:21:19,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2023-11-23 10:21:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:21:19,316 INFO L225 Difference]: With dead ends: 4849 [2023-11-23 10:21:19,316 INFO L226 Difference]: Without dead ends: 3350 [2023-11-23 10:21:19,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:21:19,324 INFO L413 NwaCegarLoop]: 1450 mSDtfsCounter, 2012 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 3749 SdHoareTripleChecker+Invalid, 3228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-11-23 10:21:19,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2240 Valid, 3749 Invalid, 3228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-11-23 10:21:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2023-11-23 10:21:19,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 2979. [2023-11-23 10:21:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2979 states, 2102 states have (on average 1.4733587059942912) internal successors, (3097), 2166 states have internal predecessors, (3097), 697 states have call successors, (697), 180 states have call predecessors, (697), 179 states have return successors, (696), 688 states have call predecessors, (696), 696 states have call successors, (696) [2023-11-23 10:21:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 4490 transitions. [2023-11-23 10:21:19,510 INFO L78 Accepts]: Start accepts. Automaton has 2979 states and 4490 transitions. Word has length 148 [2023-11-23 10:21:19,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:21:19,511 INFO L495 AbstractCegarLoop]: Abstraction has 2979 states and 4490 transitions. [2023-11-23 10:21:19,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 10:21:19,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 4490 transitions. [2023-11-23 10:21:19,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-23 10:21:19,564 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:21:19,564 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 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] [2023-11-23 10:21:19,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 10:21:19,565 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:21:19,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:21:19,565 INFO L85 PathProgramCache]: Analyzing trace with hash -575463912, now seen corresponding path program 1 times [2023-11-23 10:21:19,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:21:19,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271964191] [2023-11-23 10:21:19,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:19,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:21:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:21:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:21:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:21:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:21:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:21:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:21:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:21:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:21:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:21:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 10:21:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 10:21:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-23 10:21:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 10:21:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-23 10:21:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-23 10:21:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-23 10:21:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-23 10:21:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-23 10:21:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2023-11-23 10:21:19,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:21:19,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271964191] [2023-11-23 10:21:19,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271964191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:21:19,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:21:19,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:21:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105183509] [2023-11-23 10:21:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:21:19,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:21:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:21:19,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:21:19,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:21:19,841 INFO L87 Difference]: Start difference. First operand 2979 states and 4490 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-23 10:21:22,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:21:23,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:21:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:21:25,243 INFO L93 Difference]: Finished difference Result 5256 states and 7969 transitions. [2023-11-23 10:21:25,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 10:21:25,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2023-11-23 10:21:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:21:25,253 INFO L225 Difference]: With dead ends: 5256 [2023-11-23 10:21:25,253 INFO L226 Difference]: Without dead ends: 2288 [2023-11-23 10:21:25,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:21:25,260 INFO L413 NwaCegarLoop]: 929 mSDtfsCounter, 544 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 2734 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 3584 SdHoareTripleChecker+Invalid, 2970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 2734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-11-23 10:21:25,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 3584 Invalid, 2970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 2734 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-11-23 10:21:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2023-11-23 10:21:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2026. [2023-11-23 10:21:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 1417 states have (on average 1.460832745236415) internal successors, (2070), 1458 states have internal predecessors, (2070), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-23 10:21:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 3029 transitions. [2023-11-23 10:21:25,361 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 3029 transitions. Word has length 150 [2023-11-23 10:21:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:21:25,361 INFO L495 AbstractCegarLoop]: Abstraction has 2026 states and 3029 transitions. [2023-11-23 10:21:25,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-23 10:21:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 3029 transitions. [2023-11-23 10:21:25,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-23 10:21:25,368 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:21:25,369 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:21:25,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 10:21:25,369 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:21:25,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:21:25,369 INFO L85 PathProgramCache]: Analyzing trace with hash -79817950, now seen corresponding path program 1 times [2023-11-23 10:21:25,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:21:25,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833444246] [2023-11-23 10:21:25,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:25,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:21:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:21:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:21:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:21:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:21:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:21:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:21:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:21:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:21:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:21:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 10:21:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:21:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 10:21:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-23 10:21:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-23 10:21:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-23 10:21:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-23 10:21:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-23 10:21:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-23 10:21:25,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:21:25,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833444246] [2023-11-23 10:21:25,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833444246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:21:25,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:21:25,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:21:25,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211725888] [2023-11-23 10:21:25,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:21:25,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:21:25,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:21:25,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:21:25,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:21:25,631 INFO L87 Difference]: Start difference. First operand 2026 states and 3029 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 10:21:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:21:28,398 INFO L93 Difference]: Finished difference Result 3803 states and 5782 transitions. [2023-11-23 10:21:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 10:21:28,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2023-11-23 10:21:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:21:28,423 INFO L225 Difference]: With dead ends: 3803 [2023-11-23 10:21:28,424 INFO L226 Difference]: Without dead ends: 2308 [2023-11-23 10:21:28,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-23 10:21:28,429 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 2175 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 831 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2309 SdHoareTripleChecker+Valid, 2190 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 831 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-23 10:21:28,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2309 Valid, 2190 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [831 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-23 10:21:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2023-11-23 10:21:28,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2029. [2023-11-23 10:21:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2029 states, 1420 states have (on average 1.4605633802816902) internal successors, (2074), 1461 states have internal predecessors, (2074), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-23 10:21:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3033 transitions. [2023-11-23 10:21:28,532 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3033 transitions. Word has length 150 [2023-11-23 10:21:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:21:28,532 INFO L495 AbstractCegarLoop]: Abstraction has 2029 states and 3033 transitions. [2023-11-23 10:21:28,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 10:21:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3033 transitions. [2023-11-23 10:21:28,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-23 10:21:28,540 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:21:28,542 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:21:28,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 10:21:28,542 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:21:28,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:21:28,542 INFO L85 PathProgramCache]: Analyzing trace with hash -969866672, now seen corresponding path program 1 times [2023-11-23 10:21:28,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:21:28,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867207127] [2023-11-23 10:21:28,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:28,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:21:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:21:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:21:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:21:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:21:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:21:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:21:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:21:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:21:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:21:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 10:21:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:21:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 10:21:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-23 10:21:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:21:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-23 10:21:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-23 10:21:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-23 10:21:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2023-11-23 10:21:28,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:21:28,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867207127] [2023-11-23 10:21:28,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867207127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:21:28,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:21:28,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 10:21:28,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622321300] [2023-11-23 10:21:28,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:21:28,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 10:21:28,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:21:28,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 10:21:28,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 10:21:28,721 INFO L87 Difference]: Start difference. First operand 2029 states and 3033 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-23 10:21:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:21:31,174 INFO L93 Difference]: Finished difference Result 4302 states and 6538 transitions. [2023-11-23 10:21:31,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 10:21:31,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2023-11-23 10:21:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:21:31,183 INFO L225 Difference]: With dead ends: 4302 [2023-11-23 10:21:31,183 INFO L226 Difference]: Without dead ends: 2294 [2023-11-23 10:21:31,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:21:31,189 INFO L413 NwaCegarLoop]: 929 mSDtfsCounter, 989 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-23 10:21:31,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 2308 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-23 10:21:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2023-11-23 10:21:31,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2029. [2023-11-23 10:21:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2029 states, 1420 states have (on average 1.454225352112676) internal successors, (2065), 1461 states have internal predecessors, (2065), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-23 10:21:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3024 transitions. [2023-11-23 10:21:31,277 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3024 transitions. Word has length 152 [2023-11-23 10:21:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:21:31,277 INFO L495 AbstractCegarLoop]: Abstraction has 2029 states and 3024 transitions. [2023-11-23 10:21:31,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-23 10:21:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3024 transitions. [2023-11-23 10:21:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-23 10:21:31,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:21:31,307 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:21:31,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 10:21:31,307 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:21:31,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:21:31,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1278534922, now seen corresponding path program 1 times [2023-11-23 10:21:31,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:21:31,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505399406] [2023-11-23 10:21:31,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:31,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:21:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:21:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:21:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:21:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:21:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:21:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:21:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:21:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:21:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:21:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 10:21:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:21:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 10:21:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-23 10:21:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:21:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-23 10:21:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-23 10:21:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-23 10:21:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-23 10:21:31,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:21:31,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505399406] [2023-11-23 10:21:31,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505399406] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:21:31,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993335951] [2023-11-23 10:21:31,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:31,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:21:31,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:21:31,627 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) [2023-11-23 10:21:31,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 10:21:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:32,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 10:21:32,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:21:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-23 10:21:32,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 10:21:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-23 10:21:32,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993335951] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 10:21:32,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 10:21:32,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 12 [2023-11-23 10:21:32,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458983759] [2023-11-23 10:21:32,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 10:21:32,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 10:21:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:21:32,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 10:21:32,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-23 10:21:32,479 INFO L87 Difference]: Start difference. First operand 2029 states and 3024 transitions. Second operand has 12 states, 12 states have (on average 13.75) internal successors, (165), 10 states have internal predecessors, (165), 4 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2023-11-23 10:21:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:21:36,123 INFO L93 Difference]: Finished difference Result 3849 states and 5842 transitions. [2023-11-23 10:21:36,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 10:21:36,123 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.75) internal successors, (165), 10 states have internal predecessors, (165), 4 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 155 [2023-11-23 10:21:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:21:36,135 INFO L225 Difference]: With dead ends: 3849 [2023-11-23 10:21:36,135 INFO L226 Difference]: Without dead ends: 2351 [2023-11-23 10:21:36,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-11-23 10:21:36,141 INFO L413 NwaCegarLoop]: 963 mSDtfsCounter, 3306 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 1419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3443 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 3424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1419 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-23 10:21:36,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3443 Valid, 2206 Invalid, 3424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1419 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-23 10:21:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2023-11-23 10:21:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 2034. [2023-11-23 10:21:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1425 states have (on average 1.4540350877192982) internal successors, (2072), 1466 states have internal predecessors, (2072), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-23 10:21:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 3031 transitions. [2023-11-23 10:21:36,273 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 3031 transitions. Word has length 155 [2023-11-23 10:21:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:21:36,274 INFO L495 AbstractCegarLoop]: Abstraction has 2034 states and 3031 transitions. [2023-11-23 10:21:36,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.75) internal successors, (165), 10 states have internal predecessors, (165), 4 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2023-11-23 10:21:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 3031 transitions. [2023-11-23 10:21:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-11-23 10:21:36,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:21:36,284 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:21:36,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 10:21:36,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 10:21:36,504 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:21:36,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:21:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash -863844288, now seen corresponding path program 2 times [2023-11-23 10:21:36,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:21:36,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381691683] [2023-11-23 10:21:36,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:36,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:21:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:21:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:21:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:21:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:21:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:21:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:21:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:21:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:21:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:21:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 10:21:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:21:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 10:21:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-23 10:21:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 10:21:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-23 10:21:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-23 10:21:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-23 10:21:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-23 10:21:36,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:21:36,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381691683] [2023-11-23 10:21:36,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381691683] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:21:36,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72841849] [2023-11-23 10:21:36,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 10:21:36,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:21:36,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:21:36,925 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) [2023-11-23 10:21:36,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 10:21:38,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 10:21:38,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 10:21:38,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 10:21:38,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:21:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-23 10:21:38,459 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 10:21:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-23 10:21:38,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72841849] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 10:21:38,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 10:21:38,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 21 [2023-11-23 10:21:38,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960520452] [2023-11-23 10:21:38,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 10:21:38,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-23 10:21:38,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:21:38,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-23 10:21:38,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2023-11-23 10:21:38,622 INFO L87 Difference]: Start difference. First operand 2034 states and 3031 transitions. Second operand has 21 states, 21 states have (on average 8.714285714285714) internal successors, (183), 19 states have internal predecessors, (183), 4 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2023-11-23 10:21:40,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:21:41,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:21:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:21:44,559 INFO L93 Difference]: Finished difference Result 3974 states and 6041 transitions. [2023-11-23 10:21:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 10:21:44,560 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.714285714285714) internal successors, (183), 19 states have internal predecessors, (183), 4 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 161 [2023-11-23 10:21:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:21:44,571 INFO L225 Difference]: With dead ends: 3974 [2023-11-23 10:21:44,572 INFO L226 Difference]: Without dead ends: 2471 [2023-11-23 10:21:44,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=239, Invalid=517, Unknown=0, NotChecked=0, Total=756 [2023-11-23 10:21:44,578 INFO L413 NwaCegarLoop]: 990 mSDtfsCounter, 3560 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 3136 mSolverCounterSat, 1534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3715 SdHoareTripleChecker+Valid, 3003 SdHoareTripleChecker+Invalid, 4670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1534 IncrementalHoareTripleChecker+Valid, 3136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-11-23 10:21:44,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3715 Valid, 3003 Invalid, 4670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1534 Valid, 3136 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2023-11-23 10:21:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2023-11-23 10:21:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2046. [2023-11-23 10:21:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 1437 states have (on average 1.454418928322895) internal successors, (2090), 1478 states have internal predecessors, (2090), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-23 10:21:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 3049 transitions. [2023-11-23 10:21:44,708 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 3049 transitions. Word has length 161 [2023-11-23 10:21:44,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:21:44,709 INFO L495 AbstractCegarLoop]: Abstraction has 2046 states and 3049 transitions. [2023-11-23 10:21:44,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.714285714285714) internal successors, (183), 19 states have internal predecessors, (183), 4 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2023-11-23 10:21:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 3049 transitions. [2023-11-23 10:21:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-23 10:21:44,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:21:44,718 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:21:44,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 10:21:44,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 10:21:44,932 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:21:44,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:21:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1875001162, now seen corresponding path program 1 times [2023-11-23 10:21:44,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:21:44,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199370531] [2023-11-23 10:21:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:44,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:21:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:21:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:21:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:21:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:21:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:21:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:21:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:21:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:21:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:21:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 10:21:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:21:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 10:21:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-23 10:21:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-23 10:21:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-23 10:21:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-23 10:21:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-23 10:21:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-23 10:21:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-23 10:21:45,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:21:45,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199370531] [2023-11-23 10:21:45,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199370531] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:21:45,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469808923] [2023-11-23 10:21:45,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:45,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:21:45,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:21:45,729 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) [2023-11-23 10:21:45,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 10:21:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:46,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 10:21:46,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:21:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-23 10:21:46,252 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 10:21:46,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469808923] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:21:46,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 10:21:46,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-11-23 10:21:46,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680616573] [2023-11-23 10:21:46,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:21:46,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 10:21:46,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:21:46,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 10:21:46,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-23 10:21:46,253 INFO L87 Difference]: Start difference. First operand 2046 states and 3049 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-23 10:21:47,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:21:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:21:48,192 INFO L93 Difference]: Finished difference Result 3576 states and 5341 transitions. [2023-11-23 10:21:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 10:21:48,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 163 [2023-11-23 10:21:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:21:48,199 INFO L225 Difference]: With dead ends: 3576 [2023-11-23 10:21:48,199 INFO L226 Difference]: Without dead ends: 2046 [2023-11-23 10:21:48,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-23 10:21:48,204 INFO L413 NwaCegarLoop]: 1396 mSDtfsCounter, 2 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2790 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-23 10:21:48,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2790 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-23 10:21:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2023-11-23 10:21:48,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2046. [2023-11-23 10:21:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 1437 states have (on average 1.4523312456506612) internal successors, (2087), 1478 states have internal predecessors, (2087), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-23 10:21:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 3046 transitions. [2023-11-23 10:21:48,291 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 3046 transitions. Word has length 163 [2023-11-23 10:21:48,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:21:48,291 INFO L495 AbstractCegarLoop]: Abstraction has 2046 states and 3046 transitions. [2023-11-23 10:21:48,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-23 10:21:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 3046 transitions. [2023-11-23 10:21:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-23 10:21:48,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:21:48,298 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:21:48,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 10:21:48,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:21:48,515 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:21:48,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:21:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1336722211, now seen corresponding path program 1 times [2023-11-23 10:21:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:21:48,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794860388] [2023-11-23 10:21:48,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:48,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:21:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:21:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:21:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:21:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:21:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:21:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:21:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:21:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:21:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:21:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:21:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:21:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 10:21:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 10:21:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:21:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-23 10:21:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-23 10:21:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-23 10:21:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-23 10:21:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-23 10:21:49,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:21:49,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794860388] [2023-11-23 10:21:49,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794860388] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:21:49,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983986850] [2023-11-23 10:21:49,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:49,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:21:49,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:21:49,243 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) [2023-11-23 10:21:49,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 10:21:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:49,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 10:21:49,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:21:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2023-11-23 10:21:49,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 10:21:49,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983986850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:21:49,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 10:21:49,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-11-23 10:21:49,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060905829] [2023-11-23 10:21:49,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:21:49,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 10:21:49,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:21:49,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 10:21:49,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-23 10:21:49,705 INFO L87 Difference]: Start difference. First operand 2046 states and 3046 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-23 10:21:51,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:21:51,675 INFO L93 Difference]: Finished difference Result 4052 states and 6124 transitions. [2023-11-23 10:21:51,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 10:21:51,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 164 [2023-11-23 10:21:51,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:21:51,683 INFO L225 Difference]: With dead ends: 4052 [2023-11-23 10:21:51,684 INFO L226 Difference]: Without dead ends: 2537 [2023-11-23 10:21:51,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-23 10:21:51,688 INFO L413 NwaCegarLoop]: 1795 mSDtfsCounter, 362 mSDsluCounter, 3239 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 5034 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-23 10:21:51,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 5034 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-23 10:21:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2023-11-23 10:21:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2048. [2023-11-23 10:21:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1439 states have (on average 1.4517025712300209) internal successors, (2089), 1480 states have internal predecessors, (2089), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-23 10:21:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 3048 transitions. [2023-11-23 10:21:51,778 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 3048 transitions. Word has length 164 [2023-11-23 10:21:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:21:51,778 INFO L495 AbstractCegarLoop]: Abstraction has 2048 states and 3048 transitions. [2023-11-23 10:21:51,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-23 10:21:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 3048 transitions. [2023-11-23 10:21:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-23 10:21:51,785 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:21:51,785 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:21:51,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 10:21:52,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:21:52,001 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:21:52,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:21:52,001 INFO L85 PathProgramCache]: Analyzing trace with hash 956493085, now seen corresponding path program 1 times [2023-11-23 10:21:52,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:21:52,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127531342] [2023-11-23 10:21:52,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:52,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:21:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:21:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:21:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:21:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:21:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:21:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:21:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:21:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:21:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:21:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:21:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:21:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 10:21:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 10:21:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:21:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-23 10:21:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-23 10:21:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-23 10:21:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-23 10:21:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-23 10:21:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-23 10:21:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2023-11-23 10:21:52,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:21:52,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127531342] [2023-11-23 10:21:52,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127531342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:21:52,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:21:52,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:21:52,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212426632] [2023-11-23 10:21:52,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:21:52,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:21:52,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:21:52,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:21:52,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:21:52,210 INFO L87 Difference]: Start difference. First operand 2048 states and 3048 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-23 10:21:54,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:21:56,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:21:56,784 INFO L93 Difference]: Finished difference Result 3958 states and 5995 transitions. [2023-11-23 10:21:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 10:21:56,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 169 [2023-11-23 10:21:56,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:21:56,792 INFO L225 Difference]: With dead ends: 3958 [2023-11-23 10:21:56,792 INFO L226 Difference]: Without dead ends: 2441 [2023-11-23 10:21:56,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-23 10:21:56,796 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 1202 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 2664 SdHoareTripleChecker+Invalid, 3557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-23 10:21:56,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 2664 Invalid, 3557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [680 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-23 10:21:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2023-11-23 10:21:56,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2050. [2023-11-23 10:21:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 1441 states have (on average 1.4510756419153366) internal successors, (2091), 1482 states have internal predecessors, (2091), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-23 10:21:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3050 transitions. [2023-11-23 10:21:56,929 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 3050 transitions. Word has length 169 [2023-11-23 10:21:56,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:21:56,929 INFO L495 AbstractCegarLoop]: Abstraction has 2050 states and 3050 transitions. [2023-11-23 10:21:56,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-23 10:21:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 3050 transitions. [2023-11-23 10:21:56,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-23 10:21:56,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:21:56,937 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:21:56,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 10:21:56,937 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:21:56,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:21:56,938 INFO L85 PathProgramCache]: Analyzing trace with hash -618150575, now seen corresponding path program 1 times [2023-11-23 10:21:56,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:21:56,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607138822] [2023-11-23 10:21:56,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:56,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:21:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:21:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:21:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:21:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:21:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:21:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:21:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:21:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:21:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:21:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:21:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:21:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 10:21:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 10:21:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 10:21:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:21:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-23 10:21:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-23 10:21:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-23 10:21:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-23 10:21:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-23 10:21:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-23 10:21:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-23 10:21:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-23 10:21:57,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:21:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607138822] [2023-11-23 10:21:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607138822] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:21:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805248385] [2023-11-23 10:21:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:21:57,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:21:57,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:21:57,685 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) [2023-11-23 10:21:57,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 10:21:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:21:58,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 1422 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-23 10:21:58,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:21:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-11-23 10:21:58,255 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 10:21:58,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805248385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:21:58,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 10:21:58,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 10 [2023-11-23 10:21:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526913917] [2023-11-23 10:21:58,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:21:58,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 10:21:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:21:58,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 10:21:58,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-23 10:21:58,257 INFO L87 Difference]: Start difference. First operand 2050 states and 3050 transitions. Second operand has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-23 10:22:00,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:22:02,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:22:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:22:04,376 INFO L93 Difference]: Finished difference Result 3587 states and 5361 transitions. [2023-11-23 10:22:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 10:22:04,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) Word has length 176 [2023-11-23 10:22:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:22:04,385 INFO L225 Difference]: With dead ends: 3587 [2023-11-23 10:22:04,386 INFO L226 Difference]: Without dead ends: 2063 [2023-11-23 10:22:04,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-23 10:22:04,391 INFO L413 NwaCegarLoop]: 1408 mSDtfsCounter, 773 mSDsluCounter, 7004 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 8412 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-11-23 10:22:04,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 8412 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 654 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2023-11-23 10:22:04,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2023-11-23 10:22:04,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2062. [2023-11-23 10:22:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2062 states, 1447 states have (on average 1.4492052522460264) internal successors, (2097), 1491 states have internal predecessors, (2097), 480 states have call successors, (480), 129 states have call predecessors, (480), 134 states have return successors, (497), 477 states have call predecessors, (497), 479 states have call successors, (497) [2023-11-23 10:22:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 3074 transitions. [2023-11-23 10:22:04,567 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 3074 transitions. Word has length 176 [2023-11-23 10:22:04,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:22:04,567 INFO L495 AbstractCegarLoop]: Abstraction has 2062 states and 3074 transitions. [2023-11-23 10:22:04,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-23 10:22:04,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 3074 transitions. [2023-11-23 10:22:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-11-23 10:22:04,573 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:22:04,574 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:22:04,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 10:22:04,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-23 10:22:04,789 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:22:04,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:22:04,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1629349046, now seen corresponding path program 1 times [2023-11-23 10:22:04,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:22:04,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133930651] [2023-11-23 10:22:04,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:22:04,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:22:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:22:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:22:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:22:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:22:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:22:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:22:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:22:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:22:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:22:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:22:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:22:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:22:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:22:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 10:22:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 10:22:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 10:22:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 10:22:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-23 10:22:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-23 10:22:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-23 10:22:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-23 10:22:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-23 10:22:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-23 10:22:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-23 10:22:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-11-23 10:22:05,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:22:05,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133930651] [2023-11-23 10:22:05,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133930651] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:22:05,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:22:05,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 10:22:05,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504713544] [2023-11-23 10:22:05,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:22:05,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 10:22:05,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:22:05,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 10:22:05,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 10:22:05,185 INFO L87 Difference]: Start difference. First operand 2062 states and 3074 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-23 10:22:07,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:22:08,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:22:10,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:22:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:22:13,886 INFO L93 Difference]: Finished difference Result 3974 states and 6019 transitions. [2023-11-23 10:22:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 10:22:13,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 182 [2023-11-23 10:22:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:22:13,906 INFO L225 Difference]: With dead ends: 3974 [2023-11-23 10:22:13,906 INFO L226 Difference]: Without dead ends: 2447 [2023-11-23 10:22:13,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-23 10:22:13,910 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 1202 mSDsluCounter, 3168 mSDsCounter, 0 mSdLazyCounter, 4814 mSolverCounterSat, 677 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 3909 SdHoareTripleChecker+Invalid, 5491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 677 IncrementalHoareTripleChecker+Valid, 4814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-23 10:22:13,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 3909 Invalid, 5491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [677 Valid, 4814 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-11-23 10:22:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2023-11-23 10:22:14,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2064. [2023-11-23 10:22:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 1449 states have (on average 1.448585231193927) internal successors, (2099), 1492 states have internal predecessors, (2099), 480 states have call successors, (480), 129 states have call predecessors, (480), 134 states have return successors, (497), 478 states have call predecessors, (497), 479 states have call successors, (497) [2023-11-23 10:22:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 3076 transitions. [2023-11-23 10:22:14,056 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 3076 transitions. Word has length 182 [2023-11-23 10:22:14,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:22:14,057 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 3076 transitions. [2023-11-23 10:22:14,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-23 10:22:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 3076 transitions. [2023-11-23 10:22:14,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-11-23 10:22:14,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:22:14,062 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:22:14,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 10:22:14,063 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:22:14,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:22:14,063 INFO L85 PathProgramCache]: Analyzing trace with hash -314648911, now seen corresponding path program 1 times [2023-11-23 10:22:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:22:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482236592] [2023-11-23 10:22:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:22:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:22:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:22:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 10:22:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:22:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 10:22:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 10:22:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 10:22:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:22:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 10:22:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:22:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:22:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:22:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:22:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:22:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 10:22:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 10:22:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 10:22:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 10:22:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:22:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:19,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-23 10:22:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:20,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-23 10:22:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:20,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-23 10:22:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:20,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-23 10:22:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:20,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-23 10:22:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:20,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-23 10:22:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:20,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-23 10:22:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-11-23 10:22:20,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:22:20,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482236592] [2023-11-23 10:22:20,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482236592] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:22:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296044010] [2023-11-23 10:22:20,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:22:20,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:22:20,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:22:20,081 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) [2023-11-23 10:22:20,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 10:22:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:22:20,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 215 conjunts are in the unsatisfiable core [2023-11-23 10:22:20,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:22:20,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 10:22:21,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 10:22:21,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 10:22:21,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 10:22:21,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 10:22:21,792 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 10:22:21,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 16 [2023-11-23 10:22:21,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 10:22:21,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 10:22:21,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 10:22:21,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 10:22:21,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 10:22:22,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 10:22:22,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-23 10:22:22,389 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 10:22:22,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2023-11-23 10:22:22,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-23 10:22:22,924 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 10:22:22,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2023-11-23 10:22:22,938 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-11-23 10:22:22,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 56 treesize of output 60 [2023-11-23 10:22:22,949 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 10:22:22,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2023-11-23 10:22:23,656 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2023-11-23 10:22:23,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 18 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 29 case distinctions, treesize of input 87 treesize of output 117 [2023-11-23 10:22:23,742 INFO L349 Elim1Store]: treesize reduction 40, result has 50.6 percent of original size [2023-11-23 10:22:23,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 72 [2023-11-23 10:22:23,777 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-23 10:22:23,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 79 [2023-11-23 10:22:23,800 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-23 10:22:23,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 70 [2023-11-23 10:22:23,842 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-23 10:22:23,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 53 [2023-11-23 10:22:23,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2023-11-23 10:22:23,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2023-11-23 10:22:24,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2023-11-23 10:22:24,566 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-23 10:22:24,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 111 treesize of output 109 [2023-11-23 10:22:24,588 INFO L349 Elim1Store]: treesize reduction 100, result has 1.0 percent of original size [2023-11-23 10:22:24,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 32 case distinctions, treesize of input 145 treesize of output 151 [2023-11-23 10:22:24,609 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-23 10:22:24,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 62 [2023-11-23 10:22:24,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 10:22:24,634 INFO L349 Elim1Store]: treesize reduction 45, result has 10.0 percent of original size [2023-11-23 10:22:24,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 78 [2023-11-23 10:22:24,653 INFO L349 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-11-23 10:22:24,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 76 [2023-11-23 10:22:24,671 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-23 10:22:24,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 44 [2023-11-23 10:22:25,387 INFO L349 Elim1Store]: treesize reduction 100, result has 1.0 percent of original size [2023-11-23 10:22:25,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 32 case distinctions, treesize of input 144 treesize of output 136 [2023-11-23 10:22:25,413 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-23 10:22:25,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 98 treesize of output 82 [2023-11-23 10:22:25,430 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-23 10:22:25,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 41 [2023-11-23 10:22:26,401 INFO L349 Elim1Store]: treesize reduction 251, result has 3.5 percent of original size [2023-11-23 10:22:26,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 42 case distinctions, treesize of input 146 treesize of output 152 [2023-11-23 10:22:26,436 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-23 10:22:26,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 98 treesize of output 82 [2023-11-23 10:22:26,455 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-23 10:22:26,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 41 [2023-11-23 10:22:28,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 10:22:28,073 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-23 10:22:28,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 176 treesize of output 112 [2023-11-23 10:22:28,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 10:22:28,094 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 10:22:28,105 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2023-11-23 10:22:28,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 6 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 38 case distinctions, treesize of input 154 treesize of output 70 [2023-11-23 10:22:28,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 10:22:28,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 10:22:28,120 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-23 10:22:28,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 40 [2023-11-23 10:22:28,129 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-23 10:22:28,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 13 [2023-11-23 10:22:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 65 proven. 13 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-23 10:22:28,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 10:22:28,296 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1008) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1009) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1010) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (< .cse0 1) (< 2147483647 .cse0)))) is different from false [2023-11-23 10:22:28,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296044010] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:22:28,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 10:22:28,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 39] total 69 [2023-11-23 10:22:28,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795161100] [2023-11-23 10:22:28,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 10:22:28,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-23 10:22:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:22:28,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-23 10:22:28,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=4461, Unknown=1, NotChecked=134, Total=4830 [2023-11-23 10:22:28,314 INFO L87 Difference]: Start difference. First operand 2064 states and 3076 transitions. Second operand has 69 states, 59 states have (on average 3.440677966101695) internal successors, (203), 51 states have internal predecessors, (203), 22 states have call successors, (47), 14 states have call predecessors, (47), 17 states have return successors, (39), 25 states have call predecessors, (39), 21 states have call successors, (39) [2023-11-23 10:22:38,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 10:22:46,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 10:22:50,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 10:23:41,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:23:43,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:23:45,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:23:49,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:23:51,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 10:23:54,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:23:57,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 10:23:59,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:24:05,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:24:10,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:24:16,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:24:19,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:24:21,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 10:24:25,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:24:29,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:24:37,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 10:24:41,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15