./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:10:43,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:10:43,416 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-06 22:10:43,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:10:43,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:10:43,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:10:43,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:10:43,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:10:43,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:10:43,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:10:43,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:10:43,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:10:43,463 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:10:43,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:10:43,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:10:43,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:10:43,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:10:43,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:10:43,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:10:43,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:10:43,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:10:43,468 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:10:43,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:10:43,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:10:43,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:10:43,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:43,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:10:43,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:10:43,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:10:43,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:10:43,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:10:43,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:10:43,474 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:10:43,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:10:43,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:10:43,475 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:10:43,476 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb [2023-11-06 22:10:43,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:10:43,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:10:43,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:10:43,862 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:10:43,862 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:10:43,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2023-11-06 22:10:46,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:10:47,523 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:10:47,525 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2023-11-06 22:10:47,578 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/data/e4549faf6/7260d70340e84ed998e018a59e95cd24/FLAG38198853c [2023-11-06 22:10:47,598 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/data/e4549faf6/7260d70340e84ed998e018a59e95cd24 [2023-11-06 22:10:47,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:10:47,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:10:47,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:47,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:10:47,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:10:47,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:47" (1/1) ... [2023-11-06 22:10:47,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692419ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:47, skipping insertion in model container [2023-11-06 22:10:47,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:47" (1/1) ... [2023-11-06 22:10:47,756 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:10:49,161 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2023-11-06 22:10:49,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:49,210 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:10:49,315 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4703] [2023-11-06 22:10:49,317 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4710] [2023-11-06 22:10:49,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4718-4719] [2023-11-06 22:10:49,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4727-4728] [2023-11-06 22:10:49,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4750] [2023-11-06 22:10:49,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4753] [2023-11-06 22:10:49,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4756] [2023-11-06 22:10:49,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4759] [2023-11-06 22:10:49,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5123] [2023-11-06 22:10:49,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5127] [2023-11-06 22:10:49,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5131] [2023-11-06 22:10:49,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5135] [2023-11-06 22:10:49,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5146] [2023-11-06 22:10:49,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5150] [2023-11-06 22:10:49,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5154] [2023-11-06 22:10:49,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5158] [2023-11-06 22:10:49,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5169] [2023-11-06 22:10:49,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5173] [2023-11-06 22:10:49,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5177] [2023-11-06 22:10:49,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5181] [2023-11-06 22:10:49,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5192] [2023-11-06 22:10:49,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5196] [2023-11-06 22:10:49,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5200] [2023-11-06 22:10:49,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5204] [2023-11-06 22:10:49,358 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5254] [2023-11-06 22:10:49,358 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5258] [2023-11-06 22:10:49,359 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5262] [2023-11-06 22:10:49,359 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5266] [2023-11-06 22:10:49,360 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5277] [2023-11-06 22:10:49,360 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5281] [2023-11-06 22:10:49,361 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5285] [2023-11-06 22:10:49,361 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5289] [2023-11-06 22:10:49,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5300] [2023-11-06 22:10:49,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5304] [2023-11-06 22:10:49,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5308] [2023-11-06 22:10:49,363 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5312] [2023-11-06 22:10:49,363 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5323] [2023-11-06 22:10:49,364 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5327] [2023-11-06 22:10:49,364 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5331] [2023-11-06 22:10:49,366 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5335] [2023-11-06 22:10:49,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5409] [2023-11-06 22:10:49,370 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5413] [2023-11-06 22:10:49,370 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5417] [2023-11-06 22:10:49,370 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5421] [2023-11-06 22:10:49,371 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5432] [2023-11-06 22:10:49,371 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5436] [2023-11-06 22:10:49,372 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5440] [2023-11-06 22:10:49,372 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5444] [2023-11-06 22:10:49,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5455] [2023-11-06 22:10:49,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5459] [2023-11-06 22:10:49,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5463] [2023-11-06 22:10:49,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5467] [2023-11-06 22:10:49,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6408] [2023-11-06 22:10:49,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6411] [2023-11-06 22:10:49,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6414] [2023-11-06 22:10:49,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6417] [2023-11-06 22:10:49,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6420] [2023-11-06 22:10:49,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6433] [2023-11-06 22:10:49,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6436] [2023-11-06 22:10:49,525 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6439] [2023-11-06 22:10:49,525 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6442] [2023-11-06 22:10:49,525 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6445] [2023-11-06 22:10:49,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6467] [2023-11-06 22:10:49,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6470] [2023-11-06 22:10:49,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6473] [2023-11-06 22:10:49,528 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6476] [2023-11-06 22:10:49,528 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6479] [2023-11-06 22:10:49,529 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6512-6513] [2023-11-06 22:10:49,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6516-6517] [2023-11-06 22:10:49,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6520-6521] [2023-11-06 22:10:49,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6524-6525] [2023-11-06 22:10:49,531 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6528-6529] [2023-11-06 22:10:49,531 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6542] [2023-11-06 22:10:49,531 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6545] [2023-11-06 22:10:49,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6548] [2023-11-06 22:10:49,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6551] [2023-11-06 22:10:49,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6554] [2023-11-06 22:10:49,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6587-6588] [2023-11-06 22:10:49,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6591-6592] [2023-11-06 22:10:49,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6595-6596] [2023-11-06 22:10:49,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6599-6600] [2023-11-06 22:10:49,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6603-6604] [2023-11-06 22:10:49,557 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2023-11-06 22:10:49,563 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:49,663 WARN L672 CHandler]: The function __xchg_wrong_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:10:49,664 WARN L672 CHandler]: The function __bad_percpu_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:10:49,664 WARN L672 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:10:49,672 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:10:49,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:49 WrapperNode [2023-11-06 22:10:49,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:49,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:49,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:10:49,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:10:49,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:49" (1/1) ... [2023-11-06 22:10:49,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:49" (1/1) ... [2023-11-06 22:10:49,948 INFO L138 Inliner]: procedures = 157, calls = 829, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 2933 [2023-11-06 22:10:49,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:49,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:10:49,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:10:49,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:10:49,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:49" (1/1) ... [2023-11-06 22:10:49,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:49" (1/1) ... [2023-11-06 22:10:49,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:49" (1/1) ... [2023-11-06 22:10:49,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:49" (1/1) ... [2023-11-06 22:10:50,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:49" (1/1) ... [2023-11-06 22:10:50,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:49" (1/1) ... [2023-11-06 22:10:50,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:49" (1/1) ... [2023-11-06 22:10:50,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:49" (1/1) ... [2023-11-06 22:10:50,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:10:50,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:10:50,196 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:10:50,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:10:50,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:49" (1/1) ... [2023-11-06 22:10:50,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:50,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:50,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:10:50,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:10:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-06 22:10:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2023-11-06 22:10:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-06 22:10:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-06 22:10:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:10:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2023-11-06 22:10:50,273 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2023-11-06 22:10:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2023-11-06 22:10:50,273 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2023-11-06 22:10:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2023-11-06 22:10:50,273 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2023-11-06 22:10:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2023-11-06 22:10:50,273 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2023-11-06 22:10:50,274 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2023-11-06 22:10:50,274 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2023-11-06 22:10:50,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-06 22:10:50,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-06 22:10:50,274 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2023-11-06 22:10:50,274 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2023-11-06 22:10:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2023-11-06 22:10:50,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2023-11-06 22:10:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2023-11-06 22:10:50,275 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2023-11-06 22:10:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-06 22:10:50,275 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-06 22:10:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2023-11-06 22:10:50,276 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2023-11-06 22:10:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:10:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2023-11-06 22:10:50,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2023-11-06 22:10:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2023-11-06 22:10:50,276 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2023-11-06 22:10:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2023-11-06 22:10:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2023-11-06 22:10:50,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-06 22:10:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-06 22:10:50,277 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2023-11-06 22:10:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2023-11-06 22:10:50,277 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2023-11-06 22:10:50,278 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2023-11-06 22:10:50,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:10:50,278 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2023-11-06 22:10:50,278 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2023-11-06 22:10:50,278 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2023-11-06 22:10:50,278 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2023-11-06 22:10:50,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:10:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2023-11-06 22:10:50,279 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2023-11-06 22:10:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2023-11-06 22:10:50,279 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2023-11-06 22:10:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:10:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:10:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-06 22:10:50,280 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2023-11-06 22:10:50,280 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2023-11-06 22:10:50,280 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2023-11-06 22:10:50,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:10:50,280 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2023-11-06 22:10:50,280 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2023-11-06 22:10:50,281 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2023-11-06 22:10:50,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2023-11-06 22:10:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2023-11-06 22:10:50,282 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2023-11-06 22:10:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2023-11-06 22:10:50,283 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2023-11-06 22:10:50,283 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2023-11-06 22:10:50,283 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2023-11-06 22:10:50,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:10:50,283 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2023-11-06 22:10:50,284 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2023-11-06 22:10:50,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:10:50,287 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2023-11-06 22:10:50,288 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2023-11-06 22:10:50,288 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2023-11-06 22:10:50,288 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2023-11-06 22:10:50,288 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2023-11-06 22:10:50,289 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2023-11-06 22:10:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-06 22:10:50,290 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-06 22:10:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-06 22:10:50,295 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-06 22:10:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2023-11-06 22:10:50,296 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2023-11-06 22:10:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2023-11-06 22:10:50,296 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2023-11-06 22:10:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2023-11-06 22:10:50,297 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2023-11-06 22:10:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2023-11-06 22:10:50,298 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2023-11-06 22:10:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2023-11-06 22:10:50,298 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2023-11-06 22:10:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:10:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2023-11-06 22:10:50,298 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2023-11-06 22:10:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2023-11-06 22:10:50,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2023-11-06 22:10:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2023-11-06 22:10:50,299 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2023-11-06 22:10:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2023-11-06 22:10:50,299 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2023-11-06 22:10:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-06 22:10:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:10:50,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:10:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2023-11-06 22:10:50,300 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2023-11-06 22:10:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2023-11-06 22:10:50,301 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2023-11-06 22:10:50,846 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:10:50,849 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:10:53,795 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:10:53,821 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:10:53,821 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:10:53,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:53 BoogieIcfgContainer [2023-11-06 22:10:53,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:10:53,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:10:53,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:10:53,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:10:53,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:10:47" (1/3) ... [2023-11-06 22:10:53,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5fb748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:53, skipping insertion in model container [2023-11-06 22:10:53,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:49" (2/3) ... [2023-11-06 22:10:53,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5fb748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:53, skipping insertion in model container [2023-11-06 22:10:53,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:53" (3/3) ... [2023-11-06 22:10:53,885 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2023-11-06 22:10:53,905 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:10:53,906 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:10:53,992 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:10:53,999 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=LoopsAndPotentialCycles, 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;@124bfc78, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:10:53,999 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:10:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 1029 states, 760 states have (on average 1.4342105263157894) internal successors, (1090), 787 states have internal predecessors, (1090), 223 states have call successors, (223), 44 states have call predecessors, (223), 44 states have return successors, (223), 221 states have call predecessors, (223), 223 states have call successors, (223) [2023-11-06 22:10:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-06 22:10:54,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:54,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:54,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:54,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:54,034 INFO L85 PathProgramCache]: Analyzing trace with hash -569159245, now seen corresponding path program 1 times [2023-11-06 22:10:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:54,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797179038] [2023-11-06 22:10:54,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:54,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:10:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:54,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:10:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:54,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:10:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:54,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:10:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:54,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:10:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:54,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:54,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:10:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:54,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:10:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:10:54,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:54,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797179038] [2023-11-06 22:10:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797179038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:54,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:54,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:54,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920550353] [2023-11-06 22:10:54,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:54,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:54,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:54,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:54,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:54,775 INFO L87 Difference]: Start difference. First operand has 1029 states, 760 states have (on average 1.4342105263157894) internal successors, (1090), 787 states have internal predecessors, (1090), 223 states have call successors, (223), 44 states have call predecessors, (223), 44 states have return successors, (223), 221 states have call predecessors, (223), 223 states have call successors, (223) Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:10:57,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:57,095 INFO L93 Difference]: Finished difference Result 2074 states and 3116 transitions. [2023-11-06 22:10:57,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:10:57,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2023-11-06 22:10:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:57,135 INFO L225 Difference]: With dead ends: 2074 [2023-11-06 22:10:57,136 INFO L226 Difference]: Without dead ends: 1006 [2023-11-06 22:10:57,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:57,162 INFO L413 NwaCegarLoop]: 1077 mSDtfsCounter, 1682 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:57,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 1726 Invalid, 1081 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [388 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 22:10:57,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2023-11-06 22:10:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 986. [2023-11-06 22:10:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 728 states have (on average 1.4244505494505495) internal successors, (1037), 752 states have internal predecessors, (1037), 213 states have call successors, (213), 44 states have call predecessors, (213), 44 states have return successors, (213), 211 states have call predecessors, (213), 213 states have call successors, (213) [2023-11-06 22:10:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1463 transitions. [2023-11-06 22:10:57,384 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1463 transitions. Word has length 77 [2023-11-06 22:10:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:57,386 INFO L495 AbstractCegarLoop]: Abstraction has 986 states and 1463 transitions. [2023-11-06 22:10:57,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:10:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1463 transitions. [2023-11-06 22:10:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-06 22:10:57,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:57,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:57,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:10:57,395 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:57,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:57,395 INFO L85 PathProgramCache]: Analyzing trace with hash -8459467, now seen corresponding path program 1 times [2023-11-06 22:10:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:57,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962190243] [2023-11-06 22:10:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:57,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:57,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:10:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:57,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:10:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:57,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:10:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:57,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:10:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:57,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:10:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:57,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:57,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:57,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:10:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:57,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:10:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:10:57,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:57,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962190243] [2023-11-06 22:10:57,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962190243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:57,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:57,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:10:57,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661841129] [2023-11-06 22:10:57,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:57,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:10:57,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:57,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:10:57,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:57,825 INFO L87 Difference]: Start difference. First operand 986 states and 1463 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:11:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:00,758 INFO L93 Difference]: Finished difference Result 1408 states and 2145 transitions. [2023-11-06 22:11:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:11:00,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 77 [2023-11-06 22:11:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:00,772 INFO L225 Difference]: With dead ends: 1408 [2023-11-06 22:11:00,772 INFO L226 Difference]: Without dead ends: 1406 [2023-11-06 22:11:00,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:11:00,776 INFO L413 NwaCegarLoop]: 1647 mSDtfsCounter, 865 mSDsluCounter, 3420 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 5067 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:00,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 5067 Invalid, 2219 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [166 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-06 22:11:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2023-11-06 22:11:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 988. [2023-11-06 22:11:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 730 states have (on average 1.4232876712328768) internal successors, (1039), 754 states have internal predecessors, (1039), 213 states have call successors, (213), 44 states have call predecessors, (213), 44 states have return successors, (213), 211 states have call predecessors, (213), 213 states have call successors, (213) [2023-11-06 22:11:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1465 transitions. [2023-11-06 22:11:00,899 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1465 transitions. Word has length 77 [2023-11-06 22:11:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:00,900 INFO L495 AbstractCegarLoop]: Abstraction has 988 states and 1465 transitions. [2023-11-06 22:11:00,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:11:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1465 transitions. [2023-11-06 22:11:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-06 22:11:00,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:00,904 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:00,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:11:00,905 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:00,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:00,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1050832346, now seen corresponding path program 1 times [2023-11-06 22:11:00,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:00,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205269842] [2023-11-06 22:11:00,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:00,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:01,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:01,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:01,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:11:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:01,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:11:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:01,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:11:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:01,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:11:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:01,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:11:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:01,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:01,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:11:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:01,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:11:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:11:01,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:01,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205269842] [2023-11-06 22:11:01,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205269842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:01,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:01,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:11:01,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684621094] [2023-11-06 22:11:01,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:01,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:11:01,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:01,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:11:01,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:11:01,314 INFO L87 Difference]: Start difference. First operand 988 states and 1465 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-06 22:11:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:03,553 INFO L93 Difference]: Finished difference Result 1977 states and 2939 transitions. [2023-11-06 22:11:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:11:03,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2023-11-06 22:11:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:03,567 INFO L225 Difference]: With dead ends: 1977 [2023-11-06 22:11:03,567 INFO L226 Difference]: Without dead ends: 1019 [2023-11-06 22:11:03,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:11:03,578 INFO L413 NwaCegarLoop]: 1011 mSDtfsCounter, 1614 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:03,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 2302 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 22:11:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2023-11-06 22:11:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 989. [2023-11-06 22:11:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 731 states have (on average 1.4227086183310533) internal successors, (1040), 755 states have internal predecessors, (1040), 213 states have call successors, (213), 44 states have call predecessors, (213), 44 states have return successors, (213), 211 states have call predecessors, (213), 213 states have call successors, (213) [2023-11-06 22:11:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1466 transitions. [2023-11-06 22:11:03,655 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1466 transitions. Word has length 87 [2023-11-06 22:11:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:03,655 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1466 transitions. [2023-11-06 22:11:03,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-06 22:11:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1466 transitions. [2023-11-06 22:11:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 22:11:03,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:03,660 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:03,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:11:03,660 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:03,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash -519002885, now seen corresponding path program 1 times [2023-11-06 22:11:03,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:03,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218681816] [2023-11-06 22:11:03,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:03,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:03,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:03,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:11:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:03,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:11:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:03,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:11:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:03,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:11:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:03,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:11:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:03,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:03,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:11:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:03,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:11:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:11:03,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:03,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218681816] [2023-11-06 22:11:03,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218681816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:03,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:03,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:11:03,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520607975] [2023-11-06 22:11:03,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:03,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:11:03,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:03,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:11:03,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:11:03,822 INFO L87 Difference]: Start difference. First operand 989 states and 1466 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 22:11:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:05,754 INFO L93 Difference]: Finished difference Result 1969 states and 2926 transitions. [2023-11-06 22:11:05,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:11:05,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 89 [2023-11-06 22:11:05,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:05,769 INFO L225 Difference]: With dead ends: 1969 [2023-11-06 22:11:05,769 INFO L226 Difference]: Without dead ends: 1010 [2023-11-06 22:11:05,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:11:05,784 INFO L413 NwaCegarLoop]: 1029 mSDtfsCounter, 448 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:05,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 2533 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 22:11:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2023-11-06 22:11:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 990. [2023-11-06 22:11:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 732 states have (on average 1.4221311475409837) internal successors, (1041), 756 states have internal predecessors, (1041), 213 states have call successors, (213), 44 states have call predecessors, (213), 44 states have return successors, (213), 211 states have call predecessors, (213), 213 states have call successors, (213) [2023-11-06 22:11:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1467 transitions. [2023-11-06 22:11:05,883 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1467 transitions. Word has length 89 [2023-11-06 22:11:05,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:05,886 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 1467 transitions. [2023-11-06 22:11:05,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 22:11:05,886 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1467 transitions. [2023-11-06 22:11:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 22:11:05,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:05,892 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:05,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:11:05,893 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:05,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:05,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1199061255, now seen corresponding path program 1 times [2023-11-06 22:11:05,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:05,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306518611] [2023-11-06 22:11:05,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:05,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:06,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:06,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:06,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:11:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:06,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:11:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:06,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:11:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:06,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:11:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:06,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:11:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:06,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:06,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:11:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:06,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:11:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:11:06,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:06,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306518611] [2023-11-06 22:11:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306518611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:06,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:06,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:11:06,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255254718] [2023-11-06 22:11:06,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:06,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:11:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:06,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:11:06,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:11:06,244 INFO L87 Difference]: Start difference. First operand 990 states and 1467 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 22:11:09,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:09,560 INFO L93 Difference]: Finished difference Result 1425 states and 2168 transitions. [2023-11-06 22:11:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:11:09,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 89 [2023-11-06 22:11:09,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:09,571 INFO L225 Difference]: With dead ends: 1425 [2023-11-06 22:11:09,572 INFO L226 Difference]: Without dead ends: 1423 [2023-11-06 22:11:09,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:11:09,573 INFO L413 NwaCegarLoop]: 1665 mSDtfsCounter, 984 mSDsluCounter, 4743 mSDsCounter, 0 mSdLazyCounter, 2754 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 6408 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 2754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:09,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 6408 Invalid, 2922 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [168 Valid, 2754 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-06 22:11:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2023-11-06 22:11:09,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 992. [2023-11-06 22:11:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 733 states have (on average 1.4215552523874488) internal successors, (1042), 756 states have internal predecessors, (1042), 214 states have call successors, (214), 44 states have call predecessors, (214), 44 states have return successors, (214), 212 states have call predecessors, (214), 214 states have call successors, (214) [2023-11-06 22:11:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1470 transitions. [2023-11-06 22:11:09,657 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1470 transitions. Word has length 89 [2023-11-06 22:11:09,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:09,659 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1470 transitions. [2023-11-06 22:11:09,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 22:11:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1470 transitions. [2023-11-06 22:11:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-06 22:11:09,665 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:09,665 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:09,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:11:09,666 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:09,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:09,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1270378389, now seen corresponding path program 1 times [2023-11-06 22:11:09,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:09,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961206759] [2023-11-06 22:11:09,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:09,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:11:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:11:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:11:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:11:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:11:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:11:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:11:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:11:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:11:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 22:11:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-06 22:11:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:11:09,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:09,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961206759] [2023-11-06 22:11:09,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961206759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:09,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:09,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:11:09,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459203469] [2023-11-06 22:11:09,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:09,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:11:09,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:09,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:11:09,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:11:09,947 INFO L87 Difference]: Start difference. First operand 992 states and 1470 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-06 22:11:13,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:13,736 INFO L93 Difference]: Finished difference Result 2930 states and 4353 transitions. [2023-11-06 22:11:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:11:13,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2023-11-06 22:11:13,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:13,752 INFO L225 Difference]: With dead ends: 2930 [2023-11-06 22:11:13,752 INFO L226 Difference]: Without dead ends: 1968 [2023-11-06 22:11:13,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:11:13,757 INFO L413 NwaCegarLoop]: 1213 mSDtfsCounter, 1978 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2165 SdHoareTripleChecker+Valid, 2756 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:13,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2165 Valid, 2756 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-06 22:11:13,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2023-11-06 22:11:13,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1926. [2023-11-06 22:11:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1425 states have (on average 1.4259649122807017) internal successors, (2032), 1470 states have internal predecessors, (2032), 413 states have call successors, (413), 87 states have call predecessors, (413), 87 states have return successors, (413), 409 states have call predecessors, (413), 413 states have call successors, (413) [2023-11-06 22:11:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2858 transitions. [2023-11-06 22:11:14,050 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2858 transitions. Word has length 121 [2023-11-06 22:11:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:14,051 INFO L495 AbstractCegarLoop]: Abstraction has 1926 states and 2858 transitions. [2023-11-06 22:11:14,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-06 22:11:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2858 transitions. [2023-11-06 22:11:14,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-06 22:11:14,061 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:14,061 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:14,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:11:14,062 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:14,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:14,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1297985271, now seen corresponding path program 1 times [2023-11-06 22:11:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728925067] [2023-11-06 22:11:14,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:11:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:11:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:11:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:11:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:11:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:11:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:11:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:11:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:11:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-06 22:11:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:11:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:11:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:11:14,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:14,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728925067] [2023-11-06 22:11:14,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728925067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:14,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:14,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:11:14,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374905608] [2023-11-06 22:11:14,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:14,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:11:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:14,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:11:14,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:11:14,332 INFO L87 Difference]: Start difference. First operand 1926 states and 2858 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:11:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:16,830 INFO L93 Difference]: Finished difference Result 2940 states and 4348 transitions. [2023-11-06 22:11:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:11:16,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2023-11-06 22:11:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:16,839 INFO L225 Difference]: With dead ends: 2940 [2023-11-06 22:11:16,839 INFO L226 Difference]: Without dead ends: 1042 [2023-11-06 22:11:16,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:11:16,847 INFO L413 NwaCegarLoop]: 1015 mSDtfsCounter, 449 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 3388 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:16,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 3388 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-06 22:11:16,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2023-11-06 22:11:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1013. [2023-11-06 22:11:17,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 748 states have (on average 1.411764705882353) internal successors, (1056), 771 states have internal predecessors, (1056), 215 states have call successors, (215), 49 states have call predecessors, (215), 49 states have return successors, (215), 213 states have call predecessors, (215), 215 states have call successors, (215) [2023-11-06 22:11:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1486 transitions. [2023-11-06 22:11:17,039 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1486 transitions. Word has length 123 [2023-11-06 22:11:17,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:17,040 INFO L495 AbstractCegarLoop]: Abstraction has 1013 states and 1486 transitions. [2023-11-06 22:11:17,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:11:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1486 transitions. [2023-11-06 22:11:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-06 22:11:17,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:17,047 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:17,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:11:17,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:17,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:17,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1408990385, now seen corresponding path program 1 times [2023-11-06 22:11:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623878639] [2023-11-06 22:11:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:17,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:11:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:11:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:11:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:11:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:11:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:11:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:11:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:11:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-06 22:11:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:11:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:11:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:17,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:11:17,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:17,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623878639] [2023-11-06 22:11:17,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623878639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:17,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:17,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:11:17,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97641651] [2023-11-06 22:11:17,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:17,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:11:17,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:17,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:11:17,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:11:17,415 INFO L87 Difference]: Start difference. First operand 1013 states and 1486 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-06 22:11:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:19,709 INFO L93 Difference]: Finished difference Result 2030 states and 2995 transitions. [2023-11-06 22:11:19,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:11:19,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2023-11-06 22:11:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:19,718 INFO L225 Difference]: With dead ends: 2030 [2023-11-06 22:11:19,719 INFO L226 Difference]: Without dead ends: 1068 [2023-11-06 22:11:19,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:11:19,724 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 1626 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1768 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:19,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1768 Valid, 2279 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 22:11:19,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2023-11-06 22:11:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1017. [2023-11-06 22:11:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 752 states have (on average 1.4109042553191489) internal successors, (1061), 775 states have internal predecessors, (1061), 215 states have call successors, (215), 49 states have call predecessors, (215), 49 states have return successors, (215), 213 states have call predecessors, (215), 215 states have call successors, (215) [2023-11-06 22:11:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1491 transitions. [2023-11-06 22:11:19,873 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1491 transitions. Word has length 123 [2023-11-06 22:11:19,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:19,874 INFO L495 AbstractCegarLoop]: Abstraction has 1017 states and 1491 transitions. [2023-11-06 22:11:19,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-06 22:11:19,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1491 transitions. [2023-11-06 22:11:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-06 22:11:19,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:19,880 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:19,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:11:19,880 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:19,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:19,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1292590116, now seen corresponding path program 1 times [2023-11-06 22:11:19,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:19,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193376453] [2023-11-06 22:11:19,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:19,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:11:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:11:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:11:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:11:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:11:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:11:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:11:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:11:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 22:11:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:11:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:11:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 22:11:20,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:20,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193376453] [2023-11-06 22:11:20,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193376453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:20,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:20,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:11:20,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484395445] [2023-11-06 22:11:20,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:20,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:11:20,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:20,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:11:20,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:11:20,122 INFO L87 Difference]: Start difference. First operand 1017 states and 1491 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 22:11:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:22,125 INFO L93 Difference]: Finished difference Result 2013 states and 2974 transitions. [2023-11-06 22:11:22,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:11:22,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2023-11-06 22:11:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:22,133 INFO L225 Difference]: With dead ends: 2013 [2023-11-06 22:11:22,133 INFO L226 Difference]: Without dead ends: 1047 [2023-11-06 22:11:22,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:11:22,139 INFO L413 NwaCegarLoop]: 1011 mSDtfsCounter, 445 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 2504 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:22,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 2504 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 22:11:22,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2023-11-06 22:11:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1017. [2023-11-06 22:11:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 752 states have (on average 1.4069148936170213) internal successors, (1058), 775 states have internal predecessors, (1058), 215 states have call successors, (215), 49 states have call predecessors, (215), 49 states have return successors, (215), 213 states have call predecessors, (215), 215 states have call successors, (215) [2023-11-06 22:11:22,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1488 transitions. [2023-11-06 22:11:22,267 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1488 transitions. Word has length 126 [2023-11-06 22:11:22,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:22,268 INFO L495 AbstractCegarLoop]: Abstraction has 1017 states and 1488 transitions. [2023-11-06 22:11:22,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 22:11:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1488 transitions. [2023-11-06 22:11:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 22:11:22,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:22,274 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:22,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:11:22,275 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:22,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1964651259, now seen corresponding path program 1 times [2023-11-06 22:11:22,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:22,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550136411] [2023-11-06 22:11:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:22,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:11:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:11:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:11:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:11:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:11:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:11:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:11:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:11:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 22:11:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:11:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:11:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:11:22,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:22,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550136411] [2023-11-06 22:11:22,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550136411] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:11:22,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632228569] [2023-11-06 22:11:22,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:22,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:11:22,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:11:22,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:11:22,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:11:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:23,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:11:23,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:11:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:11:23,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:11:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:11:23,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632228569] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:11:23,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:11:23,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 11 [2023-11-06 22:11:23,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522188565] [2023-11-06 22:11:23,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:11:23,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:11:23,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:23,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:11:23,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:11:23,625 INFO L87 Difference]: Start difference. First operand 1017 states and 1488 transitions. Second operand has 11 states, 11 states have (on average 16.09090909090909) internal successors, (177), 10 states have internal predecessors, (177), 4 states have call successors, (38), 4 states have call predecessors, (38), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2023-11-06 22:11:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:26,741 INFO L93 Difference]: Finished difference Result 2089 states and 3077 transitions. [2023-11-06 22:11:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:11:26,741 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 16.09090909090909) internal successors, (177), 10 states have internal predecessors, (177), 4 states have call successors, (38), 4 states have call predecessors, (38), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 129 [2023-11-06 22:11:26,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:26,750 INFO L225 Difference]: With dead ends: 2089 [2023-11-06 22:11:26,750 INFO L226 Difference]: Without dead ends: 1123 [2023-11-06 22:11:26,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:11:26,755 INFO L413 NwaCegarLoop]: 995 mSDtfsCounter, 2735 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 891 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2875 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 3196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 891 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:26,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2875 Valid, 3008 Invalid, 3196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [891 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-06 22:11:26,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2023-11-06 22:11:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1024. [2023-11-06 22:11:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 759 states have (on average 1.4057971014492754) internal successors, (1067), 782 states have internal predecessors, (1067), 215 states have call successors, (215), 49 states have call predecessors, (215), 49 states have return successors, (215), 213 states have call predecessors, (215), 215 states have call successors, (215) [2023-11-06 22:11:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1497 transitions. [2023-11-06 22:11:26,896 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1497 transitions. Word has length 129 [2023-11-06 22:11:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:26,897 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1497 transitions. [2023-11-06 22:11:26,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.09090909090909) internal successors, (177), 10 states have internal predecessors, (177), 4 states have call successors, (38), 4 states have call predecessors, (38), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2023-11-06 22:11:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1497 transitions. [2023-11-06 22:11:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 22:11:26,905 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:26,905 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:26,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:11:27,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:11:27,114 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:27,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:27,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1700163708, now seen corresponding path program 1 times [2023-11-06 22:11:27,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:27,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960061478] [2023-11-06 22:11:27,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:27,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:27,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:27,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:11:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:11:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:11:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:11:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:11:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:11:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:11:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:11:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:11:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:11:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:11:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:11:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:11:28,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:28,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960061478] [2023-11-06 22:11:28,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960061478] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:11:28,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637528932] [2023-11-06 22:11:28,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:28,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:11:28,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:11:28,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:11:28,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:11:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:28,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:11:28,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:11:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:11:28,882 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:11:28,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637528932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:28,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:11:28,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-06 22:11:28,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509168665] [2023-11-06 22:11:28,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:28,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:11:28,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:28,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:11:28,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:11:28,885 INFO L87 Difference]: Start difference. First operand 1024 states and 1497 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:11:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:29,035 INFO L93 Difference]: Finished difference Result 2022 states and 2964 transitions. [2023-11-06 22:11:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:11:29,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2023-11-06 22:11:29,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:29,044 INFO L225 Difference]: With dead ends: 2022 [2023-11-06 22:11:29,044 INFO L226 Difference]: Without dead ends: 1024 [2023-11-06 22:11:29,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:11:29,049 INFO L413 NwaCegarLoop]: 1452 mSDtfsCounter, 3 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2900 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:29,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2900 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:11:29,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2023-11-06 22:11:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2023-11-06 22:11:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 759 states have (on average 1.4044795783926218) internal successors, (1066), 782 states have internal predecessors, (1066), 215 states have call successors, (215), 49 states have call predecessors, (215), 49 states have return successors, (215), 213 states have call predecessors, (215), 215 states have call successors, (215) [2023-11-06 22:11:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1496 transitions. [2023-11-06 22:11:29,208 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1496 transitions. Word has length 138 [2023-11-06 22:11:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:29,208 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1496 transitions. [2023-11-06 22:11:29,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:11:29,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1496 transitions. [2023-11-06 22:11:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 22:11:29,214 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:29,215 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:29,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:11:29,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 22:11:29,423 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:29,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:29,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1012879702, now seen corresponding path program 1 times [2023-11-06 22:11:29,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:29,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939342385] [2023-11-06 22:11:29,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:29,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:11:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:11:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:11:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:11:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:11:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:11:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:11:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:11:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 22:11:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:11:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 22:11:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:11:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:30,539 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:11:30,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:30,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939342385] [2023-11-06 22:11:30,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939342385] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:11:30,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517145764] [2023-11-06 22:11:30,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:30,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:11:30,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:11:30,542 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:11:30,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:11:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:31,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:11:31,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:11:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:11:31,135 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:11:31,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517145764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:31,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:11:31,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2023-11-06 22:11:31,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723040338] [2023-11-06 22:11:31,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:31,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:11:31,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:31,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:11:31,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:11:31,138 INFO L87 Difference]: Start difference. First operand 1024 states and 1496 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:11:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:31,432 INFO L93 Difference]: Finished difference Result 2425 states and 3617 transitions. [2023-11-06 22:11:31,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:11:31,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2023-11-06 22:11:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:31,443 INFO L225 Difference]: With dead ends: 2425 [2023-11-06 22:11:31,443 INFO L226 Difference]: Without dead ends: 1452 [2023-11-06 22:11:31,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:11:31,448 INFO L413 NwaCegarLoop]: 2126 mSDtfsCounter, 449 mSDsluCounter, 3671 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 5797 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:31,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 5797 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:11:31,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2023-11-06 22:11:31,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1026. [2023-11-06 22:11:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 761 states have (on average 1.4034165571616295) internal successors, (1068), 784 states have internal predecessors, (1068), 215 states have call successors, (215), 49 states have call predecessors, (215), 49 states have return successors, (215), 213 states have call predecessors, (215), 215 states have call successors, (215) [2023-11-06 22:11:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1498 transitions. [2023-11-06 22:11:31,605 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1498 transitions. Word has length 139 [2023-11-06 22:11:31,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:31,606 INFO L495 AbstractCegarLoop]: Abstraction has 1026 states and 1498 transitions. [2023-11-06 22:11:31,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:11:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1498 transitions. [2023-11-06 22:11:31,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-06 22:11:31,613 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:31,613 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-06 22:11:31,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:11:31,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:11:31,821 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:31,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:31,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2033555127, now seen corresponding path program 1 times [2023-11-06 22:11:31,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:31,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676027145] [2023-11-06 22:11:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:31,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:31,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:11:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:11:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:11:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:11:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:11:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:11:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:11:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:11:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 22:11:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:11:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-06 22:11:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:11:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-06 22:11:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:11:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:32,078 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:11:32,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:32,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676027145] [2023-11-06 22:11:32,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676027145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:32,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:32,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:11:32,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101194389] [2023-11-06 22:11:32,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:32,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:11:32,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:32,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:11:32,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:11:32,084 INFO L87 Difference]: Start difference. First operand 1026 states and 1498 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:11:34,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:34,280 INFO L93 Difference]: Finished difference Result 2033 states and 2985 transitions. [2023-11-06 22:11:34,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:11:34,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 148 [2023-11-06 22:11:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:34,289 INFO L225 Difference]: With dead ends: 2033 [2023-11-06 22:11:34,289 INFO L226 Difference]: Without dead ends: 1058 [2023-11-06 22:11:34,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:11:34,294 INFO L413 NwaCegarLoop]: 1007 mSDtfsCounter, 449 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:34,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 2475 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 22:11:34,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2023-11-06 22:11:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1028. [2023-11-06 22:11:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 763 states have (on average 1.4023591087811271) internal successors, (1070), 786 states have internal predecessors, (1070), 215 states have call successors, (215), 49 states have call predecessors, (215), 49 states have return successors, (215), 213 states have call predecessors, (215), 215 states have call successors, (215) [2023-11-06 22:11:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1500 transitions. [2023-11-06 22:11:34,441 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1500 transitions. Word has length 148 [2023-11-06 22:11:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:34,442 INFO L495 AbstractCegarLoop]: Abstraction has 1028 states and 1500 transitions. [2023-11-06 22:11:34,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:11:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1500 transitions. [2023-11-06 22:11:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-06 22:11:34,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:34,448 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:34,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:11:34,449 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:34,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:34,449 INFO L85 PathProgramCache]: Analyzing trace with hash -362379677, now seen corresponding path program 1 times [2023-11-06 22:11:34,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:34,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419638042] [2023-11-06 22:11:34,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:34,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:11:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:11:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:11:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:11:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:11:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:11:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:11:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:11:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-06 22:11:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:11:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 22:11:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:11:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-06 22:11:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:11:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-06 22:11:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:11:35,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:35,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419638042] [2023-11-06 22:11:35,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419638042] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:11:35,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311721435] [2023-11-06 22:11:35,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:35,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:11:35,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:11:35,629 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:11:35,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:11:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:36,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 1248 conjuncts, 182 conjunts are in the unsatisfiable core [2023-11-06 22:11:36,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:11:37,255 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-06 22:11:37,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-06 22:11:37,546 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-06 22:11:37,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 18 [2023-11-06 22:11:37,760 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:11:37,792 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2023-11-06 22:11:37,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2023-11-06 22:11:37,992 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-11-06 22:11:38,030 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 18 [2023-11-06 22:11:38,060 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 11 [2023-11-06 22:11:38,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:11:38,400 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2023-11-06 22:11:38,415 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 25 [2023-11-06 22:11:38,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:11:38,425 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2023-11-06 22:11:38,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2023-11-06 22:11:38,757 INFO L351 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 46 [2023-11-06 22:11:38,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:11:38,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 21 [2023-11-06 22:11:38,779 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 56 [2023-11-06 22:11:38,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:11:38,793 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 26 [2023-11-06 22:11:38,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:11:38,822 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 56 treesize of output 33 [2023-11-06 22:11:38,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2023-11-06 22:11:39,128 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2023-11-06 22:11:39,143 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2023-11-06 22:11:39,166 INFO L351 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 0 case distinctions, treesize of input 37 treesize of output 31 [2023-11-06 22:11:39,517 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2023-11-06 22:11:39,557 INFO L322 Elim1Store]: treesize reduction 77, result has 10.5 percent of original size [2023-11-06 22:11:39,557 INFO L351 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 57 [2023-11-06 22:11:39,581 INFO L351 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 0 case distinctions, treesize of input 37 treesize of output 31 [2023-11-06 22:11:40,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:11:40,440 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:11:40,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:11:40,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:11:40,444 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:11:40,445 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 38 [2023-11-06 22:11:40,459 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 22:11:40,464 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:11:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:11:40,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:11:40,655 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (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_846) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_847) |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_845) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (< .cse0 1) (< 2147483647 .cse0)))) is different from false [2023-11-06 22:11:40,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311721435] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:11:40,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:11:40,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 31] total 34 [2023-11-06 22:11:40,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108431084] [2023-11-06 22:11:40,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:11:40,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-06 22:11:40,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:40,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-06 22:11:40,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1001, Unknown=1, NotChecked=64, Total=1190 [2023-11-06 22:11:40,690 INFO L87 Difference]: Start difference. First operand 1028 states and 1500 transitions. Second operand has 34 states, 33 states have (on average 6.333333333333333) internal successors, (209), 27 states have internal predecessors, (209), 10 states have call successors, (36), 7 states have call predecessors, (36), 9 states have return successors, (34), 13 states have call predecessors, (34), 10 states have call successors, (34) [2023-11-06 22:11:48,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:11:50,046 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-06 22:11:55,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:11:56,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:11:59,345 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-06 22:12:06,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:06,251 INFO L93 Difference]: Finished difference Result 2445 states and 3644 transitions. [2023-11-06 22:12:06,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:12:06,252 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 6.333333333333333) internal successors, (209), 27 states have internal predecessors, (209), 10 states have call successors, (36), 7 states have call predecessors, (36), 9 states have return successors, (34), 13 states have call predecessors, (34), 10 states have call successors, (34) Word has length 156 [2023-11-06 22:12:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:06,264 INFO L225 Difference]: With dead ends: 2445 [2023-11-06 22:12:06,264 INFO L226 Difference]: Without dead ends: 1453 [2023-11-06 22:12:06,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=264, Invalid=2391, Unknown=1, NotChecked=100, Total=2756 [2023-11-06 22:12:06,270 INFO L413 NwaCegarLoop]: 1355 mSDtfsCounter, 2547 mSDsluCounter, 24233 mSDsCounter, 0 mSdLazyCounter, 15919 mSolverCounterSat, 974 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2550 SdHoareTripleChecker+Valid, 25588 SdHoareTripleChecker+Invalid, 16895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 15919 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:06,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2550 Valid, 25588 Invalid, 16895 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [974 Valid, 15919 Invalid, 2 Unknown, 0 Unchecked, 24.4s Time] [2023-11-06 22:12:06,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2023-11-06 22:12:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1030. [2023-11-06 22:12:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 764 states have (on average 1.4018324607329844) internal successors, (1071), 788 states have internal predecessors, (1071), 215 states have call successors, (215), 49 states have call predecessors, (215), 50 states have return successors, (216), 213 states have call predecessors, (216), 215 states have call successors, (216) [2023-11-06 22:12:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1502 transitions. [2023-11-06 22:12:06,486 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1502 transitions. Word has length 156 [2023-11-06 22:12:06,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:06,486 INFO L495 AbstractCegarLoop]: Abstraction has 1030 states and 1502 transitions. [2023-11-06 22:12:06,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 6.333333333333333) internal successors, (209), 27 states have internal predecessors, (209), 10 states have call successors, (36), 7 states have call predecessors, (36), 9 states have return successors, (34), 13 states have call predecessors, (34), 10 states have call successors, (34) [2023-11-06 22:12:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1502 transitions. [2023-11-06 22:12:06,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-06 22:12:06,493 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:06,493 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:12:06,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:06,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 22:12:06,703 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:06,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:06,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1854226875, now seen corresponding path program 1 times [2023-11-06 22:12:06,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:06,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179002878] [2023-11-06 22:12:06,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:06,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:12:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:12:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:12:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:12:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:12:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:12:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:12:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:12:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:12:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:12:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-06 22:12:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:12:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-06 22:12:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:12:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:12:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:12:07,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:07,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179002878] [2023-11-06 22:12:07,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179002878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:07,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:07,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:12:07,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71232415] [2023-11-06 22:12:07,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:07,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:12:07,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:07,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:12:07,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:12:07,460 INFO L87 Difference]: Start difference. First operand 1030 states and 1502 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:12:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:11,549 INFO L93 Difference]: Finished difference Result 2594 states and 3878 transitions. [2023-11-06 22:12:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:12:11,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 159 [2023-11-06 22:12:11,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:11,565 INFO L225 Difference]: With dead ends: 2594 [2023-11-06 22:12:11,565 INFO L226 Difference]: Without dead ends: 1617 [2023-11-06 22:12:11,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:12:11,571 INFO L413 NwaCegarLoop]: 1861 mSDtfsCounter, 1022 mSDsluCounter, 6975 mSDsCounter, 0 mSdLazyCounter, 3556 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 8836 SdHoareTripleChecker+Invalid, 3720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:11,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 8836 Invalid, 3720 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [164 Valid, 3556 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-06 22:12:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2023-11-06 22:12:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1035. [2023-11-06 22:12:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 768 states have (on average 1.3997395833333333) internal successors, (1075), 792 states have internal predecessors, (1075), 215 states have call successors, (215), 49 states have call predecessors, (215), 51 states have return successors, (220), 214 states have call predecessors, (220), 215 states have call successors, (220) [2023-11-06 22:12:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1510 transitions. [2023-11-06 22:12:11,742 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1510 transitions. Word has length 159 [2023-11-06 22:12:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:11,743 INFO L495 AbstractCegarLoop]: Abstraction has 1035 states and 1510 transitions. [2023-11-06 22:12:11,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:12:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1510 transitions. [2023-11-06 22:12:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-06 22:12:11,750 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:11,750 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:11,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:12:11,751 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:11,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:11,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2121437435, now seen corresponding path program 2 times [2023-11-06 22:12:11,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:11,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825988704] [2023-11-06 22:12:11,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:11,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:12:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:12:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:12:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:12:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:12:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:12:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:12:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:12:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:12:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:12:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:12:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:12:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 22:12:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:12:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-06 22:12:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-06 22:12:12,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:12,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825988704] [2023-11-06 22:12:12,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825988704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:12,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:12,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:12:12,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469129156] [2023-11-06 22:12:12,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:12,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:12:12,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:12,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:12:12,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:12:12,593 INFO L87 Difference]: Start difference. First operand 1035 states and 1510 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:12:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:15,459 INFO L93 Difference]: Finished difference Result 2043 states and 3005 transitions. [2023-11-06 22:12:15,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:12:15,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 162 [2023-11-06 22:12:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:15,472 INFO L225 Difference]: With dead ends: 2043 [2023-11-06 22:12:15,472 INFO L226 Difference]: Without dead ends: 1061 [2023-11-06 22:12:15,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:12:15,477 INFO L413 NwaCegarLoop]: 1006 mSDtfsCounter, 455 mSDsluCounter, 2362 mSDsCounter, 0 mSdLazyCounter, 1827 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 3368 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:15,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 3368 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1827 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-06 22:12:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2023-11-06 22:12:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1040. [2023-11-06 22:12:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 772 states have (on average 1.3989637305699483) internal successors, (1080), 796 states have internal predecessors, (1080), 215 states have call successors, (215), 50 states have call predecessors, (215), 52 states have return successors, (220), 214 states have call predecessors, (220), 215 states have call successors, (220) [2023-11-06 22:12:15,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1515 transitions. [2023-11-06 22:12:15,642 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1515 transitions. Word has length 162 [2023-11-06 22:12:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:15,645 INFO L495 AbstractCegarLoop]: Abstraction has 1040 states and 1515 transitions. [2023-11-06 22:12:15,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:12:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1515 transitions. [2023-11-06 22:12:15,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-06 22:12:15,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:15,652 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:15,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:12:15,652 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:15,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:15,653 INFO L85 PathProgramCache]: Analyzing trace with hash -533089533, now seen corresponding path program 1 times [2023-11-06 22:12:15,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:15,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381489277] [2023-11-06 22:12:15,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:15,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:25,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:25,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:25,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:12:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:25,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:12:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:25,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:12:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:25,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:12:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:25,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:12:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:25,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:25,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:12:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:25,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:12:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:25,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:12:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:12:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:26,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:12:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:26,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:12:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:26,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:12:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:26,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 22:12:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:26,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:12:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:26,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-06 22:12:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:12:26,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:26,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381489277] [2023-11-06 22:12:26,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381489277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:26,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:26,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2023-11-06 22:12:26,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271793755] [2023-11-06 22:12:26,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:26,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-06 22:12:26,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:26,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-06 22:12:26,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=852, Unknown=0, NotChecked=0, Total=930 [2023-11-06 22:12:26,221 INFO L87 Difference]: Start difference. First operand 1040 states and 1515 transitions. Second operand has 31 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 25 states have internal predecessors, (115), 10 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2023-11-06 22:12:35,491 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-06 22:12:37,498 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-06 22:12:40,019 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-06 22:12:46,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:12:48,254 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-06 22:12:50,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:12:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:58,079 INFO L93 Difference]: Finished difference Result 1546 states and 2320 transitions. [2023-11-06 22:12:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-06 22:12:58,080 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 25 states have internal predecessors, (115), 10 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) Word has length 162 [2023-11-06 22:12:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:58,092 INFO L225 Difference]: With dead ends: 1546 [2023-11-06 22:12:58,092 INFO L226 Difference]: Without dead ends: 1544 [2023-11-06 22:12:58,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=314, Invalid=2656, Unknown=0, NotChecked=0, Total=2970 [2023-11-06 22:12:58,095 INFO L413 NwaCegarLoop]: 1568 mSDtfsCounter, 2483 mSDsluCounter, 23137 mSDsCounter, 0 mSdLazyCounter, 20081 mSolverCounterSat, 813 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2537 SdHoareTripleChecker+Valid, 24705 SdHoareTripleChecker+Invalid, 20898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 20081 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:58,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2537 Valid, 24705 Invalid, 20898 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [813 Valid, 20081 Invalid, 4 Unknown, 0 Unchecked, 30.1s Time] [2023-11-06 22:12:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2023-11-06 22:12:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1107. [2023-11-06 22:12:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 818 states have (on average 1.3936430317848412) internal successors, (1140), 843 states have internal predecessors, (1140), 236 states have call successors, (236), 50 states have call predecessors, (236), 52 states have return successors, (243), 235 states have call predecessors, (243), 236 states have call successors, (243) [2023-11-06 22:12:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1619 transitions. [2023-11-06 22:12:58,369 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1619 transitions. Word has length 162 [2023-11-06 22:12:58,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:58,369 INFO L495 AbstractCegarLoop]: Abstraction has 1107 states and 1619 transitions. [2023-11-06 22:12:58,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 25 states have internal predecessors, (115), 10 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2023-11-06 22:12:58,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1619 transitions. [2023-11-06 22:12:58,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-06 22:12:58,378 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:58,379 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:58,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:12:58,379 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:58,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:58,380 INFO L85 PathProgramCache]: Analyzing trace with hash -782762074, now seen corresponding path program 1 times [2023-11-06 22:12:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:58,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357513286] [2023-11-06 22:12:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:58,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:13:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:13:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:13:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:13:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:13:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:13:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:13:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:13:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:13:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:13:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:13:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:13:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:13:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 22:13:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:13:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 22:13:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-06 22:13:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:13:08,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:08,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357513286] [2023-11-06 22:13:08,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357513286] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:08,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503335909] [2023-11-06 22:13:08,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:08,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:08,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:08,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:13:08,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10c225f0-3a7a-4b42-ba2a-851805bd3da7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:13:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 171 conjunts are in the unsatisfiable core [2023-11-06 22:13:09,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:09,532 INFO L351 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-06 22:13:10,236 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:13:10,237 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-06 22:13:10,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,261 INFO L351 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 19 treesize of output 9 [2023-11-06 22:13:10,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,271 INFO L351 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-06 22:13:10,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,284 INFO L351 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 19 treesize of output 9 [2023-11-06 22:13:10,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,307 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-06 22:13:10,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,323 INFO L351 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 19 treesize of output 9 [2023-11-06 22:13:10,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,350 INFO L351 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 19 treesize of output 9 [2023-11-06 22:13:10,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,360 INFO L351 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-06 22:13:10,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,385 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-06 22:13:10,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,402 INFO L351 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 19 treesize of output 9 [2023-11-06 22:13:10,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,413 INFO L351 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-06 22:13:10,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,426 INFO L351 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 19 treesize of output 9 [2023-11-06 22:13:10,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,447 INFO L351 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 19 treesize of output 9 [2023-11-06 22:13:10,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,455 INFO L351 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-06 22:13:10,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,469 INFO L351 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 19 treesize of output 9 [2023-11-06 22:13:10,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,478 INFO L351 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-06 22:13:10,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,494 INFO L351 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 19 treesize of output 9 [2023-11-06 22:13:10,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,516 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-06 22:13:10,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,585 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-06 22:13:10,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,599 INFO L351 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 19 treesize of output 9 [2023-11-06 22:13:10,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,625 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-06 22:13:10,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,656 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 9 [2023-11-06 22:13:10,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,686 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-06 22:13:10,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:10,699 INFO L351 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 19 treesize of output 9 [2023-11-06 22:13:10,928 INFO L351 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-06 22:13:10,999 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:13:10,999 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 22:13:11,233 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-06 22:13:11,679 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-06 22:13:11,692 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:13:11,693 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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-06 22:13:11,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-06 22:13:11,920 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:13:11,939 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:13:11,940 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 31 [2023-11-06 22:13:11,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:13:12,400 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:13:12,400 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 40 [2023-11-06 22:13:12,430 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-11-06 22:13:12,446 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-11-06 22:13:13,167 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2023-11-06 22:13:13,184 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2023-11-06 22:13:13,221 INFO L322 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-11-06 22:13:13,222 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 57 [2023-11-06 22:13:13,236 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 22:13:13,246 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:13:13,270 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2023-11-06 22:13:13,354 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2023-11-06 22:13:13,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2023-11-06 22:13:13,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:13,734 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 16 [2023-11-06 22:13:13,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:13,746 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 60 treesize of output 37 [2023-11-06 22:13:13,750 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2023-11-06 22:13:13,770 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-06 22:13:13,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:13,778 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-06 22:13:14,236 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2023-11-06 22:13:14,251 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:13:14,267 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2023-11-06 22:13:14,916 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:13:14,951 INFO L322 Elim1Store]: treesize reduction 77, result has 10.5 percent of original size [2023-11-06 22:13:14,951 INFO L351 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 61 [2023-11-06 22:13:14,977 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2023-11-06 22:13:15,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:13:15,726 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2023-11-06 22:13:15,747 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2023-11-06 22:13:16,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:16,777 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 96 treesize of output 72 [2023-11-06 22:13:16,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:16,794 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:16,795 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 42 [2023-11-06 22:13:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:13:16,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:13:16,956 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1450 (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_1450) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1448) |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_1449) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (< .cse0 1) (< 2147483647 .cse0)))) is different from false [2023-11-06 22:13:16,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503335909] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:16,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:13:16,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 60 [2023-11-06 22:13:16,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030268024] [2023-11-06 22:13:16,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:13:16,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-11-06 22:13:16,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:16,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-11-06 22:13:16,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3351, Unknown=1, NotChecked=116, Total=3660 [2023-11-06 22:13:16,979 INFO L87 Difference]: Start difference. First operand 1107 states and 1619 transitions. Second operand has 60 states, 57 states have (on average 3.7719298245614037) internal successors, (215), 49 states have internal predecessors, (215), 18 states have call successors, (34), 8 states have call predecessors, (34), 12 states have return successors, (32), 22 states have call predecessors, (32), 18 states have call successors, (32) [2023-11-06 22:13:55,993 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]