./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1264b42ba0b5dcb83ee2e2b35dfcd5adbd8a3fb1fa3fff4328b672883ffa55c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:55:58,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:55:58,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:55:58,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:55:58,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:55:58,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:55:58,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:55:58,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:55:58,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:55:58,353 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:55:58,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:55:58,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:55:58,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:55:58,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:55:58,354 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:55:58,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:55:58,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:55:58,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:55:58,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:55:58,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:55:58,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:55:58,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:55:58,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:55:58,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:55:58,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:55:58,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:55:58,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:55:58,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:55:58,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:55:58,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:55:58,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:55:58,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:55:58,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:55:58,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:55:58,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:55:58,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:55:58,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:55:58,356 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:55:58,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:55:58,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:55:58,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:55:58,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:55:58,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:55:58,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:55:58,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:55:58,356 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1264b42ba0b5dcb83ee2e2b35dfcd5adbd8a3fb1fa3fff4328b672883ffa55c1 [2025-01-09 18:55:58,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:55:58,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:55:58,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:55:58,596 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:55:58,596 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:55:58,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i [2025-01-09 18:55:59,821 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d51c96ad9/26f742fdcc48495cb05c9c96a3a67020/FLAG20806890a [2025-01-09 18:56:00,385 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:56:00,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i [2025-01-09 18:56:00,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d51c96ad9/26f742fdcc48495cb05c9c96a3a67020/FLAG20806890a [2025-01-09 18:56:00,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d51c96ad9/26f742fdcc48495cb05c9c96a3a67020 [2025-01-09 18:56:00,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:56:00,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:56:00,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:56:00,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:56:00,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:56:00,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:56:00" (1/1) ... [2025-01-09 18:56:00,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ebe9ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:00, skipping insertion in model container [2025-01-09 18:56:00,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:56:00" (1/1) ... [2025-01-09 18:56:00,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:56:02,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i[237227,237240] [2025-01-09 18:56:02,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:56:02,473 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:56:02,531 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [3942] [2025-01-09 18:56:02,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [3949] [2025-01-09 18:56:02,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [3956] [2025-01-09 18:56:02,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3964-3965] [2025-01-09 18:56:02,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [3974] [2025-01-09 18:56:02,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (831), "i" (12UL)); [4041-4042] [2025-01-09 18:56:02,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (43UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [4047-4049] [2025-01-09 18:56:02,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (836), "i" (12UL)); [4071-4072] [2025-01-09 18:56:02,539 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.restore_fl.func), [paravirt_clobber] "i" (1), "D" (f): "memory", "cc"); [4077-4079] [2025-01-09 18:56:02,540 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (841), "i" (12UL)); [4100-4101] [2025-01-09 18:56:02,540 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (45UL), [paravirt_opptr] "i" (& pv_irq_ops.irq_disable.func), [paravirt_clobber] "i" (1): "memory", "cc"); [4106-4108] [2025-01-09 18:56:02,550 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (90), "i" (12UL)); [4417-4418] [2025-01-09 18:56:02,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (92), "i" (12UL)); [4425-4426] [2025-01-09 18:56:02,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (93), "i" (12UL)); [4433-4434] [2025-01-09 18:56:02,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (123), "i" (12UL)); [4460-4461] [2025-01-09 18:56:02,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (124), "i" (12UL)); [4468-4469] [2025-01-09 18:56:02,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (193), "i" (12UL)); [4483-4484] [2025-01-09 18:56:02,576 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers/--X--defaultlinux-4.2-rc1.tar.xz--X--32_7a--X--cpachecker/linux-4.2-rc1.tar.xz/csd_deg_dscv/8278/dscv_tempdir/dscv/ri/32_7a/drivers/memstick/core/ms_block.c"), "i" (464), "i" (12UL)); [5073-5074] [2025-01-09 18:56:02,669 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers/--X--defaultlinux-4.2-rc1.tar.xz--X--32_7a--X--cpachecker/linux-4.2-rc1.tar.xz/csd_deg_dscv/8278/dscv_tempdir/dscv/ri/32_7a/drivers/memstick/core/ms_block.c"), "i" (577), "i" (12UL)); [5187-5188] [2025-01-09 18:56:02,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers/--X--defaultlinux-4.2-rc1.tar.xz--X--32_7a--X--cpachecker/linux-4.2-rc1.tar.xz/csd_deg_dscv/8278/dscv_tempdir/dscv/ri/32_7a/drivers/memstick/core/ms_block.c"), "i" (653), "i" (12UL)); [5278-5279] [2025-01-09 18:56:02,676 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers/--X--defaultlinux-4.2-rc1.tar.xz--X--32_7a--X--cpachecker/linux-4.2-rc1.tar.xz/csd_deg_dscv/8278/dscv_tempdir/dscv/ri/32_7a/drivers/memstick/core/ms_block.c"), "i" (676), "i" (12UL)); [5315-5316] [2025-01-09 18:56:02,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers/--X--defaultlinux-4.2-rc1.tar.xz--X--32_7a--X--cpachecker/linux-4.2-rc1.tar.xz/csd_deg_dscv/8278/dscv_tempdir/dscv/ri/32_7a/drivers/memstick/core/ms_block.c"), "i" (719), "i" (12UL)); [5367-5368] [2025-01-09 18:56:02,690 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers/--X--defaultlinux-4.2-rc1.tar.xz--X--32_7a--X--cpachecker/linux-4.2-rc1.tar.xz/csd_deg_dscv/8278/dscv_tempdir/dscv/ri/32_7a/drivers/memstick/core/ms_block.c"), "i" (953), "i" (12UL)); [5680-5681] [2025-01-09 18:56:02,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers/--X--defaultlinux-4.2-rc1.tar.xz--X--32_7a--X--cpachecker/linux-4.2-rc1.tar.xz/csd_deg_dscv/8278/dscv_tempdir/dscv/ri/32_7a/drivers/memstick/core/ms_block.c"), "i" (1004), "i" (12UL)); [5753-5754] [2025-01-09 18:56:02,704 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers/--X--defaultlinux-4.2-rc1.tar.xz--X--32_7a--X--cpachecker/linux-4.2-rc1.tar.xz/csd_deg_dscv/8278/dscv_tempdir/dscv/ri/32_7a/drivers/memstick/core/ms_block.c"), "i" (1262), "i" (12UL)); [6134-6135] [2025-01-09 18:56:02,754 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i[237227,237240] [2025-01-09 18:56:02,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:56:02,830 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:56:02,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02 WrapperNode [2025-01-09 18:56:02,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:56:02,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:56:02,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:56:02,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:56:02,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02" (1/1) ... [2025-01-09 18:56:02,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02" (1/1) ... [2025-01-09 18:56:02,963 INFO L138 Inliner]: procedures = 308, calls = 1840, calls flagged for inlining = 110, calls inlined = 101, statements flattened = 4110 [2025-01-09 18:56:02,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:56:02,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:56:02,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:56:02,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:56:02,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02" (1/1) ... [2025-01-09 18:56:02,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02" (1/1) ... [2025-01-09 18:56:03,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02" (1/1) ... [2025-01-09 18:56:03,373 INFO L175 MemorySlicer]: Split 675 memory accesses to 15 slices as follows [2, 23, 16, 0, 1, 8, 4, 7, 3, 4, 555, 6, 10, 34, 2]. 82 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. The 289 writes are split as follows [0, 23, 0, 0, 1, 0, 1, 4, 0, 1, 220, 4, 5, 29, 1]. [2025-01-09 18:56:03,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02" (1/1) ... [2025-01-09 18:56:03,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02" (1/1) ... [2025-01-09 18:56:03,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02" (1/1) ... [2025-01-09 18:56:03,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02" (1/1) ... [2025-01-09 18:56:03,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02" (1/1) ... [2025-01-09 18:56:03,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02" (1/1) ... [2025-01-09 18:56:03,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02" (1/1) ... [2025-01-09 18:56:03,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:56:03,577 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:56:03,577 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:56:03,577 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:56:03,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02" (1/1) ... [2025-01-09 18:56:03,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:56:03,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:56:03,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 18:56:03,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 18:56:03,640 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-01-09 18:56:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-01-09 18:56:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock_of_memstick_host [2025-01-09 18:56:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock_of_memstick_host [2025-01-09 18:56:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2025-01-09 18:56:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2025-01-09 18:56:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:56:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:56:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:56:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:56:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:56:03,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 18:56:03,643 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure msb_stop [2025-01-09 18:56:03,643 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_stop [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure msb_get_zone_from_pba [2025-01-09 18:56:03,643 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_get_zone_from_pba [2025-01-09 18:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2025-01-09 18:56:03,643 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:56:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure blk_fetch_request [2025-01-09 18:56:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_fetch_request [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2025-01-09 18:56:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_restore [2025-01-09 18:56:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_restore [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-01-09 18:56:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:56:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure msb_switch_to_parallel [2025-01-09 18:56:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_switch_to_parallel [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-01-09 18:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-01-09 18:56:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 18:56:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 18:56:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 18:56:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-09 18:56:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-01-09 18:56:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:56:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure msb_validate_used_block_bitmap [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_validate_used_block_bitmap [2025-01-09 18:56:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-01-09 18:56:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure msb_verify_block [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_verify_block [2025-01-09 18:56:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-01-09 18:56:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_2 [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_2 [2025-01-09 18:56:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_msb_disk_lock [2025-01-09 18:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_msb_disk_lock [2025-01-09 18:56:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:56:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure msb_cache_write [2025-01-09 18:56:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_cache_write [2025-01-09 18:56:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure trace_hardirqs_off [2025-01-09 18:56:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_hardirqs_off [2025-01-09 18:56:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure memstick_set_drvdata [2025-01-09 18:56:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure memstick_set_drvdata [2025-01-09 18:56:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure __blk_end_request [2025-01-09 18:56:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure __blk_end_request [2025-01-09 18:56:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:56:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:56:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:56:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 18:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 18:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 18:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 18:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2025-01-09 18:56:03,648 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2025-01-09 18:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure msb_invalidate_reg_window [2025-01-09 18:56:03,648 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_invalidate_reg_window [2025-01-09 18:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure msb_io_work [2025-01-09 18:56:03,649 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_io_work [2025-01-09 18:56:03,649 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-01-09 18:56:03,649 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-01-09 18:56:03,649 INFO L130 BoogieDeclarations]: Found specification of procedure sg_init_table [2025-01-09 18:56:03,649 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_init_table [2025-01-09 18:56:03,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:56:03,649 INFO L130 BoogieDeclarations]: Found specification of procedure msb_erase_block [2025-01-09 18:56:03,649 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_erase_block [2025-01-09 18:56:03,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 18:56:03,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 18:56:03,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 18:56:03,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 18:56:03,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 18:56:03,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 18:56:03,650 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure memstick_get_drvdata [2025-01-09 18:56:03,650 INFO L138 BoogieDeclarations]: Found implementation of procedure memstick_get_drvdata [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure msb_data_clear [2025-01-09 18:56:03,650 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_data_clear [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-01-09 18:56:03,650 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2025-01-09 18:56:03,650 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 18:56:03,650 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-01-09 18:56:03,650 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-01-09 18:56:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-01-09 18:56:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure msb_read_bad_block_table [2025-01-09 18:56:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_read_bad_block_table [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure msb_update_block [2025-01-09 18:56:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_update_block [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure msb_cache_flush [2025-01-09 18:56:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_cache_flush [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_next [2025-01-09 18:56:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_next [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2025-01-09 18:56:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_start [2025-01-09 18:56:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_start [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure msb_run_state_machine [2025-01-09 18:56:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_run_state_machine [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure msb_sg_copy [2025-01-09 18:56:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_sg_copy [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure sg_page [2025-01-09 18:56:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_page [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-01-09 18:56:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure find_next_zero_bit [2025-01-09 18:56:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure find_next_zero_bit [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 18:56:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock_of_memstick_host [2025-01-09 18:56:03,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock_of_memstick_host [2025-01-09 18:56:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:56:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:56:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:56:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:56:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:56:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:56:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:56:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2025-01-09 18:56:03,653 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure msb_get_zone_from_lba [2025-01-09 18:56:03,653 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_get_zone_from_lba [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure msb_reset [2025-01-09 18:56:03,653 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_reset [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_2 [2025-01-09 18:56:03,653 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_2 [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure blk_start_queue [2025-01-09 18:56:03,653 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_start_queue [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 18:56:03,653 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2025-01-09 18:56:03,653 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure msb_bd_getgeo [2025-01-09 18:56:03,653 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_bd_getgeo [2025-01-09 18:56:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure msb_remove [2025-01-09 18:56:03,654 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_remove [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:56:03,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure sg_next [2025-01-09 18:56:03,654 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_next [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure msb_mark_bad [2025-01-09 18:56:03,654 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_mark_bad [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-01-09 18:56:03,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_2 [2025-01-09 18:56:03,654 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_2 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-01-09 18:56:03,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure sg_nents [2025-01-09 18:56:03,654 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_nents [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:56:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 18:56:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 18:56:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 18:56:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 18:56:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure msb_read_page [2025-01-09 18:56:03,655 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_read_page [2025-01-09 18:56:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure __set_bit [2025-01-09 18:56:03,655 INFO L138 BoogieDeclarations]: Found implementation of procedure __set_bit [2025-01-09 18:56:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_stop [2025-01-09 18:56:03,655 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_stop [2025-01-09 18:56:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure msb_set_overwrite_flag [2025-01-09 18:56:03,655 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_set_overwrite_flag [2025-01-09 18:56:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure blk_rq_bytes [2025-01-09 18:56:03,655 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_rq_bytes [2025-01-09 18:56:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2025-01-09 18:56:03,655 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2025-01-09 18:56:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure msb_disk_release [2025-01-09 18:56:03,655 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_disk_release [2025-01-09 18:56:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure msb_mark_block_used [2025-01-09 18:56:03,656 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_mark_block_used [2025-01-09 18:56:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure msb_cache_discard [2025-01-09 18:56:03,656 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_cache_discard [2025-01-09 18:56:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-01-09 18:56:03,656 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-01-09 18:56:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure msb_start [2025-01-09 18:56:03,656 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_start [2025-01-09 18:56:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2025-01-09 18:56:03,656 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2025-01-09 18:56:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2025-01-09 18:56:03,657 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2025-01-09 18:56:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure idr_remove [2025-01-09 18:56:03,657 INFO L138 BoogieDeclarations]: Found implementation of procedure idr_remove [2025-01-09 18:56:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure msb_init_card [2025-01-09 18:56:03,657 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_init_card [2025-01-09 18:56:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_page [2025-01-09 18:56:03,657 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_page [2025-01-09 18:56:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-01-09 18:56:03,657 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-01-09 18:56:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:56:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure sg_init_one [2025-01-09 18:56:03,658 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_init_one [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2025-01-09 18:56:03,658 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_msb_disk_lock [2025-01-09 18:56:03,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_msb_disk_lock [2025-01-09 18:56:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:56:03,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:56:04,211 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:56:04,214 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:56:04,247 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:56:11,175 INFO L? ?]: Removed 1492 outVars from TransFormulas that were not future-live. [2025-01-09 18:56:11,175 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:56:11,213 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:56:11,213 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 18:56:11,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:56:11 BoogieIcfgContainer [2025-01-09 18:56:11,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:56:11,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:56:11,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:56:11,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:56:11,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:56:00" (1/3) ... [2025-01-09 18:56:11,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdbe42e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:56:11, skipping insertion in model container [2025-01-09 18:56:11,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:56:02" (2/3) ... [2025-01-09 18:56:11,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdbe42e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:56:11, skipping insertion in model container [2025-01-09 18:56:11,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:56:11" (3/3) ... [2025-01-09 18:56:11,220 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i [2025-01-09 18:56:11,229 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:56:11,233 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i that has 104 procedures, 1780 locations, 1 initial locations, 16 loop locations, and 1 error locations. [2025-01-09 18:56:11,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:56:11,289 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2db3419, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:56:11,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:56:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 1739 states, 1205 states have (on average 1.35850622406639) internal successors, (1637), 1250 states have internal predecessors, (1637), 440 states have call successors, (440), 93 states have call predecessors, (440), 92 states have return successors, (434), 428 states have call predecessors, (434), 434 states have call successors, (434) [2025-01-09 18:56:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 18:56:11,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:11,311 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:56:11,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:11,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1037300598, now seen corresponding path program 1 times [2025-01-09 18:56:11,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:11,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027267287] [2025-01-09 18:56:11,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:11,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:12,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 18:56:12,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 18:56:12,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:12,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 18:56:12,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:12,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027267287] [2025-01-09 18:56:12,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027267287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:12,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:12,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:12,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518439726] [2025-01-09 18:56:12,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:12,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:12,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:12,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:12,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:12,819 INFO L87 Difference]: Start difference. First operand has 1739 states, 1205 states have (on average 1.35850622406639) internal successors, (1637), 1250 states have internal predecessors, (1637), 440 states have call successors, (440), 93 states have call predecessors, (440), 92 states have return successors, (434), 428 states have call predecessors, (434), 434 states have call successors, (434) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 18:56:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:13,239 INFO L93 Difference]: Finished difference Result 5148 states and 7570 transitions. [2025-01-09 18:56:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:13,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 84 [2025-01-09 18:56:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:13,293 INFO L225 Difference]: With dead ends: 5148 [2025-01-09 18:56:13,294 INFO L226 Difference]: Without dead ends: 3367 [2025-01-09 18:56:13,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:13,318 INFO L435 NwaCegarLoop]: 2547 mSDtfsCounter, 2429 mSDsluCounter, 2451 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2429 SdHoareTripleChecker+Valid, 4998 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:13,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2429 Valid, 4998 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:56:13,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2025-01-09 18:56:13,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 3345. [2025-01-09 18:56:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3345 states, 2321 states have (on average 1.3433864713485566) internal successors, (3118), 2389 states have internal predecessors, (3118), 844 states have call successors, (844), 180 states have call predecessors, (844), 179 states have return successors, (835), 821 states have call predecessors, (835), 835 states have call successors, (835) [2025-01-09 18:56:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 4797 transitions. [2025-01-09 18:56:13,632 INFO L78 Accepts]: Start accepts. Automaton has 3345 states and 4797 transitions. Word has length 84 [2025-01-09 18:56:13,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:13,633 INFO L471 AbstractCegarLoop]: Abstraction has 3345 states and 4797 transitions. [2025-01-09 18:56:13,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 18:56:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3345 states and 4797 transitions. [2025-01-09 18:56:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 18:56:13,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:13,640 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:56:13,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:56:13,640 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:13,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:13,642 INFO L85 PathProgramCache]: Analyzing trace with hash 659126740, now seen corresponding path program 1 times [2025-01-09 18:56:13,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:13,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002550434] [2025-01-09 18:56:13,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:13,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:14,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 18:56:14,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 18:56:14,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:14,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 18:56:14,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:14,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002550434] [2025-01-09 18:56:14,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002550434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:14,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:14,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:14,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251102784] [2025-01-09 18:56:14,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:14,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:14,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:14,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:14,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:14,820 INFO L87 Difference]: Start difference. First operand 3345 states and 4797 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 18:56:18,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:56:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:19,189 INFO L93 Difference]: Finished difference Result 9917 states and 14241 transitions. [2025-01-09 18:56:19,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:19,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-01-09 18:56:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:19,238 INFO L225 Difference]: With dead ends: 9917 [2025-01-09 18:56:19,238 INFO L226 Difference]: Without dead ends: 6596 [2025-01-09 18:56:19,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:19,259 INFO L435 NwaCegarLoop]: 2561 mSDtfsCounter, 2375 mSDsluCounter, 2425 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2375 SdHoareTripleChecker+Valid, 4986 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:19,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2375 Valid, 4986 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:56:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6596 states. [2025-01-09 18:56:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6596 to 6585. [2025-01-09 18:56:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6585 states, 4576 states have (on average 1.3444055944055944) internal successors, (6152), 4701 states have internal predecessors, (6152), 1657 states have call successors, (1657), 352 states have call predecessors, (1657), 351 states have return successors, (1648), 1623 states have call predecessors, (1648), 1648 states have call successors, (1648) [2025-01-09 18:56:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6585 states to 6585 states and 9457 transitions. [2025-01-09 18:56:19,642 INFO L78 Accepts]: Start accepts. Automaton has 6585 states and 9457 transitions. Word has length 89 [2025-01-09 18:56:19,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:19,644 INFO L471 AbstractCegarLoop]: Abstraction has 6585 states and 9457 transitions. [2025-01-09 18:56:19,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 18:56:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 6585 states and 9457 transitions. [2025-01-09 18:56:19,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 18:56:19,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:19,647 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:56:19,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:56:19,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:19,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:19,647 INFO L85 PathProgramCache]: Analyzing trace with hash -581203376, now seen corresponding path program 1 times [2025-01-09 18:56:19,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:19,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421334686] [2025-01-09 18:56:19,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:19,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:20,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 18:56:20,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 18:56:20,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:20,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 18:56:20,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:20,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421334686] [2025-01-09 18:56:20,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421334686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:20,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:20,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:20,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025295792] [2025-01-09 18:56:20,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:20,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:20,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:20,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:20,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:20,587 INFO L87 Difference]: Start difference. First operand 6585 states and 9457 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 18:56:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:20,933 INFO L93 Difference]: Finished difference Result 16929 states and 24175 transitions. [2025-01-09 18:56:20,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:20,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2025-01-09 18:56:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:20,988 INFO L225 Difference]: With dead ends: 16929 [2025-01-09 18:56:20,989 INFO L226 Difference]: Without dead ends: 10368 [2025-01-09 18:56:21,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:21,021 INFO L435 NwaCegarLoop]: 2587 mSDtfsCounter, 1432 mSDsluCounter, 2407 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 4994 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:21,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1432 Valid, 4994 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:56:21,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10368 states. [2025-01-09 18:56:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10368 to 10345. [2025-01-09 18:56:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10345 states, 7266 states have (on average 1.3459950454170106) internal successors, (9780), 7445 states have internal predecessors, (9780), 2473 states have call successors, (2473), 606 states have call predecessors, (2473), 605 states have return successors, (2464), 2423 states have call predecessors, (2464), 2464 states have call successors, (2464) [2025-01-09 18:56:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10345 states to 10345 states and 14717 transitions. [2025-01-09 18:56:21,336 INFO L78 Accepts]: Start accepts. Automaton has 10345 states and 14717 transitions. Word has length 92 [2025-01-09 18:56:21,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:21,336 INFO L471 AbstractCegarLoop]: Abstraction has 10345 states and 14717 transitions. [2025-01-09 18:56:21,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 18:56:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 10345 states and 14717 transitions. [2025-01-09 18:56:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 18:56:21,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:21,338 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:56:21,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:56:21,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:21,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:21,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1894958037, now seen corresponding path program 1 times [2025-01-09 18:56:21,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:21,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879185196] [2025-01-09 18:56:21,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:21,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:22,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 18:56:22,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 18:56:22,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:22,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 18:56:22,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:22,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879185196] [2025-01-09 18:56:22,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879185196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:22,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:22,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:22,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264038667] [2025-01-09 18:56:22,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:22,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:22,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:22,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:22,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:22,458 INFO L87 Difference]: Start difference. First operand 10345 states and 14717 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:56:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:22,666 INFO L93 Difference]: Finished difference Result 10347 states and 14718 transitions. [2025-01-09 18:56:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:22,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2025-01-09 18:56:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:22,741 INFO L225 Difference]: With dead ends: 10347 [2025-01-09 18:56:22,742 INFO L226 Difference]: Without dead ends: 10344 [2025-01-09 18:56:22,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:22,752 INFO L435 NwaCegarLoop]: 2451 mSDtfsCounter, 2420 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2420 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:22,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2420 Valid, 2451 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10344 states. [2025-01-09 18:56:23,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10344 to 10344. [2025-01-09 18:56:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10344 states, 7266 states have (on average 1.3458574181117533) internal successors, (9779), 7444 states have internal predecessors, (9779), 2472 states have call successors, (2472), 606 states have call predecessors, (2472), 605 states have return successors, (2464), 2423 states have call predecessors, (2464), 2464 states have call successors, (2464) [2025-01-09 18:56:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10344 states to 10344 states and 14715 transitions. [2025-01-09 18:56:23,198 INFO L78 Accepts]: Start accepts. Automaton has 10344 states and 14715 transitions. Word has length 90 [2025-01-09 18:56:23,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:23,198 INFO L471 AbstractCegarLoop]: Abstraction has 10344 states and 14715 transitions. [2025-01-09 18:56:23,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:56:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 10344 states and 14715 transitions. [2025-01-09 18:56:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 18:56:23,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:23,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:56:23,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:56:23,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:23,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1386478293, now seen corresponding path program 1 times [2025-01-09 18:56:23,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:23,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539551153] [2025-01-09 18:56:23,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:23,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:23,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 18:56:23,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 18:56:23,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:23,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 18:56:24,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:24,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539551153] [2025-01-09 18:56:24,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539551153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:24,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:24,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:24,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389285444] [2025-01-09 18:56:24,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:24,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:24,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:24,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:24,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:24,118 INFO L87 Difference]: Start difference. First operand 10344 states and 14715 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:56:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:24,311 INFO L93 Difference]: Finished difference Result 10346 states and 14716 transitions. [2025-01-09 18:56:24,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:24,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 91 [2025-01-09 18:56:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:24,370 INFO L225 Difference]: With dead ends: 10346 [2025-01-09 18:56:24,370 INFO L226 Difference]: Without dead ends: 10343 [2025-01-09 18:56:24,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:24,380 INFO L435 NwaCegarLoop]: 2449 mSDtfsCounter, 2417 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2417 SdHoareTripleChecker+Valid, 2449 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:24,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2417 Valid, 2449 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10343 states. [2025-01-09 18:56:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10343 to 10343. [2025-01-09 18:56:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10343 states, 7266 states have (on average 1.345719790806496) internal successors, (9778), 7443 states have internal predecessors, (9778), 2471 states have call successors, (2471), 606 states have call predecessors, (2471), 605 states have return successors, (2464), 2423 states have call predecessors, (2464), 2464 states have call successors, (2464) [2025-01-09 18:56:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10343 states to 10343 states and 14713 transitions. [2025-01-09 18:56:24,801 INFO L78 Accepts]: Start accepts. Automaton has 10343 states and 14713 transitions. Word has length 91 [2025-01-09 18:56:24,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:24,801 INFO L471 AbstractCegarLoop]: Abstraction has 10343 states and 14713 transitions. [2025-01-09 18:56:24,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:56:24,802 INFO L276 IsEmpty]: Start isEmpty. Operand 10343 states and 14713 transitions. [2025-01-09 18:56:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 18:56:24,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:24,802 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:56:24,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:56:24,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:24,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:24,803 INFO L85 PathProgramCache]: Analyzing trace with hash -31784552, now seen corresponding path program 1 times [2025-01-09 18:56:24,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:24,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855568341] [2025-01-09 18:56:24,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:24,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:25,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 18:56:25,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 18:56:25,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:25,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 18:56:25,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:25,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855568341] [2025-01-09 18:56:25,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855568341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:25,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:25,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:25,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411611109] [2025-01-09 18:56:25,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:25,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:25,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:25,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:25,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:25,800 INFO L87 Difference]: Start difference. First operand 10343 states and 14713 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:56:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:26,227 INFO L93 Difference]: Finished difference Result 13591 states and 19227 transitions. [2025-01-09 18:56:26,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:26,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2025-01-09 18:56:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:26,299 INFO L225 Difference]: With dead ends: 13591 [2025-01-09 18:56:26,299 INFO L226 Difference]: Without dead ends: 13587 [2025-01-09 18:56:26,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:26,312 INFO L435 NwaCegarLoop]: 3182 mSDtfsCounter, 2350 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2350 SdHoareTripleChecker+Valid, 4369 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:26,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2350 Valid, 4369 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:26,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13587 states. [2025-01-09 18:56:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13587 to 13585. [2025-01-09 18:56:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13585 states, 9506 states have (on average 1.3386282347990743) internal successors, (12725), 9725 states have internal predecessors, (12725), 3249 states have call successors, (3249), 830 states have call predecessors, (3249), 829 states have return successors, (3244), 3191 states have call predecessors, (3244), 3244 states have call successors, (3244) [2025-01-09 18:56:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13585 states to 13585 states and 19218 transitions. [2025-01-09 18:56:26,842 INFO L78 Accepts]: Start accepts. Automaton has 13585 states and 19218 transitions. Word has length 92 [2025-01-09 18:56:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:26,842 INFO L471 AbstractCegarLoop]: Abstraction has 13585 states and 19218 transitions. [2025-01-09 18:56:26,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:56:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 13585 states and 19218 transitions. [2025-01-09 18:56:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 18:56:26,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:26,843 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:56:26,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:56:26,843 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:26,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:26,844 INFO L85 PathProgramCache]: Analyzing trace with hash -985946674, now seen corresponding path program 1 times [2025-01-09 18:56:26,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:26,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977032465] [2025-01-09 18:56:26,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:26,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:27,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 18:56:27,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 18:56:27,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:27,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 18:56:27,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:27,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977032465] [2025-01-09 18:56:27,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977032465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:27,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:27,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:27,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324697346] [2025-01-09 18:56:27,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:27,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:27,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:27,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:27,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:27,739 INFO L87 Difference]: Start difference. First operand 13585 states and 19218 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:56:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:28,054 INFO L93 Difference]: Finished difference Result 13657 states and 19292 transitions. [2025-01-09 18:56:28,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:28,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2025-01-09 18:56:28,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:28,126 INFO L225 Difference]: With dead ends: 13657 [2025-01-09 18:56:28,127 INFO L226 Difference]: Without dead ends: 13653 [2025-01-09 18:56:28,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:28,140 INFO L435 NwaCegarLoop]: 2446 mSDtfsCounter, 2346 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2346 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:28,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2346 Valid, 2524 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13653 states. [2025-01-09 18:56:28,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13653 to 13651. [2025-01-09 18:56:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13651 states, 9546 states have (on average 1.3364760108946157) internal successors, (12758), 9763 states have internal predecessors, (12758), 3263 states have call successors, (3263), 842 states have call predecessors, (3263), 841 states have return successors, (3260), 3207 states have call predecessors, (3260), 3260 states have call successors, (3260) [2025-01-09 18:56:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13651 states to 13651 states and 19281 transitions. [2025-01-09 18:56:28,643 INFO L78 Accepts]: Start accepts. Automaton has 13651 states and 19281 transitions. Word has length 93 [2025-01-09 18:56:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:28,643 INFO L471 AbstractCegarLoop]: Abstraction has 13651 states and 19281 transitions. [2025-01-09 18:56:28,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:56:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 13651 states and 19281 transitions. [2025-01-09 18:56:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 18:56:28,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:28,646 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:56:28,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:56:28,646 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:28,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:28,647 INFO L85 PathProgramCache]: Analyzing trace with hash -500196517, now seen corresponding path program 1 times [2025-01-09 18:56:28,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:28,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474210389] [2025-01-09 18:56:28,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:28,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:29,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 18:56:29,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 18:56:29,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:29,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 18:56:29,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:29,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474210389] [2025-01-09 18:56:29,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474210389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:29,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:29,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:29,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832310510] [2025-01-09 18:56:29,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:29,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:29,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:29,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:29,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:29,560 INFO L87 Difference]: Start difference. First operand 13651 states and 19281 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:56:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:30,022 INFO L93 Difference]: Finished difference Result 13653 states and 19282 transitions. [2025-01-09 18:56:30,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:30,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2025-01-09 18:56:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:30,103 INFO L225 Difference]: With dead ends: 13653 [2025-01-09 18:56:30,103 INFO L226 Difference]: Without dead ends: 13636 [2025-01-09 18:56:30,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:30,115 INFO L435 NwaCegarLoop]: 2440 mSDtfsCounter, 2404 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2404 SdHoareTripleChecker+Valid, 2440 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:30,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2404 Valid, 2440 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:30,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13636 states. [2025-01-09 18:56:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13636 to 13636. [2025-01-09 18:56:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13636 states, 9534 states have (on average 1.3359555275854835) internal successors, (12737), 9750 states have internal predecessors, (12737), 3261 states have call successors, (3261), 841 states have call predecessors, (3261), 840 states have return successors, (3259), 3206 states have call predecessors, (3259), 3259 states have call successors, (3259) [2025-01-09 18:56:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13636 states to 13636 states and 19257 transitions. [2025-01-09 18:56:30,975 INFO L78 Accepts]: Start accepts. Automaton has 13636 states and 19257 transitions. Word has length 94 [2025-01-09 18:56:30,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:30,975 INFO L471 AbstractCegarLoop]: Abstraction has 13636 states and 19257 transitions. [2025-01-09 18:56:30,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:56:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 13636 states and 19257 transitions. [2025-01-09 18:56:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 18:56:30,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:30,985 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:56:30,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:56:30,985 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:30,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash -548928615, now seen corresponding path program 1 times [2025-01-09 18:56:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:30,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755507694] [2025-01-09 18:56:30,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:30,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:31,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 18:56:31,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 18:56:31,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:31,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-09 18:56:32,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:32,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755507694] [2025-01-09 18:56:32,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755507694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:32,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:32,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:56:32,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956765062] [2025-01-09 18:56:32,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:32,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:56:32,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:32,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:56:32,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:56:32,347 INFO L87 Difference]: Start difference. First operand 13636 states and 19257 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 18:56:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:33,504 INFO L93 Difference]: Finished difference Result 34005 states and 48028 transitions. [2025-01-09 18:56:33,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:56:33,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2025-01-09 18:56:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:33,587 INFO L225 Difference]: With dead ends: 34005 [2025-01-09 18:56:33,588 INFO L226 Difference]: Without dead ends: 20403 [2025-01-09 18:56:33,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:56:33,635 INFO L435 NwaCegarLoop]: 2451 mSDtfsCounter, 2405 mSDsluCounter, 4791 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2405 SdHoareTripleChecker+Valid, 7242 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:33,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2405 Valid, 7242 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 18:56:33,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20403 states. [2025-01-09 18:56:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20403 to 20397. [2025-01-09 18:56:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20397 states, 14274 states have (on average 1.3363458035589184) internal successors, (19075), 14597 states have internal predecessors, (19075), 4862 states have call successors, (4862), 1261 states have call predecessors, (4862), 1260 states have return successors, (4860), 4780 states have call predecessors, (4860), 4860 states have call successors, (4860) [2025-01-09 18:56:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20397 states to 20397 states and 28797 transitions. [2025-01-09 18:56:34,747 INFO L78 Accepts]: Start accepts. Automaton has 20397 states and 28797 transitions. Word has length 147 [2025-01-09 18:56:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:34,747 INFO L471 AbstractCegarLoop]: Abstraction has 20397 states and 28797 transitions. [2025-01-09 18:56:34,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 18:56:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 20397 states and 28797 transitions. [2025-01-09 18:56:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 18:56:34,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:34,754 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:56:34,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:56:34,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:34,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1869908312, now seen corresponding path program 1 times [2025-01-09 18:56:34,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:34,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122305457] [2025-01-09 18:56:34,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:34,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:35,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 18:56:35,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 18:56:35,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:35,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 18:56:35,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:35,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122305457] [2025-01-09 18:56:35,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122305457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:35,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:35,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:35,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200383981] [2025-01-09 18:56:35,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:35,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:35,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:35,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:35,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:35,896 INFO L87 Difference]: Start difference. First operand 20397 states and 28797 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 18:56:39,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:56:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:40,593 INFO L93 Difference]: Finished difference Result 20399 states and 28798 transitions. [2025-01-09 18:56:40,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:40,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 148 [2025-01-09 18:56:40,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:40,702 INFO L225 Difference]: With dead ends: 20399 [2025-01-09 18:56:40,702 INFO L226 Difference]: Without dead ends: 20396 [2025-01-09 18:56:40,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:40,716 INFO L435 NwaCegarLoop]: 2438 mSDtfsCounter, 68 mSDsluCounter, 2364 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 4802 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:40,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 4802 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:56:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20396 states. [2025-01-09 18:56:41,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20396 to 20396. [2025-01-09 18:56:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20396 states, 14274 states have (on average 1.335645229087852) internal successors, (19065), 14596 states have internal predecessors, (19065), 4861 states have call successors, (4861), 1261 states have call predecessors, (4861), 1260 states have return successors, (4860), 4780 states have call predecessors, (4860), 4860 states have call successors, (4860) [2025-01-09 18:56:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20396 states to 20396 states and 28786 transitions. [2025-01-09 18:56:42,024 INFO L78 Accepts]: Start accepts. Automaton has 20396 states and 28786 transitions. Word has length 148 [2025-01-09 18:56:42,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:42,025 INFO L471 AbstractCegarLoop]: Abstraction has 20396 states and 28786 transitions. [2025-01-09 18:56:42,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 18:56:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 20396 states and 28786 transitions. [2025-01-09 18:56:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 18:56:42,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:42,069 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:56:42,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 18:56:42,070 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:42,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:42,071 INFO L85 PathProgramCache]: Analyzing trace with hash 538608955, now seen corresponding path program 1 times [2025-01-09 18:56:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:42,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641505439] [2025-01-09 18:56:42,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:42,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:42,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 18:56:42,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 18:56:42,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:42,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-09 18:56:43,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:43,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641505439] [2025-01-09 18:56:43,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641505439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:43,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:43,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:43,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66663291] [2025-01-09 18:56:43,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:43,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:43,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:43,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:43,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:43,168 INFO L87 Difference]: Start difference. First operand 20396 states and 28786 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 18:56:47,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:56:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:48,282 INFO L93 Difference]: Finished difference Result 46534 states and 65556 transitions. [2025-01-09 18:56:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:48,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 213 [2025-01-09 18:56:48,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:48,431 INFO L225 Difference]: With dead ends: 46534 [2025-01-09 18:56:48,432 INFO L226 Difference]: Without dead ends: 26172 [2025-01-09 18:56:48,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:48,506 INFO L435 NwaCegarLoop]: 4310 mSDtfsCounter, 2151 mSDsluCounter, 2274 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2151 SdHoareTripleChecker+Valid, 6584 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:48,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2151 Valid, 6584 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 18:56:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26172 states. [2025-01-09 18:56:49,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26172 to 26172. [2025-01-09 18:56:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26172 states, 18436 states have (on average 1.3366239965285311) internal successors, (24642), 18838 states have internal predecessors, (24642), 6066 states have call successors, (6066), 1670 states have call predecessors, (6066), 1669 states have return successors, (6065), 5961 states have call predecessors, (6065), 6065 states have call successors, (6065) [2025-01-09 18:56:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26172 states to 26172 states and 36773 transitions. [2025-01-09 18:56:49,714 INFO L78 Accepts]: Start accepts. Automaton has 26172 states and 36773 transitions. Word has length 213 [2025-01-09 18:56:49,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:49,716 INFO L471 AbstractCegarLoop]: Abstraction has 26172 states and 36773 transitions. [2025-01-09 18:56:49,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 18:56:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand 26172 states and 36773 transitions. [2025-01-09 18:56:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-01-09 18:56:49,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:49,764 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:56:49,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 18:56:49,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:49,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:49,764 INFO L85 PathProgramCache]: Analyzing trace with hash 536724513, now seen corresponding path program 1 times [2025-01-09 18:56:49,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:49,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908325628] [2025-01-09 18:56:49,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:49,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:50,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-01-09 18:56:50,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-01-09 18:56:50,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:50,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-01-09 18:56:50,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:50,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908325628] [2025-01-09 18:56:50,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908325628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:50,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:50,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:56:50,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570016798] [2025-01-09 18:56:50,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:50,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:56:50,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:50,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:56:50,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:56:50,751 INFO L87 Difference]: Start difference. First operand 26172 states and 36773 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 18:56:54,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:56:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:56,389 INFO L93 Difference]: Finished difference Result 61161 states and 86103 transitions. [2025-01-09 18:56:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:56:56,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 242 [2025-01-09 18:56:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:56,720 INFO L225 Difference]: With dead ends: 61161 [2025-01-09 18:56:56,721 INFO L226 Difference]: Without dead ends: 35023 [2025-01-09 18:56:56,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:56:56,823 INFO L435 NwaCegarLoop]: 4590 mSDtfsCounter, 2168 mSDsluCounter, 7003 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2168 SdHoareTripleChecker+Valid, 11593 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:56,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2168 Valid, 11593 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 18:56:56,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35023 states. [2025-01-09 18:56:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35023 to 26184. [2025-01-09 18:56:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26184 states, 18448 states have (on average 1.336405030355594) internal successors, (24654), 18850 states have internal predecessors, (24654), 6066 states have call successors, (6066), 1670 states have call predecessors, (6066), 1669 states have return successors, (6065), 5961 states have call predecessors, (6065), 6065 states have call successors, (6065) [2025-01-09 18:56:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26184 states to 26184 states and 36785 transitions. [2025-01-09 18:56:58,491 INFO L78 Accepts]: Start accepts. Automaton has 26184 states and 36785 transitions. Word has length 242 [2025-01-09 18:56:58,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:58,492 INFO L471 AbstractCegarLoop]: Abstraction has 26184 states and 36785 transitions. [2025-01-09 18:56:58,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 18:56:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 26184 states and 36785 transitions. [2025-01-09 18:56:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-01-09 18:56:58,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:58,545 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:56:58,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 18:56:58,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:58,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:58,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1298641320, now seen corresponding path program 1 times [2025-01-09 18:56:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:58,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692565056] [2025-01-09 18:56:58,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:58,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:59,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 18:56:59,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 18:56:59,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:59,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:59,623 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-09 18:56:59,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:59,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692565056] [2025-01-09 18:56:59,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692565056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:59,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:59,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:59,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000782002] [2025-01-09 18:56:59,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:59,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:59,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:59,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:59,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:59,626 INFO L87 Difference]: Start difference. First operand 26184 states and 36785 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 18:57:03,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:57:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:57:05,596 INFO L93 Difference]: Finished difference Result 58828 states and 82572 transitions. [2025-01-09 18:57:05,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:57:05,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 323 [2025-01-09 18:57:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:57:05,722 INFO L225 Difference]: With dead ends: 58828 [2025-01-09 18:57:05,722 INFO L226 Difference]: Without dead ends: 32678 [2025-01-09 18:57:05,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:57:05,778 INFO L435 NwaCegarLoop]: 3825 mSDtfsCounter, 1538 mSDsluCounter, 2398 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 6223 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:57:05,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 6223 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 18:57:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32678 states. [2025-01-09 18:57:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32678 to 32678. [2025-01-09 18:57:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32678 states, 23020 states have (on average 1.3348827106863597) internal successors, (30729), 23542 states have internal predecessors, (30729), 7531 states have call successors, (7531), 2127 states have call predecessors, (7531), 2126 states have return successors, (7530), 7402 states have call predecessors, (7530), 7530 states have call successors, (7530) [2025-01-09 18:57:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32678 states to 32678 states and 45790 transitions. [2025-01-09 18:57:07,108 INFO L78 Accepts]: Start accepts. Automaton has 32678 states and 45790 transitions. Word has length 323 [2025-01-09 18:57:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:57:07,109 INFO L471 AbstractCegarLoop]: Abstraction has 32678 states and 45790 transitions. [2025-01-09 18:57:07,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 18:57:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 32678 states and 45790 transitions. [2025-01-09 18:57:07,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-01-09 18:57:07,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:57:07,178 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:57:07,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 18:57:07,179 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:57:07,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:57:07,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1358490954, now seen corresponding path program 1 times [2025-01-09 18:57:07,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:57:07,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422927020] [2025-01-09 18:57:07,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:57:07,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:57:07,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-01-09 18:57:07,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-01-09 18:57:07,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:57:07,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:57:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-01-09 18:57:08,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:57:08,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422927020] [2025-01-09 18:57:08,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422927020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:57:08,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:57:08,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:57:08,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152345600] [2025-01-09 18:57:08,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:57:08,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:57:08,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:57:08,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:57:08,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:57:08,488 INFO L87 Difference]: Start difference. First operand 32678 states and 45790 transitions. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 5 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (47), 5 states have call predecessors, (47), 5 states have call successors, (47) [2025-01-09 18:57:12,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []