./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1264b42ba0b5dcb83ee2e2b35dfcd5adbd8a3fb1fa3fff4328b672883ffa55c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 04:25:05,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:25:05,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:25:05,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:25:05,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:25:05,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:25:05,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:25:05,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:25:05,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:25:05,499 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:25:05,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:25:05,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:25:05,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:25:05,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:25:05,500 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:25:05,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:25:05,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:25:05,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:25:05,501 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:25:05,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:25:05,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:25:05,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:25:05,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:25:05,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:25:05,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:25:05,503 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/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-03-04 04:25:05,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:25:05,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:25:05,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:25:05,790 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:25:05,790 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:25:05,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/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-03-04 04:25:06,948 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa60cdc7/e03a43843f8442868d32f3d9759d696e/FLAG5f53bc86c [2025-03-04 04:25:07,389 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:25:07,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/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-03-04 04:25:07,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa60cdc7/e03a43843f8442868d32f3d9759d696e/FLAG5f53bc86c [2025-03-04 04:25:07,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa60cdc7/e03a43843f8442868d32f3d9759d696e [2025-03-04 04:25:07,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:25:07,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:25:07,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:25:07,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:25:07,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:25:07,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:25:07" (1/1) ... [2025-03-04 04:25:07,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5f9ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:07, skipping insertion in model container [2025-03-04 04:25:07,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:25:07" (1/1) ... [2025-03-04 04:25:07,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:25:09,298 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-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-03-04 04:25:09,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:25:09,521 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:25:09,583 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-03-04 04:25:09,585 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [3949] [2025-03-04 04:25:09,585 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [3956] [2025-03-04 04:25:09,585 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-03-04 04:25:09,585 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [3974] [2025-03-04 04:25:09,588 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-03-04 04:25:09,589 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-03-04 04:25:09,589 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-03-04 04:25:09,589 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-03-04 04:25:09,590 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-03-04 04:25:09,590 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-03-04 04:25:09,600 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-03-04 04:25:09,602 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-03-04 04:25:09,602 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-03-04 04:25:09,603 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-03-04 04:25:09,604 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-03-04 04:25:09,605 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-03-04 04:25:09,664 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-03-04 04:25:09,668 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-03-04 04:25:09,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-03-04 04:25:09,673 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-03-04 04:25:09,681 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-03-04 04:25:09,699 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-03-04 04:25:09,703 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-03-04 04:25:09,714 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-03-04 04:25:09,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-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-03-04 04:25:09,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:25:09,864 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:25:09,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:09 WrapperNode [2025-03-04 04:25:09,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:25:09,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:25:09,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:25:09,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:25:09,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:09" (1/1) ... [2025-03-04 04:25:09,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:09" (1/1) ... [2025-03-04 04:25:10,031 INFO L138 Inliner]: procedures = 308, calls = 1840, calls flagged for inlining = 110, calls inlined = 101, statements flattened = 4110 [2025-03-04 04:25:10,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:25:10,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:25:10,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:25:10,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:25:10,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:09" (1/1) ... [2025-03-04 04:25:10,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:09" (1/1) ... [2025-03-04 04:25:10,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:09" (1/1) ... [2025-03-04 04:25:10,416 INFO L175 MemorySlicer]: Split 675 memory accesses to 15 slices as follows [2, 23, 3, 0, 1, 8, 555, 2, 4, 7, 16, 10, 34, 6, 4]. 82 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0]. The 289 writes are split as follows [0, 23, 0, 0, 1, 0, 220, 1, 1, 4, 0, 5, 29, 4, 1]. [2025-03-04 04:25:10,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:09" (1/1) ... [2025-03-04 04:25:10,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:09" (1/1) ... [2025-03-04 04:25:10,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:09" (1/1) ... [2025-03-04 04:25:10,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:09" (1/1) ... [2025-03-04 04:25:10,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:09" (1/1) ... [2025-03-04 04:25:10,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:09" (1/1) ... [2025-03-04 04:25:10,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:25:10,603 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:25:10,603 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:25:10,603 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:25:10,604 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:09" (1/1) ... [2025-03-04 04:25:10,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:25:10,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:25:10,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 04:25:10,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 04:25:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-03-04 04:25:10,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-03-04 04:25:10,666 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock_of_memstick_host [2025-03-04 04:25:10,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock_of_memstick_host [2025-03-04 04:25:10,666 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2025-03-04 04:25:10,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2025-03-04 04:25:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:25:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:25:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:25:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:25:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:25:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:25:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:25:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:25:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:25:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 04:25:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 04:25:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 04:25:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 04:25:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 04:25:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 04:25:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:25:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:25:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 04:25:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 04:25:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure msb_stop [2025-03-04 04:25:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_stop [2025-03-04 04:25:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure msb_get_zone_from_pba [2025-03-04 04:25:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_get_zone_from_pba [2025-03-04 04:25:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2025-03-04 04:25:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2025-03-04 04:25:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:25:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:25:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure blk_fetch_request [2025-03-04 04:25:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_fetch_request [2025-03-04 04:25:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2025-03-04 04:25:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_restore [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_restore [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure msb_switch_to_parallel [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_switch_to_parallel [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-04 04:25:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-04 04:25:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-04 04:25:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-04 04:25:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:25:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:25:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure msb_validate_used_block_bitmap [2025-03-04 04:25:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_validate_used_block_bitmap [2025-03-04 04:25:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-04 04:25:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-04 04:25:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure msb_verify_block [2025-03-04 04:25:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_verify_block [2025-03-04 04:25:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-04 04:25:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-04 04:25:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_2 [2025-03-04 04:25:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_2 [2025-03-04 04:25:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_msb_disk_lock [2025-03-04 04:25:10,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_msb_disk_lock [2025-03-04 04:25:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:25:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure msb_cache_write [2025-03-04 04:25:10,672 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_cache_write [2025-03-04 04:25:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure trace_hardirqs_off [2025-03-04 04:25:10,672 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_hardirqs_off [2025-03-04 04:25:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure memstick_set_drvdata [2025-03-04 04:25:10,672 INFO L138 BoogieDeclarations]: Found implementation of procedure memstick_set_drvdata [2025-03-04 04:25:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure __blk_end_request [2025-03-04 04:25:10,673 INFO L138 BoogieDeclarations]: Found implementation of procedure __blk_end_request [2025-03-04 04:25:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:25:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:25:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:25:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:25:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:25:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:25:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:25:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:25:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:25:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 04:25:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 04:25:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 04:25:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 04:25:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 04:25:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 04:25:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2025-03-04 04:25:10,674 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2025-03-04 04:25:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure msb_invalidate_reg_window [2025-03-04 04:25:10,674 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_invalidate_reg_window [2025-03-04 04:25:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure msb_io_work [2025-03-04 04:25:10,674 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_io_work [2025-03-04 04:25:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-04 04:25:10,674 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-04 04:25:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure sg_init_table [2025-03-04 04:25:10,674 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_init_table [2025-03-04 04:25:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:25:10,675 INFO L130 BoogieDeclarations]: Found specification of procedure msb_erase_block [2025-03-04 04:25:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_erase_block [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 04:25:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure memstick_get_drvdata [2025-03-04 04:25:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure memstick_get_drvdata [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure msb_data_clear [2025-03-04 04:25:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_data_clear [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 04:25:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2025-03-04 04:25:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-04 04:25:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-04 04:25:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-03-04 04:25:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-03-04 04:25:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure msb_read_bad_block_table [2025-03-04 04:25:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_read_bad_block_table [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure msb_update_block [2025-03-04 04:25:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_update_block [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure msb_cache_flush [2025-03-04 04:25:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_cache_flush [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_next [2025-03-04 04:25:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_next [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2025-03-04 04:25:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_start [2025-03-04 04:25:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_start [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure msb_run_state_machine [2025-03-04 04:25:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_run_state_machine [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure msb_sg_copy [2025-03-04 04:25:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_sg_copy [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure sg_page [2025-03-04 04:25:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_page [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-04 04:25:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure find_next_zero_bit [2025-03-04 04:25:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure find_next_zero_bit [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 04:25:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 04:25:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock_of_memstick_host [2025-03-04 04:25:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock_of_memstick_host [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2025-03-04 04:25:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2025-03-04 04:25:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure msb_get_zone_from_lba [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_get_zone_from_lba [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure msb_reset [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_reset [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_2 [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_2 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure blk_start_queue [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_start_queue [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure msb_bd_getgeo [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_bd_getgeo [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure msb_remove [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_remove [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure sg_next [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_next [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure msb_mark_bad [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_mark_bad [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_2 [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_2 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure sg_nents [2025-03-04 04:25:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_nents [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:25:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:25:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:25:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:25:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:25:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:25:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:25:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:25:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 04:25:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 04:25:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 04:25:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 04:25:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 04:25:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 04:25:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure msb_read_page [2025-03-04 04:25:10,683 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_read_page [2025-03-04 04:25:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure __set_bit [2025-03-04 04:25:10,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __set_bit [2025-03-04 04:25:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_stop [2025-03-04 04:25:10,683 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_stop [2025-03-04 04:25:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure msb_set_overwrite_flag [2025-03-04 04:25:10,683 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_set_overwrite_flag [2025-03-04 04:25:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure blk_rq_bytes [2025-03-04 04:25:10,683 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_rq_bytes [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2025-03-04 04:25:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure msb_disk_release [2025-03-04 04:25:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_disk_release [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure msb_mark_block_used [2025-03-04 04:25:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_mark_block_used [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure msb_cache_discard [2025-03-04 04:25:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_cache_discard [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-03-04 04:25:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure msb_start [2025-03-04 04:25:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_start [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2025-03-04 04:25:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2025-03-04 04:25:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure idr_remove [2025-03-04 04:25:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure idr_remove [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure msb_init_card [2025-03-04 04:25:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_init_card [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_page [2025-03-04 04:25:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_page [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-04 04:25:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:25:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:25:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:25:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:25:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:25:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 04:25:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 04:25:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 04:25:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 04:25:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 04:25:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 04:25:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure sg_init_one [2025-03-04 04:25:10,685 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_init_one [2025-03-04 04:25:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2025-03-04 04:25:10,685 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2025-03-04 04:25:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_msb_disk_lock [2025-03-04 04:25:10,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_msb_disk_lock [2025-03-04 04:25:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:25:10,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:25:11,258 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:25:11,262 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:25:11,298 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:25:11,387 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9188: havoc #t~ret1121.base, #t~ret1121.offset; [2025-03-04 04:25:11,466 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9149: havoc __bitmap_weight_#t~nondet1116#1; [2025-03-04 04:25:11,533 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5708: call ULTIMATE.dealloc(~#sg~2#1.base, ~#sg~2#1.offset);havoc ~#sg~2#1.base, ~#sg~2#1.offset; [2025-03-04 04:25:11,533 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4643: call ULTIMATE.dealloc(msb_sg_compare_to_buffer_~#miter~0#1.base, msb_sg_compare_to_buffer_~#miter~0#1.offset);havoc msb_sg_compare_to_buffer_~#miter~0#1.base, msb_sg_compare_to_buffer_~#miter~0#1.offset; [2025-03-04 04:25:11,639 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9318: havoc sg_copy_to_buffer_#t~nondet1135#1; [2025-03-04 04:25:11,640 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6577: call ULTIMATE.dealloc(~#sg_tmp~0#1.base, ~#sg_tmp~0#1.offset);havoc ~#sg_tmp~0#1.base, ~#sg_tmp~0#1.offset; [2025-03-04 04:25:11,640 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9278: havoc mod_timer_#t~nondet1128#1; [2025-03-04 04:25:11,649 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9153: havoc #t~nondet1117; [2025-03-04 04:25:11,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4511: havoc blk_rq_pos_#t~mem143#1; [2025-03-04 04:25:11,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6627: call ULTIMATE.dealloc(msb_cache_read_~#sg_tmp~1#1.base, msb_cache_read_~#sg_tmp~1#1.offset);havoc msb_cache_read_~#sg_tmp~1#1.base, msb_cache_read_~#sg_tmp~1#1.offset; [2025-03-04 04:25:11,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6900: call ULTIMATE.dealloc(~#len~2#1.base, ~#len~2#1.offset);havoc ~#len~2#1.base, ~#len~2#1.offset; [2025-03-04 04:25:11,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9314: havoc sg_copy_from_buffer_#t~nondet1134#1; [2025-03-04 04:25:11,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9216: havoc blk_rq_map_sg_#t~nondet1123#1; [2025-03-04 04:25:11,958 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9292: havoc #t~nondet1130; [2025-03-04 04:25:11,964 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4383: havoc dev_get_drvdata_#t~mem90#1.base, dev_get_drvdata_#t~mem90#1.offset; [2025-03-04 04:25:11,982 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9303: havoc #t~nondet1132; [2025-03-04 04:25:11,986 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4320: havoc __kmalloc_#t~ret86#1.base, __kmalloc_#t~ret86#1.offset; [2025-03-04 04:25:12,003 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3981: havoc #t~bitwise4; [2025-03-04 04:25:12,004 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9170: havoc #t~nondet1119; [2025-03-04 04:25:12,061 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6112: call ULTIMATE.dealloc(~#sg~4.base, ~#sg~4.offset);havoc ~#sg~4.base, ~#sg~4.offset; [2025-03-04 04:25:12,180 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5841: call ULTIMATE.dealloc(msb_get_free_block_~#pos~0#1.base, msb_get_free_block_~#pos~0#1.offset);havoc msb_get_free_block_~#pos~0#1.base, msb_get_free_block_~#pos~0#1.offset; [2025-03-04 04:25:12,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6478: call ULTIMATE.dealloc(~#sg~5.base, ~#sg~5.offset);havoc ~#sg~5.base, ~#sg~5.offset;call ULTIMATE.dealloc(~#extra~2.base, ~#extra~2.offset);havoc ~#extra~2.base, ~#extra~2.offset; [2025-03-04 04:25:12,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9328: havoc #t~nondet1136; [2025-03-04 04:25:12,262 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4831: havoc #t~mem245#1; [2025-03-04 04:25:12,330 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4474: havoc #t~mem112; [2025-03-04 04:25:12,334 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9236: havoc #t~nondet1125; [2025-03-04 04:25:12,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9232: havoc #t~nondet1124; [2025-03-04 04:25:12,478 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9341: havoc #t~ret1138.base, #t~ret1138.offset; [2025-03-04 04:25:12,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9338: havoc #t~nondet1137; [2025-03-04 04:25:12,616 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5552: call ULTIMATE.dealloc(~#miter~1#1.base, ~#miter~1#1.offset);havoc ~#miter~1#1.base, ~#miter~1#1.offset; [2025-03-04 04:25:12,616 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4124: havoc arch_irqs_disabled_flags_#t~bitwise28#1; [2025-03-04 04:25:12,645 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4517: havoc #t~mem144; [2025-03-04 04:25:12,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9163: havoc __msecs_to_jiffies_#t~nondet1118#1; [2025-03-04 04:25:13,081 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6282: call ULTIMATE.dealloc(msb_ftl_scan_~#extra~1#1.base, msb_ftl_scan_~#extra~1#1.offset);havoc msb_ftl_scan_~#extra~1#1.base, msb_ftl_scan_~#extra~1#1.offset; [2025-03-04 04:25:13,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6024: call ULTIMATE.dealloc(msb_read_boot_blocks_~#sg~3#1.base, msb_read_boot_blocks_~#sg~3#1.offset);havoc msb_read_boot_blocks_~#sg~3#1.base, msb_read_boot_blocks_~#sg~3#1.offset;call ULTIMATE.dealloc(msb_read_boot_blocks_~#extra~0#1.base, msb_read_boot_blocks_~#extra~0#1.offset);havoc msb_read_boot_blocks_~#extra~0#1.base, msb_read_boot_blocks_~#extra~0#1.offset; [2025-03-04 04:25:17,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7900: call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset);havoc main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset);havoc main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset; [2025-03-04 04:25:17,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9191: havoc blk_init_queue_#t~ret1122#1.base, blk_init_queue_#t~ret1122#1.offset; [2025-03-04 04:25:17,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7245: call ULTIMATE.dealloc(msb_init_disk_~#__key~0#1.base, msb_init_disk_~#__key~0#1.offset);havoc msb_init_disk_~#__key~0#1.base, msb_init_disk_~#__key~0#1.offset;call ULTIMATE.dealloc(msb_init_disk_~#__key___0~0#1.base, msb_init_disk_~#__key___0~0#1.offset);havoc msb_init_disk_~#__key___0~0#1.base, msb_init_disk_~#__key___0~0#1.offset;call ULTIMATE.dealloc(msb_init_disk_~#__constr_expr_0~0#1.base, msb_init_disk_~#__constr_expr_0~0#1.offset);havoc msb_init_disk_~#__constr_expr_0~0#1.base, msb_init_disk_~#__constr_expr_0~0#1.offset; [2025-03-04 04:25:17,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7415: call ULTIMATE.dealloc(msb_resume_~#__key~2#1.base, msb_resume_~#__key~2#1.offset);havoc msb_resume_~#__key~2#1.base, msb_resume_~#__key~2#1.offset; [2025-03-04 04:25:17,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9271: havoc memstick_register_driver_#t~nondet1127#1; [2025-03-04 04:25:17,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9307: havoc register_blkdev_#t~nondet1133#1; [2025-03-04 04:25:17,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9145: havoc __alloc_workqueue_key_#t~ret1115#1.base, __alloc_workqueue_key_#t~ret1115#1.offset; [2025-03-04 04:25:17,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7263: havoc msb_init_disk_#t~mem951#1; [2025-03-04 04:25:17,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9179: havoc alloc_disk_#t~ret1120#1.base, alloc_disk_#t~ret1120#1.offset; [2025-03-04 04:25:17,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9246: havoc idr_alloc_#t~nondet1126#1; [2025-03-04 04:25:17,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7334: call ULTIMATE.dealloc(msb_probe_~#__key~1#1.base, msb_probe_~#__key~1#1.offset);havoc msb_probe_~#__key~1#1.base, msb_probe_~#__key~1#1.offset; [2025-03-04 04:25:18,196 INFO L? ?]: Removed 1492 outVars from TransFormulas that were not future-live. [2025-03-04 04:25:18,196 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:25:18,258 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:25:18,259 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 04:25:18,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:25:18 BoogieIcfgContainer [2025-03-04 04:25:18,259 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:25:18,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:25:18,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:25:18,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:25:18,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:25:07" (1/3) ... [2025-03-04 04:25:18,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3070d5b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:25:18, skipping insertion in model container [2025-03-04 04:25:18,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:25:09" (2/3) ... [2025-03-04 04:25:18,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3070d5b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:25:18, skipping insertion in model container [2025-03-04 04:25:18,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:25:18" (3/3) ... [2025-03-04 04:25:18,270 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-03-04 04:25:18,280 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:25:18,283 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, 1783 locations, 1 initial locations, 16 loop locations, and 1 error locations. [2025-03-04 04:25:18,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:25:18,360 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;@7c1b173, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:25:18,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:25:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 1742 states, 1208 states have (on average 1.3576158940397351) internal successors, (1640), 1253 states have internal predecessors, (1640), 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-03-04 04:25:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 04:25:18,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:18,377 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-03-04 04:25:18,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:18,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:18,381 INFO L85 PathProgramCache]: Analyzing trace with hash -544534812, now seen corresponding path program 1 times [2025-03-04 04:25:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:18,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460680468] [2025-03-04 04:25:18,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:18,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:19,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 04:25:19,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 04:25:19,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:19,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 04:25:19,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:19,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460680468] [2025-03-04 04:25:19,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460680468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:25:19,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807931600] [2025-03-04 04:25:19,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:19,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:25:19,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:25:19,721 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:25:19,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 04:25:20,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 04:25:20,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 04:25:20,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:20,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:20,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 2148 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 04:25:20,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:25:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 04:25:20,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:25:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807931600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:20,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:25:20,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 04:25:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70982137] [2025-03-04 04:25:20,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:20,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 04:25:20,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:21,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 04:25:21,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:25:21,015 INFO L87 Difference]: Start difference. First operand has 1742 states, 1208 states have (on average 1.3576158940397351) internal successors, (1640), 1253 states have internal predecessors, (1640), 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 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 04:25:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:21,298 INFO L93 Difference]: Finished difference Result 3479 states and 5091 transitions. [2025-03-04 04:25:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 04:25:21,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2025-03-04 04:25:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:21,322 INFO L225 Difference]: With dead ends: 3479 [2025-03-04 04:25:21,322 INFO L226 Difference]: Without dead ends: 1717 [2025-03-04 04:25:21,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:25:21,339 INFO L435 NwaCegarLoop]: 2477 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:21,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2477 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:25:21,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2025-03-04 04:25:21,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1717. [2025-03-04 04:25:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1191 states have (on average 1.341729638958858) internal successors, (1598), 1228 states have internal predecessors, (1598), 434 states have call successors, (434), 92 states have call predecessors, (434), 91 states have return successors, (425), 419 states have call predecessors, (425), 425 states have call successors, (425) [2025-03-04 04:25:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2457 transitions. [2025-03-04 04:25:21,497 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2457 transitions. Word has length 84 [2025-03-04 04:25:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:21,498 INFO L471 AbstractCegarLoop]: Abstraction has 1717 states and 2457 transitions. [2025-03-04 04:25:21,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 04:25:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2457 transitions. [2025-03-04 04:25:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 04:25:21,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:21,502 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-03-04 04:25:21,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 04:25:21,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 04:25:21,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:21,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:21,704 INFO L85 PathProgramCache]: Analyzing trace with hash -869597466, now seen corresponding path program 1 times [2025-03-04 04:25:21,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:21,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326481738] [2025-03-04 04:25:21,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:21,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:22,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 04:25:22,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 04:25:22,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:22,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 04:25:22,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:22,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326481738] [2025-03-04 04:25:22,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326481738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:22,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:22,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:22,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949539908] [2025-03-04 04:25:22,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:22,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:22,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:22,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:22,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:22,708 INFO L87 Difference]: Start difference. First operand 1717 states and 2457 transitions. 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-03-04 04:25:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:23,178 INFO L93 Difference]: Finished difference Result 5066 states and 7257 transitions. [2025-03-04 04:25:23,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:23,178 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-03-04 04:25:23,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:23,208 INFO L225 Difference]: With dead ends: 5066 [2025-03-04 04:25:23,208 INFO L226 Difference]: Without dead ends: 3373 [2025-03-04 04:25:23,218 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-03-04 04:25:23,219 INFO L435 NwaCegarLoop]: 2488 mSDtfsCounter, 2393 mSDsluCounter, 2392 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 4880 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:23,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 4880 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:25:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2025-03-04 04:25:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3351. [2025-03-04 04:25:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 2327 states have (on average 1.3425010743446497) internal successors, (3124), 2395 states have internal predecessors, (3124), 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-03-04 04:25:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4803 transitions. [2025-03-04 04:25:23,388 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4803 transitions. Word has length 84 [2025-03-04 04:25:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:23,388 INFO L471 AbstractCegarLoop]: Abstraction has 3351 states and 4803 transitions. [2025-03-04 04:25:23,389 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-03-04 04:25:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4803 transitions. [2025-03-04 04:25:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 04:25:23,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:23,394 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-03-04 04:25:23,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:25:23,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:23,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1489598272, now seen corresponding path program 1 times [2025-03-04 04:25:23,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:23,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302077165] [2025-03-04 04:25:23,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:24,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 04:25:24,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 04:25:24,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:24,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 04:25:24,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:24,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302077165] [2025-03-04 04:25:24,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302077165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:24,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:24,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334794811] [2025-03-04 04:25:24,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:24,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:24,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:24,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:24,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:24,335 INFO L87 Difference]: Start difference. First operand 3351 states and 4803 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-03-04 04:25:28,358 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-03-04 04:25:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:28,971 INFO L93 Difference]: Finished difference Result 9935 states and 14259 transitions. [2025-03-04 04:25:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:28,971 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-03-04 04:25:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:29,026 INFO L225 Difference]: With dead ends: 9935 [2025-03-04 04:25:29,027 INFO L226 Difference]: Without dead ends: 6608 [2025-03-04 04:25:29,047 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-03-04 04:25:29,048 INFO L435 NwaCegarLoop]: 2543 mSDtfsCounter, 2378 mSDsluCounter, 2407 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2378 SdHoareTripleChecker+Valid, 4950 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:29,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2378 Valid, 4950 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-04 04:25:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6608 states. [2025-03-04 04:25:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6608 to 6597. [2025-03-04 04:25:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6597 states, 4588 states have (on average 1.3435047951176984) internal successors, (6164), 4713 states have internal predecessors, (6164), 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-03-04 04:25:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6597 states to 6597 states and 9469 transitions. [2025-03-04 04:25:29,320 INFO L78 Accepts]: Start accepts. Automaton has 6597 states and 9469 transitions. Word has length 89 [2025-03-04 04:25:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:29,322 INFO L471 AbstractCegarLoop]: Abstraction has 6597 states and 9469 transitions. [2025-03-04 04:25:29,322 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-03-04 04:25:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6597 states and 9469 transitions. [2025-03-04 04:25:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 04:25:29,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:29,325 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-03-04 04:25:29,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:25:29,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:29,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash 408338308, now seen corresponding path program 1 times [2025-03-04 04:25:29,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:29,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271128611] [2025-03-04 04:25:29,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:29,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:30,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 04:25:30,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 04:25:30,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:30,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 04:25:30,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:30,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271128611] [2025-03-04 04:25:30,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271128611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:30,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:30,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:30,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940831572] [2025-03-04 04:25:30,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:30,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:30,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:30,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:30,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:30,308 INFO L87 Difference]: Start difference. First operand 6597 states and 9469 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-03-04 04:25:30,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:30,611 INFO L93 Difference]: Finished difference Result 6599 states and 9470 transitions. [2025-03-04 04:25:30,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:30,612 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-03-04 04:25:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:30,657 INFO L225 Difference]: With dead ends: 6599 [2025-03-04 04:25:30,657 INFO L226 Difference]: Without dead ends: 6596 [2025-03-04 04:25:30,665 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-03-04 04:25:30,665 INFO L435 NwaCegarLoop]: 2433 mSDtfsCounter, 2423 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2423 SdHoareTripleChecker+Valid, 2433 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:30,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2423 Valid, 2433 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:25:30,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6596 states. [2025-03-04 04:25:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6596 to 6596. [2025-03-04 04:25:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6596 states, 4588 states have (on average 1.343286835222319) internal successors, (6163), 4712 states have internal predecessors, (6163), 1656 states have call successors, (1656), 352 states have call predecessors, (1656), 351 states have return successors, (1648), 1623 states have call predecessors, (1648), 1648 states have call successors, (1648) [2025-03-04 04:25:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 9467 transitions. [2025-03-04 04:25:30,927 INFO L78 Accepts]: Start accepts. Automaton has 6596 states and 9467 transitions. Word has length 90 [2025-03-04 04:25:30,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:30,928 INFO L471 AbstractCegarLoop]: Abstraction has 6596 states and 9467 transitions. [2025-03-04 04:25:30,928 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-03-04 04:25:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 6596 states and 9467 transitions. [2025-03-04 04:25:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 04:25:30,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:30,929 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-03-04 04:25:30,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:25:30,930 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:30,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:30,931 INFO L85 PathProgramCache]: Analyzing trace with hash 422637866, now seen corresponding path program 1 times [2025-03-04 04:25:30,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:30,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241495618] [2025-03-04 04:25:30,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:30,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:31,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 04:25:31,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 04:25:31,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:31,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 04:25:31,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:31,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241495618] [2025-03-04 04:25:31,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241495618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:31,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:31,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:31,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891015912] [2025-03-04 04:25:31,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:31,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:31,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:31,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:31,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:31,713 INFO L87 Difference]: Start difference. First operand 6596 states and 9467 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-03-04 04:25:32,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:32,354 INFO L93 Difference]: Finished difference Result 16954 states and 24197 transitions. [2025-03-04 04:25:32,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:32,359 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-03-04 04:25:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:32,442 INFO L225 Difference]: With dead ends: 16954 [2025-03-04 04:25:32,442 INFO L226 Difference]: Without dead ends: 10382 [2025-03-04 04:25:32,482 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-03-04 04:25:32,483 INFO L435 NwaCegarLoop]: 2568 mSDtfsCounter, 1431 mSDsluCounter, 2387 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 4955 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:32,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1431 Valid, 4955 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 04:25:32,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10382 states. [2025-03-04 04:25:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10382 to 10360. [2025-03-04 04:25:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10360 states, 7282 states have (on average 1.3450975006866246) internal successors, (9795), 7460 states have internal predecessors, (9795), 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-03-04 04:25:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10360 states to 10360 states and 14731 transitions. [2025-03-04 04:25:32,926 INFO L78 Accepts]: Start accepts. Automaton has 10360 states and 14731 transitions. Word has length 92 [2025-03-04 04:25:32,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:32,927 INFO L471 AbstractCegarLoop]: Abstraction has 10360 states and 14731 transitions. [2025-03-04 04:25:32,927 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-03-04 04:25:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 10360 states and 14731 transitions. [2025-03-04 04:25:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 04:25:32,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:32,929 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-03-04 04:25:32,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:25:32,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:32,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:32,931 INFO L85 PathProgramCache]: Analyzing trace with hash -227479877, now seen corresponding path program 1 times [2025-03-04 04:25:32,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:32,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014754994] [2025-03-04 04:25:32,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:32,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:33,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 04:25:33,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 04:25:33,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:33,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 04:25:34,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:34,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014754994] [2025-03-04 04:25:34,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014754994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:34,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:34,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:34,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218619578] [2025-03-04 04:25:34,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:34,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:34,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:34,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:34,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:34,073 INFO L87 Difference]: Start difference. First operand 10360 states and 14731 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-03-04 04:25:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:34,400 INFO L93 Difference]: Finished difference Result 10362 states and 14732 transitions. [2025-03-04 04:25:34,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:34,402 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-03-04 04:25:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:34,458 INFO L225 Difference]: With dead ends: 10362 [2025-03-04 04:25:34,458 INFO L226 Difference]: Without dead ends: 10359 [2025-03-04 04:25:34,468 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-03-04 04:25:34,469 INFO L435 NwaCegarLoop]: 2431 mSDtfsCounter, 2420 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2420 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:34,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2420 Valid, 2431 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:25:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10359 states. [2025-03-04 04:25:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10359 to 10359. [2025-03-04 04:25:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10359 states, 7282 states have (on average 1.3449601757758858) internal successors, (9794), 7459 states have internal predecessors, (9794), 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-03-04 04:25:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10359 states to 10359 states and 14729 transitions. [2025-03-04 04:25:34,914 INFO L78 Accepts]: Start accepts. Automaton has 10359 states and 14729 transitions. Word has length 91 [2025-03-04 04:25:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:34,915 INFO L471 AbstractCegarLoop]: Abstraction has 10359 states and 14729 transitions. [2025-03-04 04:25:34,915 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-03-04 04:25:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 10359 states and 14729 transitions. [2025-03-04 04:25:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 04:25:34,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:34,917 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-03-04 04:25:34,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:25:34,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:34,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:34,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1536991845, now seen corresponding path program 1 times [2025-03-04 04:25:34,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:34,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093754879] [2025-03-04 04:25:34,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:35,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 04:25:35,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 04:25:35,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:35,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 04:25:35,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:35,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093754879] [2025-03-04 04:25:35,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093754879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:35,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:35,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:35,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805154531] [2025-03-04 04:25:35,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:35,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:35,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:35,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:35,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:35,735 INFO L87 Difference]: Start difference. First operand 10359 states and 14729 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-03-04 04:25:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:36,305 INFO L93 Difference]: Finished difference Result 13607 states and 19243 transitions. [2025-03-04 04:25:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:36,305 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-03-04 04:25:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:36,370 INFO L225 Difference]: With dead ends: 13607 [2025-03-04 04:25:36,370 INFO L226 Difference]: Without dead ends: 13603 [2025-03-04 04:25:36,381 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-03-04 04:25:36,382 INFO L435 NwaCegarLoop]: 3154 mSDtfsCounter, 2352 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2352 SdHoareTripleChecker+Valid, 4328 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:36,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2352 Valid, 4328 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:25:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13603 states. [2025-03-04 04:25:36,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13603 to 13601. [2025-03-04 04:25:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13601 states, 9522 states have (on average 1.3380592312539383) internal successors, (12741), 9741 states have internal predecessors, (12741), 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-03-04 04:25:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13601 states to 13601 states and 19234 transitions. [2025-03-04 04:25:36,874 INFO L78 Accepts]: Start accepts. Automaton has 13601 states and 19234 transitions. Word has length 92 [2025-03-04 04:25:36,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:36,874 INFO L471 AbstractCegarLoop]: Abstraction has 13601 states and 19234 transitions. [2025-03-04 04:25:36,874 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-03-04 04:25:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 13601 states and 19234 transitions. [2025-03-04 04:25:36,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 04:25:36,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:36,876 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-03-04 04:25:36,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 04:25:36,876 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:36,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:36,877 INFO L85 PathProgramCache]: Analyzing trace with hash 401039356, now seen corresponding path program 1 times [2025-03-04 04:25:36,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:36,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735448568] [2025-03-04 04:25:36,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:36,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:37,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 04:25:37,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 04:25:37,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:37,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 04:25:37,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:37,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735448568] [2025-03-04 04:25:37,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735448568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:37,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:37,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:37,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820873221] [2025-03-04 04:25:37,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:37,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:37,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:37,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:37,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:37,680 INFO L87 Difference]: Start difference. First operand 13601 states and 19234 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-03-04 04:25:38,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:38,288 INFO L93 Difference]: Finished difference Result 13673 states and 19308 transitions. [2025-03-04 04:25:38,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:38,289 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-03-04 04:25:38,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:38,370 INFO L225 Difference]: With dead ends: 13673 [2025-03-04 04:25:38,370 INFO L226 Difference]: Without dead ends: 13669 [2025-03-04 04:25:38,384 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-03-04 04:25:38,384 INFO L435 NwaCegarLoop]: 2428 mSDtfsCounter, 2349 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2349 SdHoareTripleChecker+Valid, 2506 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:38,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2349 Valid, 2506 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:25:38,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13669 states. [2025-03-04 04:25:39,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13669 to 13667. [2025-03-04 04:25:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13667 states, 9562 states have (on average 1.335912988914453) internal successors, (12774), 9779 states have internal predecessors, (12774), 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-03-04 04:25:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13667 states to 13667 states and 19297 transitions. [2025-03-04 04:25:39,254 INFO L78 Accepts]: Start accepts. Automaton has 13667 states and 19297 transitions. Word has length 93 [2025-03-04 04:25:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:39,255 INFO L471 AbstractCegarLoop]: Abstraction has 13667 states and 19297 transitions. [2025-03-04 04:25:39,255 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-03-04 04:25:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 13667 states and 19297 transitions. [2025-03-04 04:25:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 04:25:39,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:39,258 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-03-04 04:25:39,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 04:25:39,259 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:39,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:39,259 INFO L85 PathProgramCache]: Analyzing trace with hash -453750458, now seen corresponding path program 1 times [2025-03-04 04:25:39,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:39,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694869494] [2025-03-04 04:25:39,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:39,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:39,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 04:25:39,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 04:25:39,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:39,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:40,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-03-04 04:25:40,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:40,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694869494] [2025-03-04 04:25:40,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694869494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:40,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635152392] [2025-03-04 04:25:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:40,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:40,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:40,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:40,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:40,116 INFO L87 Difference]: Start difference. First operand 13667 states and 19297 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-03-04 04:25:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:40,802 INFO L93 Difference]: Finished difference Result 13669 states and 19298 transitions. [2025-03-04 04:25:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:40,803 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-03-04 04:25:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:40,853 INFO L225 Difference]: With dead ends: 13669 [2025-03-04 04:25:40,854 INFO L226 Difference]: Without dead ends: 13652 [2025-03-04 04:25:40,861 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-03-04 04:25:40,864 INFO L435 NwaCegarLoop]: 2422 mSDtfsCounter, 2407 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2407 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:40,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2407 Valid, 2422 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:25:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13652 states. [2025-03-04 04:25:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13652 to 13652. [2025-03-04 04:25:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13652 states, 9550 states have (on average 1.335392670157068) internal successors, (12753), 9766 states have internal predecessors, (12753), 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-03-04 04:25:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13652 states to 13652 states and 19273 transitions. [2025-03-04 04:25:41,384 INFO L78 Accepts]: Start accepts. Automaton has 13652 states and 19273 transitions. Word has length 94 [2025-03-04 04:25:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:41,384 INFO L471 AbstractCegarLoop]: Abstraction has 13652 states and 19273 transitions. [2025-03-04 04:25:41,385 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-03-04 04:25:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 13652 states and 19273 transitions. [2025-03-04 04:25:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 04:25:41,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:41,393 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-03-04 04:25:41,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 04:25:41,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:41,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash -565499961, now seen corresponding path program 1 times [2025-03-04 04:25:41,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:41,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201801604] [2025-03-04 04:25:41,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:41,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:42,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 04:25:42,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 04:25:42,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:42,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-04 04:25:42,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:42,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201801604] [2025-03-04 04:25:42,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201801604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:42,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:42,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:25:42,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130614116] [2025-03-04 04:25:42,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:42,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:25:42,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:42,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:25:42,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:25:42,772 INFO L87 Difference]: Start difference. First operand 13652 states and 19273 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-03-04 04:25:44,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:44,451 INFO L93 Difference]: Finished difference Result 34045 states and 48068 transitions. [2025-03-04 04:25:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:25:44,451 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-03-04 04:25:44,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:44,538 INFO L225 Difference]: With dead ends: 34045 [2025-03-04 04:25:44,538 INFO L226 Difference]: Without dead ends: 20427 [2025-03-04 04:25:44,588 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-03-04 04:25:44,588 INFO L435 NwaCegarLoop]: 2433 mSDtfsCounter, 2408 mSDsluCounter, 4755 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2408 SdHoareTripleChecker+Valid, 7188 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:44,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2408 Valid, 7188 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 04:25:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20427 states. [2025-03-04 04:25:45,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20427 to 20421. [2025-03-04 04:25:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20421 states, 14298 states have (on average 1.3357812281437964) internal successors, (19099), 14621 states have internal predecessors, (19099), 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-03-04 04:25:45,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20421 states to 20421 states and 28821 transitions. [2025-03-04 04:25:45,780 INFO L78 Accepts]: Start accepts. Automaton has 20421 states and 28821 transitions. Word has length 147 [2025-03-04 04:25:45,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:45,780 INFO L471 AbstractCegarLoop]: Abstraction has 20421 states and 28821 transitions. [2025-03-04 04:25:45,781 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-03-04 04:25:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 20421 states and 28821 transitions. [2025-03-04 04:25:45,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 04:25:45,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:45,787 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-03-04 04:25:45,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 04:25:45,788 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:45,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash 660429242, now seen corresponding path program 1 times [2025-03-04 04:25:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:45,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795016290] [2025-03-04 04:25:45,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:45,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:46,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 04:25:46,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 04:25:46,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:46,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-04 04:25:46,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:46,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795016290] [2025-03-04 04:25:46,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795016290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:46,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:46,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:46,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426598022] [2025-03-04 04:25:46,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:46,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:46,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:46,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:46,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:46,972 INFO L87 Difference]: Start difference. First operand 20421 states and 28821 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-03-04 04:25:50,997 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-03-04 04:25:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:52,085 INFO L93 Difference]: Finished difference Result 20423 states and 28822 transitions. [2025-03-04 04:25:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:52,086 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-03-04 04:25:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:52,185 INFO L225 Difference]: With dead ends: 20423 [2025-03-04 04:25:52,186 INFO L226 Difference]: Without dead ends: 20420 [2025-03-04 04:25:52,203 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-03-04 04:25:52,203 INFO L435 NwaCegarLoop]: 2420 mSDtfsCounter, 68 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 4766 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:52,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 4766 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-04 04:25:52,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20420 states. [2025-03-04 04:25:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20420 to 20420. [2025-03-04 04:25:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20420 states, 14298 states have (on average 1.3350818296265212) internal successors, (19089), 14620 states have internal predecessors, (19089), 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-03-04 04:25:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20420 states to 20420 states and 28810 transitions. [2025-03-04 04:25:53,046 INFO L78 Accepts]: Start accepts. Automaton has 20420 states and 28810 transitions. Word has length 148 [2025-03-04 04:25:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:25:53,048 INFO L471 AbstractCegarLoop]: Abstraction has 20420 states and 28810 transitions. [2025-03-04 04:25:53,048 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-03-04 04:25:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 20420 states and 28810 transitions. [2025-03-04 04:25:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-04 04:25:53,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:25:53,089 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-03-04 04:25:53,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 04:25:53,089 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:25:53,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:25:53,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1738301871, now seen corresponding path program 1 times [2025-03-04 04:25:53,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:25:53,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401265965] [2025-03-04 04:25:53,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:25:53,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:25:53,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-04 04:25:53,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-04 04:25:53,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:25:53,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:25:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-04 04:25:54,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:25:54,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401265965] [2025-03-04 04:25:54,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401265965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:25:54,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:25:54,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:25:54,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336693120] [2025-03-04 04:25:54,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:25:54,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:25:54,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:25:54,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:25:54,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:25:54,014 INFO L87 Difference]: Start difference. First operand 20420 states and 28810 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-03-04 04:25:58,035 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-03-04 04:25:59,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:25:59,658 INFO L93 Difference]: Finished difference Result 46588 states and 65610 transitions. [2025-03-04 04:25:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:25:59,658 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-03-04 04:25:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:25:59,784 INFO L225 Difference]: With dead ends: 46588 [2025-03-04 04:25:59,784 INFO L226 Difference]: Without dead ends: 26202 [2025-03-04 04:25:59,850 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-03-04 04:25:59,851 INFO L435 NwaCegarLoop]: 4272 mSDtfsCounter, 2153 mSDsluCounter, 2256 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2153 SdHoareTripleChecker+Valid, 6528 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-04 04:25:59,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2153 Valid, 6528 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-03-04 04:25:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26202 states. [2025-03-04 04:26:00,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26202 to 26202. [2025-03-04 04:26:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26202 states, 18466 states have (on average 1.3360771146972814) internal successors, (24672), 18868 states have internal predecessors, (24672), 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-03-04 04:26:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26202 states to 26202 states and 36803 transitions. [2025-03-04 04:26:01,184 INFO L78 Accepts]: Start accepts. Automaton has 26202 states and 36803 transitions. Word has length 213 [2025-03-04 04:26:01,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:01,185 INFO L471 AbstractCegarLoop]: Abstraction has 26202 states and 36803 transitions. [2025-03-04 04:26:01,185 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-03-04 04:26:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 26202 states and 36803 transitions. [2025-03-04 04:26:01,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-04 04:26:01,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:01,252 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-03-04 04:26:01,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 04:26:01,252 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:01,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:01,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1383727008, now seen corresponding path program 1 times [2025-03-04 04:26:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:01,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42375761] [2025-03-04 04:26:01,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:01,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:02,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-04 04:26:02,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-04 04:26:02,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:02,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-04 04:26:02,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:02,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42375761] [2025-03-04 04:26:02,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42375761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:02,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:02,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:26:02,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368396998] [2025-03-04 04:26:02,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:02,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:26:02,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:02,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:26:02,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:26:02,678 INFO L87 Difference]: Start difference. First operand 26202 states and 36803 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-03-04 04:26:06,701 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-03-04 04:26:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:08,893 INFO L93 Difference]: Finished difference Result 61233 states and 86175 transitions. [2025-03-04 04:26:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:26:08,897 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-03-04 04:26:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:09,081 INFO L225 Difference]: With dead ends: 61233 [2025-03-04 04:26:09,081 INFO L226 Difference]: Without dead ends: 35065 [2025-03-04 04:26:09,166 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-03-04 04:26:09,166 INFO L435 NwaCegarLoop]: 4553 mSDtfsCounter, 2170 mSDsluCounter, 6948 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 11501 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:09,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 11501 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-03-04 04:26:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35065 states. [2025-03-04 04:26:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35065 to 26214. [2025-03-04 04:26:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26214 states, 18478 states have (on average 1.3358588591838945) internal successors, (24684), 18880 states have internal predecessors, (24684), 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-03-04 04:26:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26214 states to 26214 states and 36815 transitions. [2025-03-04 04:26:10,512 INFO L78 Accepts]: Start accepts. Automaton has 26214 states and 36815 transitions. Word has length 242 [2025-03-04 04:26:10,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:10,513 INFO L471 AbstractCegarLoop]: Abstraction has 26214 states and 36815 transitions. [2025-03-04 04:26:10,513 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-03-04 04:26:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 26214 states and 36815 transitions. [2025-03-04 04:26:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-04 04:26:10,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:10,568 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-03-04 04:26:10,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 04:26:10,569 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:10,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1224084670, now seen corresponding path program 1 times [2025-03-04 04:26:10,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:10,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003721989] [2025-03-04 04:26:10,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:10,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:11,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-04 04:26:11,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-04 04:26:11,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:11,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-04 04:26:11,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:11,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003721989] [2025-03-04 04:26:11,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003721989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:26:11,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732046787] [2025-03-04 04:26:11,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:11,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:26:11,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:26:11,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:26:11,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 04:26:13,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-04 04:26:13,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-04 04:26:13,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:13,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:13,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 3596 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 04:26:13,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:26:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-04 04:26:13,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:26:13,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732046787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:13,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:26:13,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 04:26:13,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654428414] [2025-03-04 04:26:13,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:13,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:26:13,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:13,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:26:13,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:26:13,717 INFO L87 Difference]: Start difference. First operand 26214 states and 36815 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-04 04:26:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:26:15,971 INFO L93 Difference]: Finished difference Result 58894 states and 82638 transitions. [2025-03-04 04:26:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:26:15,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 323 [2025-03-04 04:26:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:26:16,214 INFO L225 Difference]: With dead ends: 58894 [2025-03-04 04:26:16,214 INFO L226 Difference]: Without dead ends: 32714 [2025-03-04 04:26:16,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:26:16,346 INFO L435 NwaCegarLoop]: 2416 mSDtfsCounter, 2329 mSDsluCounter, 2212 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2329 SdHoareTripleChecker+Valid, 4628 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 04:26:16,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2329 Valid, 4628 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 04:26:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32714 states. [2025-03-04 04:26:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32714 to 32714. [2025-03-04 04:26:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32714 states, 23056 states have (on average 1.3354007633587786) internal successors, (30789), 23578 states have internal predecessors, (30789), 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-03-04 04:26:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32714 states to 32714 states and 45850 transitions. [2025-03-04 04:26:18,267 INFO L78 Accepts]: Start accepts. Automaton has 32714 states and 45850 transitions. Word has length 323 [2025-03-04 04:26:18,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:26:18,268 INFO L471 AbstractCegarLoop]: Abstraction has 32714 states and 45850 transitions. [2025-03-04 04:26:18,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-04 04:26:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 32714 states and 45850 transitions. [2025-03-04 04:26:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-03-04 04:26:18,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:26:18,371 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-03-04 04:26:18,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 04:26:18,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 04:26:18,572 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:26:18,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:26:18,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1119425136, now seen corresponding path program 1 times [2025-03-04 04:26:18,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:26:18,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15986512] [2025-03-04 04:26:18,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:26:18,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:26:19,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-04 04:26:19,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-04 04:26:19,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:26:19,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:26:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-04 04:26:19,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:26:19,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15986512] [2025-03-04 04:26:19,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15986512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:26:19,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:26:19,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:26:19,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423346925] [2025-03-04 04:26:19,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:26:19,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:26:19,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:26:19,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:26:19,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:26:19,983 INFO L87 Difference]: Start difference. First operand 32714 states and 45850 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)