./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--joystick--analog.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--joystick--analog.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c9ee75e44352b6ea6b091abc908af4681506ed391b6529699b0d4480d6bf973b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:40:02,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:40:02,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 02:40:02,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:40:02,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:40:02,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:40:02,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:40:02,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:40:02,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:40:02,725 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:40:02,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:40:02,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:40:02,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:40:02,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:40:02,726 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:40:02,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:40:02,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:40:02,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:40:02,727 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:40:02,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:40:02,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:40:02,727 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:40:02,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:40:02,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:40:02,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:40:02,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:40:02,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:40:02,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:40:02,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:40:02,728 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) 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 -> c9ee75e44352b6ea6b091abc908af4681506ed391b6529699b0d4480d6bf973b [2025-01-10 02:40:02,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:40:02,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:40:02,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:40:02,959 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:40:02,959 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:40:02,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--joystick--analog.ko-entry_point.cil.out.i [2025-01-10 02:40:04,124 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99663b0c7/72fb0edaaafd476c8a746c9bfa642025/FLAGbd4f84013 [2025-01-10 02:40:04,510 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:40:04,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--joystick--analog.ko-entry_point.cil.out.i [2025-01-10 02:40:04,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99663b0c7/72fb0edaaafd476c8a746c9bfa642025/FLAGbd4f84013 [2025-01-10 02:40:04,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99663b0c7/72fb0edaaafd476c8a746c9bfa642025 [2025-01-10 02:40:04,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:40:04,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:40:04,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:40:04,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:40:04,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:40:04,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:04" (1/1) ... [2025-01-10 02:40:04,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12fdff9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:04, skipping insertion in model container [2025-01-10 02:40:04,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:04" (1/1) ... [2025-01-10 02:40:04,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:40:04,917 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [2550] [2025-01-10 02:40:04,917 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [2551-2552] [2025-01-10 02:40:05,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:40:05,457 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:40:05,522 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [2550] [2025-01-10 02:40:05,522 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [2551-2552] [2025-01-10 02:40:05,524 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"); [2634] [2025-01-10 02:40:05,528 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("661:\n\tcall __sw_hweight32\n662:\n.pushsection .altinstructions,\"a\"\n .long 661b - .\n .long 6631f - .\n .word (4*32+23)\n .byte 662b-661b\n .byte 6641f-6631f\n.popsection\n.pushsection .discard,\"aw\",@progbits\n .byte 0xff + (6641f-6631f) - (662b-661b)\n.popsection\n.pushsection .altinstr_replacement, \"ax\"\n6631:\n\t.byte 0xf3,0x40,0x0f,0xb8,0xc7\n6641:\n\t.popsection": "=a" (res): "D" (w)); [2643] [2025-01-10 02:40:05,530 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" (179), "i" (12UL)); [2687-2688] [2025-01-10 02:40:05,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c6;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c5\n .byte 772b-771b\n .short %c7\n.popsection\n": "=D" (__edi), "=S" (__esi), "=d" (__edx), "=c" (__ecx), "=a" (__eax): [paravirt_typenum] "i" (34UL), [paravirt_opptr] "i" (& pv_cpu_ops.read_tsc), [paravirt_clobber] "i" (511): "memory", "cc", "r8", "r9", "r10", "r11"); [2693-2696] [2025-01-10 02:40:05,531 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" (804), "i" (12UL)); [2719-2720] [2025-01-10 02:40:05,531 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.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [2725-2727] [2025-01-10 02:40:05,531 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" (809), "i" (12UL)); [2749-2750] [2025-01-10 02:40:05,532 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.restore_fl.func), [paravirt_clobber] "i" (1), "D" (f): "memory", "cc"); [2755-2757] [2025-01-10 02:40:05,532 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" (814), "i" (12UL)); [2778-2779] [2025-01-10 02:40:05,532 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" (46UL), [paravirt_opptr] "i" (& pv_irq_ops.irq_disable.func), [paravirt_clobber] "i" (1): "memory", "cc"); [2784-2786] [2025-01-10 02:40:05,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("outb %b0, %w1": : "a" (value), "Nd" (port)); [2810] [2025-01-10 02:40:05,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1, %b0": "=a" (value): "Nd" (port)); [2818] [2025-01-10 02:40:05,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:40:05,691 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:40:05,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05 WrapperNode [2025-01-10 02:40:05,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:40:05,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:40:05,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:40:05,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:40:05,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,817 INFO L138 Inliner]: procedures = 120, calls = 710, calls flagged for inlining = 41, calls inlined = 39, statements flattened = 2504 [2025-01-10 02:40:05,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:40:05,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:40:05,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:40:05,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:40:05,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,934 INFO L175 MemorySlicer]: Split 482 memory accesses to 19 slices as follows [2, 28, 22, 252, 1, 1, 2, 3, 7, 21, 23, 6, 3, 9, 9, 5, 18, 19, 51]. 52 percent of accesses are in the largest equivalence class. The 134 initializations are split as follows [2, 0, 0, 7, 0, 0, 0, 0, 7, 16, 16, 4, 0, 6, 4, 3, 18, 0, 51]. The 145 writes are split as follows [0, 24, 22, 75, 0, 0, 1, 0, 0, 0, 5, 0, 1, 0, 0, 0, 0, 17, 0]. [2025-01-10 02:40:05,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:06,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:06,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:06,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:06,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:06,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:06,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:40:06,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:40:06,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:40:06,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:40:06,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:06,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:40:06,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:06,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 02:40:06,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 02:40:06,139 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_trigger [2025-01-10 02:40:06,140 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_trigger [2025-01-10 02:40:06,140 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-01-10 02:40:06,140 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-01-10 02:40:06,140 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_disable [2025-01-10 02:40:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_disable [2025-01-10 02:40:06,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-10 02:40:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-10 02:40:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-10 02:40:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-10 02:40:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-10 02:40:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-10 02:40:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-10 02:40:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-10 02:40:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2025-01-10 02:40:06,143 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight16 [2025-01-10 02:40:06,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight16 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-10 02:40:06,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-10 02:40:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_get_drvdata [2025-01-10 02:40:06,144 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_get_drvdata [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_read [2025-01-10 02:40:06,144 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_read [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-10 02:40:06,144 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2025-01-10 02:40:06,144 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_open [2025-01-10 02:40:06,144 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_open [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure trace_hardirqs_on [2025-01-10 02:40:06,144 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_hardirqs_on [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-10 02:40:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_restore [2025-01-10 02:40:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_restore [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight32 [2025-01-10 02:40:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight32 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2025-01-10 02:40:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-10 02:40:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-10 02:40:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 02:40:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_save [2025-01-10 02:40:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_save [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure analog_poll [2025-01-10 02:40:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_poll [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2025-01-10 02:40:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 02:40:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2025-01-10 02:40:06,146 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2025-01-10 02:40:06,146 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-10 02:40:06,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure trace_hardirqs_off [2025-01-10 02:40:06,146 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_hardirqs_off [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_set_drvdata [2025-01-10 02:40:06,146 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_set_drvdata [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 02:40:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-10 02:40:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-10 02:40:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-10 02:40:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-10 02:40:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-10 02:40:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-10 02:40:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-10 02:40:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-10 02:40:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-10 02:40:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-10 02:40:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-10 02:40:06,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-10 02:40:06,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-10 02:40:06,150 INFO L130 BoogieDeclarations]: Found specification of procedure analog_decode [2025-01-10 02:40:06,151 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_decode [2025-01-10 02:40:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure arch_irqs_disabled_flags [2025-01-10 02:40:06,151 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_irqs_disabled_flags [2025-01-10 02:40:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight8 [2025-01-10 02:40:06,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight8 [2025-01-10 02:40:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure analog_button_read [2025-01-10 02:40:06,151 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_button_read [2025-01-10 02:40:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 02:40:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-01-10 02:40:06,151 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-01-10 02:40:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2025-01-10 02:40:06,151 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2025-01-10 02:40:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 02:40:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 02:40:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 02:40:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-10 02:40:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-10 02:40:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-10 02:40:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-10 02:40:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-10 02:40:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-10 02:40:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-10 02:40:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-10 02:40:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-10 02:40:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-10 02:40:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-10 02:40:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-10 02:40:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-10 02:40:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-10 02:40:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-10 02:40:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-10 02:40:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2025-01-10 02:40:06,153 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2025-01-10 02:40:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_close [2025-01-10 02:40:06,153 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_close [2025-01-10 02:40:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_time [2025-01-10 02:40:06,153 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_time [2025-01-10 02:40:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-10 02:40:06,153 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-10 02:40:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure analog_disconnect [2025-01-10 02:40:06,154 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_disconnect [2025-01-10 02:40:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-01-10 02:40:06,154 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-01-10 02:40:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-01-10 02:40:06,154 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-01-10 02:40:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:40:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 02:40:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 02:40:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 02:40:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 02:40:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 02:40:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 02:40:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-10 02:40:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-10 02:40:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-10 02:40:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-10 02:40:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-10 02:40:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-10 02:40:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-10 02:40:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-10 02:40:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-10 02:40:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-10 02:40:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-10 02:40:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-10 02:40:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_cooked_read [2025-01-10 02:40:06,155 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_cooked_read [2025-01-10 02:40:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2025-01-10 02:40:06,155 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2025-01-10 02:40:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure paravirt_read_tsc [2025-01-10 02:40:06,155 INFO L138 BoogieDeclarations]: Found implementation of procedure paravirt_read_tsc [2025-01-10 02:40:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-10 02:40:06,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-10 02:40:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:40:06,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:40:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure analog_cooked_read [2025-01-10 02:40:06,155 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_cooked_read [2025-01-10 02:40:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2025-01-10 02:40:06,155 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2025-01-10 02:40:06,545 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:40:06,548 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:40:06,614 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-10 02:40:14,143 INFO L? ?]: Removed 1065 outVars from TransFormulas that were not future-live. [2025-01-10 02:40:14,144 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:40:14,186 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:40:14,186 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 02:40:14,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:14 BoogieIcfgContainer [2025-01-10 02:40:14,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:40:14,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:40:14,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:40:14,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:40:14,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:40:04" (1/3) ... [2025-01-10 02:40:14,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313c21bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:14, skipping insertion in model container [2025-01-10 02:40:14,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (2/3) ... [2025-01-10 02:40:14,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313c21bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:14, skipping insertion in model container [2025-01-10 02:40:14,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:14" (3/3) ... [2025-01-10 02:40:14,194 INFO L128 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--joystick--analog.ko-entry_point.cil.out.i [2025-01-10 02:40:14,205 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:40:14,208 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--joystick--analog.ko-entry_point.cil.out.i that has 46 procedures, 1379 locations, 1 initial locations, 3 loop locations, and 235 error locations. [2025-01-10 02:40:14,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:40:14,298 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;@5b54e1e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:40:14,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 235 error locations. [2025-01-10 02:40:14,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 1378 states, 961 states have (on average 1.571279916753382) internal successors, (1510), 1211 states have internal predecessors, (1510), 138 states have call successors, (138), 45 states have call predecessors, (138), 44 states have return successors, (135), 130 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-10 02:40:14,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 02:40:14,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:14,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:14,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:40:14,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:14,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1458326911, now seen corresponding path program 1 times [2025-01-10 02:40:14,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:14,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545907495] [2025-01-10 02:40:14,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:14,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:14,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 02:40:15,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 02:40:15,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:15,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:15,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:15,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545907495] [2025-01-10 02:40:15,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545907495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:15,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:15,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:40:15,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764716827] [2025-01-10 02:40:15,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:15,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:15,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:15,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:15,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:15,414 INFO L87 Difference]: Start difference. First operand has 1378 states, 961 states have (on average 1.571279916753382) internal successors, (1510), 1211 states have internal predecessors, (1510), 138 states have call successors, (138), 45 states have call predecessors, (138), 44 states have return successors, (135), 130 states have call predecessors, (135), 135 states have call successors, (135) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:15,628 INFO L93 Difference]: Finished difference Result 2794 states and 3660 transitions. [2025-01-10 02:40:15,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:15,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-10 02:40:15,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:15,648 INFO L225 Difference]: With dead ends: 2794 [2025-01-10 02:40:15,648 INFO L226 Difference]: Without dead ends: 1391 [2025-01-10 02:40:15,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:15,656 INFO L435 NwaCegarLoop]: 1740 mSDtfsCounter, 87 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 3460 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:15,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 3460 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:40:15,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-01-10 02:40:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1385. [2025-01-10 02:40:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 991 states have (on average 1.5317860746720484) internal successors, (1518), 1213 states have internal predecessors, (1518), 135 states have call successors, (135), 46 states have call predecessors, (135), 46 states have return successors, (135), 130 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-10 02:40:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1788 transitions. [2025-01-10 02:40:15,752 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1788 transitions. Word has length 18 [2025-01-10 02:40:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:15,754 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1788 transitions. [2025-01-10 02:40:15,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1788 transitions. [2025-01-10 02:40:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 02:40:15,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:15,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:15,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:40:15,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:40:15,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:15,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1698291862, now seen corresponding path program 1 times [2025-01-10 02:40:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:15,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444433001] [2025-01-10 02:40:15,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:15,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:16,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 02:40:16,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 02:40:16,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:16,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:16,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:16,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444433001] [2025-01-10 02:40:16,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444433001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:16,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:16,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:40:16,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124307584] [2025-01-10 02:40:16,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:16,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:16,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:16,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:16,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:16,526 INFO L87 Difference]: Start difference. First operand 1385 states and 1788 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:16,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:16,772 INFO L93 Difference]: Finished difference Result 2798 states and 3629 transitions. [2025-01-10 02:40:16,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:16,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-01-10 02:40:16,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:16,785 INFO L225 Difference]: With dead ends: 2798 [2025-01-10 02:40:16,785 INFO L226 Difference]: Without dead ends: 1429 [2025-01-10 02:40:16,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:16,790 INFO L435 NwaCegarLoop]: 1701 mSDtfsCounter, 23 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3395 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:16,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3395 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:40:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2025-01-10 02:40:16,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1427. [2025-01-10 02:40:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1031 states have (on average 1.5266731328806984) internal successors, (1574), 1253 states have internal predecessors, (1574), 137 states have call successors, (137), 46 states have call predecessors, (137), 46 states have return successors, (137), 132 states have call predecessors, (137), 137 states have call successors, (137) [2025-01-10 02:40:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1848 transitions. [2025-01-10 02:40:16,843 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1848 transitions. Word has length 20 [2025-01-10 02:40:16,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:16,844 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1848 transitions. [2025-01-10 02:40:16,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1848 transitions. [2025-01-10 02:40:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 02:40:16,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:16,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:16,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:40:16,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:40:16,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:16,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1669552336, now seen corresponding path program 1 times [2025-01-10 02:40:16,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:16,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937093570] [2025-01-10 02:40:16,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:16,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:17,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 02:40:17,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 02:40:17,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:17,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:17,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:17,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937093570] [2025-01-10 02:40:17,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937093570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:17,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:17,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:40:17,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96180546] [2025-01-10 02:40:17,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:17,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:17,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:17,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:17,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:17,539 INFO L87 Difference]: Start difference. First operand 1427 states and 1848 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:17,643 INFO L93 Difference]: Finished difference Result 1457 states and 1892 transitions. [2025-01-10 02:40:17,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:17,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-10 02:40:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:17,651 INFO L225 Difference]: With dead ends: 1457 [2025-01-10 02:40:17,652 INFO L226 Difference]: Without dead ends: 1455 [2025-01-10 02:40:17,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:17,655 INFO L435 NwaCegarLoop]: 1709 mSDtfsCounter, 3 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3413 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:17,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3413 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:40:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2025-01-10 02:40:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1451. [2025-01-10 02:40:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1055 states have (on average 1.5222748815165876) internal successors, (1606), 1277 states have internal predecessors, (1606), 137 states have call successors, (137), 46 states have call predecessors, (137), 46 states have return successors, (137), 132 states have call predecessors, (137), 137 states have call successors, (137) [2025-01-10 02:40:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1880 transitions. [2025-01-10 02:40:17,705 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1880 transitions. Word has length 23 [2025-01-10 02:40:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:17,706 INFO L471 AbstractCegarLoop]: Abstraction has 1451 states and 1880 transitions. [2025-01-10 02:40:17,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1880 transitions. [2025-01-10 02:40:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 02:40:17,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:17,707 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:17,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:40:17,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:40:17,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:17,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2023891408, now seen corresponding path program 1 times [2025-01-10 02:40:17,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:17,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171162253] [2025-01-10 02:40:17,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:17,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:18,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:40:18,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:40:18,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:18,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:18,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:18,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171162253] [2025-01-10 02:40:18,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171162253] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:18,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170288789] [2025-01-10 02:40:18,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:18,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:18,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:18,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:18,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 02:40:19,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:40:19,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:40:19,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:19,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:19,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:19,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:19,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:19,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170288789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:19,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:19,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:40:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825179107] [2025-01-10 02:40:19,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:19,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:40:19,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:19,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:40:19,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:19,351 INFO L87 Difference]: Start difference. First operand 1451 states and 1880 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:19,527 INFO L93 Difference]: Finished difference Result 1453 states and 1880 transitions. [2025-01-10 02:40:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:40:19,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-01-10 02:40:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:19,533 INFO L225 Difference]: With dead ends: 1453 [2025-01-10 02:40:19,533 INFO L226 Difference]: Without dead ends: 1451 [2025-01-10 02:40:19,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:19,535 INFO L435 NwaCegarLoop]: 1712 mSDtfsCounter, 46 mSDsluCounter, 3374 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 5086 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:19,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 5086 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:40:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2025-01-10 02:40:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2025-01-10 02:40:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1055 states have (on average 1.5184834123222748) internal successors, (1602), 1275 states have internal predecessors, (1602), 137 states have call successors, (137), 46 states have call predecessors, (137), 46 states have return successors, (137), 132 states have call predecessors, (137), 137 states have call successors, (137) [2025-01-10 02:40:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1876 transitions. [2025-01-10 02:40:19,569 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 1876 transitions. Word has length 24 [2025-01-10 02:40:19,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:19,570 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 1876 transitions. [2025-01-10 02:40:19,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1876 transitions. [2025-01-10 02:40:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 02:40:19,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:19,571 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:19,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 02:40:19,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:19,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:40:19,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:19,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1683878469, now seen corresponding path program 1 times [2025-01-10 02:40:19,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:19,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230223531] [2025-01-10 02:40:19,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:19,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:20,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:40:20,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:40:20,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:20,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:40:20,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:20,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230223531] [2025-01-10 02:40:20,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230223531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:20,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:20,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:40:20,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045653363] [2025-01-10 02:40:20,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:20,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:20,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:20,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:20,273 INFO L87 Difference]: Start difference. First operand 1449 states and 1876 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:20,375 INFO L93 Difference]: Finished difference Result 1451 states and 1876 transitions. [2025-01-10 02:40:20,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:20,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-10 02:40:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:20,381 INFO L225 Difference]: With dead ends: 1451 [2025-01-10 02:40:20,381 INFO L226 Difference]: Without dead ends: 1450 [2025-01-10 02:40:20,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:20,382 INFO L435 NwaCegarLoop]: 1698 mSDtfsCounter, 23 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3392 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:20,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3392 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:40:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-01-10 02:40:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1442. [2025-01-10 02:40:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1049 states have (on average 1.5195424213536701) internal successors, (1594), 1268 states have internal predecessors, (1594), 137 states have call successors, (137), 46 states have call predecessors, (137), 46 states have return successors, (137), 132 states have call predecessors, (137), 137 states have call successors, (137) [2025-01-10 02:40:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 1868 transitions. [2025-01-10 02:40:20,412 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 1868 transitions. Word has length 25 [2025-01-10 02:40:20,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:20,412 INFO L471 AbstractCegarLoop]: Abstraction has 1442 states and 1868 transitions. [2025-01-10 02:40:20,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:20,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1868 transitions. [2025-01-10 02:40:20,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 02:40:20,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:20,413 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:40:20,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:40:20,414 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:40:20,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:20,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1244075418, now seen corresponding path program 1 times [2025-01-10 02:40:20,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:20,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991119130] [2025-01-10 02:40:20,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:20,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:20,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 02:40:20,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 02:40:20,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:20,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:20,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:20,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991119130] [2025-01-10 02:40:20,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991119130] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:20,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927334487] [2025-01-10 02:40:20,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:20,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:20,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:20,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:20,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 02:40:21,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 02:40:21,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 02:40:21,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:21,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:21,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:21,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:21,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:21,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927334487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:21,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:21,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:40:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688496653] [2025-01-10 02:40:21,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:21,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:40:21,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:21,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:40:21,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:21,907 INFO L87 Difference]: Start difference. First operand 1442 states and 1868 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:22,023 INFO L93 Difference]: Finished difference Result 1446 states and 1872 transitions. [2025-01-10 02:40:22,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:40:22,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-01-10 02:40:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:22,031 INFO L225 Difference]: With dead ends: 1446 [2025-01-10 02:40:22,031 INFO L226 Difference]: Without dead ends: 1445 [2025-01-10 02:40:22,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:22,033 INFO L435 NwaCegarLoop]: 1707 mSDtfsCounter, 5 mSDsluCounter, 3399 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5106 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:22,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5106 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:40:22,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-01-10 02:40:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1441. [2025-01-10 02:40:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1049 states have (on average 1.5157292659675883) internal successors, (1590), 1267 states have internal predecessors, (1590), 137 states have call successors, (137), 46 states have call predecessors, (137), 46 states have return successors, (137), 132 states have call predecessors, (137), 137 states have call successors, (137) [2025-01-10 02:40:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 1864 transitions. [2025-01-10 02:40:22,076 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 1864 transitions. Word has length 29 [2025-01-10 02:40:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:22,078 INFO L471 AbstractCegarLoop]: Abstraction has 1441 states and 1864 transitions. [2025-01-10 02:40:22,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1864 transitions. [2025-01-10 02:40:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 02:40:22,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:22,079 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:40:22,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 02:40:22,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:22,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:40:22,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:22,280 INFO L85 PathProgramCache]: Analyzing trace with hash 88370338, now seen corresponding path program 1 times [2025-01-10 02:40:22,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:22,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850315025] [2025-01-10 02:40:22,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:22,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:22,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:40:22,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:40:22,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:22,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:22,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:22,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850315025] [2025-01-10 02:40:22,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850315025] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:22,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157543209] [2025-01-10 02:40:22,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:22,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:22,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:22,922 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:22,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 02:40:23,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:40:23,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:40:23,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:23,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:23,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1345 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:23,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:23,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:40:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:23,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157543209] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:40:23,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:40:23,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:40:23,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754406953] [2025-01-10 02:40:23,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:40:23,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:40:23,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:23,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:40:23,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:23,972 INFO L87 Difference]: Start difference. First operand 1441 states and 1864 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:24,145 INFO L93 Difference]: Finished difference Result 1530 states and 1988 transitions. [2025-01-10 02:40:24,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:40:24,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-01-10 02:40:24,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:24,152 INFO L225 Difference]: With dead ends: 1530 [2025-01-10 02:40:24,152 INFO L226 Difference]: Without dead ends: 1529 [2025-01-10 02:40:24,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:24,153 INFO L435 NwaCegarLoop]: 1705 mSDtfsCounter, 12 mSDsluCounter, 5106 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6811 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:24,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6811 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:40:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2025-01-10 02:40:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1513. [2025-01-10 02:40:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1121 states have (on average 1.504014272970562) internal successors, (1686), 1339 states have internal predecessors, (1686), 137 states have call successors, (137), 46 states have call predecessors, (137), 46 states have return successors, (137), 132 states have call predecessors, (137), 137 states have call successors, (137) [2025-01-10 02:40:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1960 transitions. [2025-01-10 02:40:24,189 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1960 transitions. Word has length 30 [2025-01-10 02:40:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:24,189 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1960 transitions. [2025-01-10 02:40:24,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1960 transitions. [2025-01-10 02:40:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 02:40:24,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:24,192 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:40:24,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:40:24,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:24,393 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:40:24,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:24,394 INFO L85 PathProgramCache]: Analyzing trace with hash 247514066, now seen corresponding path program 1 times [2025-01-10 02:40:24,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:24,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375244231] [2025-01-10 02:40:24,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:24,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:24,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 02:40:24,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 02:40:24,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:24,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:25,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:25,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375244231] [2025-01-10 02:40:25,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375244231] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:25,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796670108] [2025-01-10 02:40:25,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:25,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:25,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:25,003 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:25,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 02:40:25,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 02:40:25,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 02:40:25,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:25,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:25,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:25,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:25,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:40:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:26,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796670108] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:40:26,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:40:26,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:40:26,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315418703] [2025-01-10 02:40:26,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:40:26,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:40:26,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:26,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:40:26,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:26,107 INFO L87 Difference]: Start difference. First operand 1513 states and 1960 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:26,473 INFO L93 Difference]: Finished difference Result 3278 states and 4275 transitions. [2025-01-10 02:40:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:40:26,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-01-10 02:40:26,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:26,502 INFO L225 Difference]: With dead ends: 3278 [2025-01-10 02:40:26,503 INFO L226 Difference]: Without dead ends: 1781 [2025-01-10 02:40:26,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:26,506 INFO L435 NwaCegarLoop]: 1696 mSDtfsCounter, 87 mSDsluCounter, 6772 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 8468 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:26,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 8468 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:40:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-01-10 02:40:26,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1767. [2025-01-10 02:40:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1369 states have (on average 1.4784514243973703) internal successors, (2024), 1587 states have internal predecessors, (2024), 143 states have call successors, (143), 46 states have call predecessors, (143), 46 states have return successors, (143), 138 states have call predecessors, (143), 143 states have call successors, (143) [2025-01-10 02:40:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2310 transitions. [2025-01-10 02:40:26,542 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2310 transitions. Word has length 32 [2025-01-10 02:40:26,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:26,542 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2310 transitions. [2025-01-10 02:40:26,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:26,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2310 transitions. [2025-01-10 02:40:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 02:40:26,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:26,544 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:40:26,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:40:26,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 02:40:26,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:40:26,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1137261652, now seen corresponding path program 1 times [2025-01-10 02:40:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:26,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511510296] [2025-01-10 02:40:26,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:27,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 02:40:27,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 02:40:27,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:27,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 02:40:27,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:27,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511510296] [2025-01-10 02:40:27,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511510296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:27,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:40:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667611977] [2025-01-10 02:40:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:27,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:27,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:27,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:27,253 INFO L87 Difference]: Start difference. First operand 1767 states and 2310 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:40:31,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:40:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:31,358 INFO L93 Difference]: Finished difference Result 3765 states and 4945 transitions. [2025-01-10 02:40:31,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:31,358 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2025-01-10 02:40:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:31,366 INFO L225 Difference]: With dead ends: 3765 [2025-01-10 02:40:31,366 INFO L226 Difference]: Without dead ends: 2014 [2025-01-10 02:40:31,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:31,371 INFO L435 NwaCegarLoop]: 1774 mSDtfsCounter, 80 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 3460 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:31,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 3460 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-10 02:40:31,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2025-01-10 02:40:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2012. [2025-01-10 02:40:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 1608 states have (on average 1.4620646766169154) internal successors, (2351), 1826 states have internal predecessors, (2351), 148 states have call successors, (148), 47 states have call predecessors, (148), 47 states have return successors, (148), 143 states have call predecessors, (148), 148 states have call successors, (148) [2025-01-10 02:40:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2647 transitions. [2025-01-10 02:40:31,402 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2647 transitions. Word has length 47 [2025-01-10 02:40:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:31,403 INFO L471 AbstractCegarLoop]: Abstraction has 2012 states and 2647 transitions. [2025-01-10 02:40:31,403 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:40:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2647 transitions. [2025-01-10 02:40:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 02:40:31,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:31,404 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:40:31,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:40:31,405 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:40:31,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash -882009024, now seen corresponding path program 1 times [2025-01-10 02:40:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:31,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281690274] [2025-01-10 02:40:31,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:31,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:31,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 02:40:31,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 02:40:31,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:31,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:40:31,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:31,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281690274] [2025-01-10 02:40:31,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281690274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:31,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:31,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:40:31,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933424265] [2025-01-10 02:40:31,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:31,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:31,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:31,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:31,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:31,879 INFO L87 Difference]: Start difference. First operand 2012 states and 2647 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:40:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:31,944 INFO L93 Difference]: Finished difference Result 2513 states and 3327 transitions. [2025-01-10 02:40:31,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:31,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2025-01-10 02:40:31,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:31,952 INFO L225 Difference]: With dead ends: 2513 [2025-01-10 02:40:31,952 INFO L226 Difference]: Without dead ends: 2511 [2025-01-10 02:40:31,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:31,953 INFO L435 NwaCegarLoop]: 1708 mSDtfsCounter, 65 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 3404 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:31,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 3404 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:31,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2025-01-10 02:40:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2509. [2025-01-10 02:40:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 2089 states have (on average 1.4384873145045476) internal successors, (3005), 2307 states have internal predecessors, (3005), 160 states have call successors, (160), 51 states have call predecessors, (160), 51 states have return successors, (160), 155 states have call predecessors, (160), 160 states have call successors, (160) [2025-01-10 02:40:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3325 transitions. [2025-01-10 02:40:31,990 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3325 transitions. Word has length 48 [2025-01-10 02:40:31,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:31,990 INFO L471 AbstractCegarLoop]: Abstraction has 2509 states and 3325 transitions. [2025-01-10 02:40:31,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:40:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3325 transitions. [2025-01-10 02:40:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 02:40:31,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:31,991 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:31,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:40:31,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:40:31,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:31,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1754881248, now seen corresponding path program 2 times [2025-01-10 02:40:31,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:31,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522821747] [2025-01-10 02:40:31,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:40:31,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:32,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-10 02:40:32,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 48 statements. [2025-01-10 02:40:32,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:40:32,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:40:36,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:36,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522821747] [2025-01-10 02:40:36,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522821747] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:36,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671300327] [2025-01-10 02:40:36,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:40:36,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:36,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:36,975 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:36,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 02:40:37,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-10 02:40:37,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 48 statements. [2025-01-10 02:40:37,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:40:37,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:37,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:40:37,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 02:40:38,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:38,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671300327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:38,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:38,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2025-01-10 02:40:38,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766813590] [2025-01-10 02:40:38,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:38,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:40:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:38,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:40:38,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:38,447 INFO L87 Difference]: Start difference. First operand 2509 states and 3325 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:42,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:40:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:43,711 INFO L93 Difference]: Finished difference Result 3968 states and 5205 transitions. [2025-01-10 02:40:43,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:40:43,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-01-10 02:40:43,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:43,716 INFO L225 Difference]: With dead ends: 3968 [2025-01-10 02:40:43,716 INFO L226 Difference]: Without dead ends: 1475 [2025-01-10 02:40:43,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:43,720 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1678 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:43,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 3094 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-01-10 02:40:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2025-01-10 02:40:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1475. [2025-01-10 02:40:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1086 states have (on average 1.4935543278084715) internal successors, (1622), 1302 states have internal predecessors, (1622), 135 states have call successors, (135), 47 states have call predecessors, (135), 47 states have return successors, (135), 130 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-10 02:40:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1892 transitions. [2025-01-10 02:40:43,743 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1892 transitions. Word has length 48 [2025-01-10 02:40:43,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:43,743 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 1892 transitions. [2025-01-10 02:40:43,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1892 transitions. [2025-01-10 02:40:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 02:40:43,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:43,744 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-01-10 02:40:43,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 02:40:43,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 02:40:43,945 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:40:43,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1518410992, now seen corresponding path program 1 times [2025-01-10 02:40:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:43,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133985809] [2025-01-10 02:40:43,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:43,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:44,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 02:40:44,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 02:40:44,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:44,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:40:44,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:44,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133985809] [2025-01-10 02:40:44,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133985809] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:44,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186523845] [2025-01-10 02:40:44,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:44,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:44,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:44,463 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:44,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 02:40:45,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 02:40:45,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 02:40:45,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:45,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:45,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 1471 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:40:45,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 02:40:45,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:40:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 02:40:45,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186523845] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:40:45,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:40:45,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-01-10 02:40:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113652985] [2025-01-10 02:40:45,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:40:45,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:40:45,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:45,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:40:45,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:40:45,625 INFO L87 Difference]: Start difference. First operand 1475 states and 1892 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:40:49,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:40:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:51,434 INFO L93 Difference]: Finished difference Result 4434 states and 5698 transitions. [2025-01-10 02:40:51,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 02:40:51,434 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 58 [2025-01-10 02:40:51,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:51,444 INFO L225 Difference]: With dead ends: 4434 [2025-01-10 02:40:51,444 INFO L226 Difference]: Without dead ends: 2975 [2025-01-10 02:40:51,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:40:51,448 INFO L435 NwaCegarLoop]: 1730 mSDtfsCounter, 1744 mSDsluCounter, 6516 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 8246 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:51,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1744 Valid, 8246 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2025-01-10 02:40:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2025-01-10 02:40:51,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2771. [2025-01-10 02:40:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2771 states, 2208 states have (on average 1.4741847826086956) internal successors, (3255), 2434 states have internal predecessors, (3255), 266 states have call successors, (266), 90 states have call predecessors, (266), 90 states have return successors, (266), 256 states have call predecessors, (266), 266 states have call successors, (266) [2025-01-10 02:40:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 3787 transitions. [2025-01-10 02:40:51,520 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 3787 transitions. Word has length 58 [2025-01-10 02:40:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:51,520 INFO L471 AbstractCegarLoop]: Abstraction has 2771 states and 3787 transitions. [2025-01-10 02:40:51,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:40:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3787 transitions. [2025-01-10 02:40:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-10 02:40:51,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:51,521 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:51,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 02:40:51,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 02:40:51,722 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:40:51,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:51,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1064563925, now seen corresponding path program 1 times [2025-01-10 02:40:51,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:51,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759380487] [2025-01-10 02:40:51,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:51,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:52,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 02:40:52,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 02:40:52,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:52,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-10 02:40:52,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:52,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759380487] [2025-01-10 02:40:52,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759380487] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:52,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961453567] [2025-01-10 02:40:52,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:52,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:52,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:52,331 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:52,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 02:40:53,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 02:40:53,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 02:40:53,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:53,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:53,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 1540 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:40:53,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 02:40:53,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:40:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 66 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 02:40:53,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961453567] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:40:53,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:40:53,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 9, 9] total 18 [2025-01-10 02:40:53,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937341108] [2025-01-10 02:40:53,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:40:53,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 02:40:53,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:53,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 02:40:53,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2025-01-10 02:40:53,912 INFO L87 Difference]: Start difference. First operand 2771 states and 3787 transitions. Second operand has 18 states, 18 states have (on average 7.444444444444445) internal successors, (134), 18 states have internal predecessors, (134), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:40:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:55,914 INFO L93 Difference]: Finished difference Result 7401 states and 9940 transitions. [2025-01-10 02:40:55,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-10 02:40:55,915 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.444444444444445) internal successors, (134), 18 states have internal predecessors, (134), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 75 [2025-01-10 02:40:55,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:55,929 INFO L225 Difference]: With dead ends: 7401 [2025-01-10 02:40:55,929 INFO L226 Difference]: Without dead ends: 4646 [2025-01-10 02:40:55,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=720, Invalid=1350, Unknown=0, NotChecked=0, Total=2070 [2025-01-10 02:40:55,935 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1774 mSDsluCounter, 11430 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1774 SdHoareTripleChecker+Valid, 13105 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:55,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1774 Valid, 13105 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 02:40:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2025-01-10 02:40:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 4443. [2025-01-10 02:40:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4443 states, 3702 states have (on average 1.4243652079956781) internal successors, (5273), 3938 states have internal predecessors, (5273), 399 states have call successors, (399), 135 states have call predecessors, (399), 135 states have return successors, (399), 384 states have call predecessors, (399), 399 states have call successors, (399) [2025-01-10 02:40:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4443 states to 4443 states and 6071 transitions. [2025-01-10 02:40:56,009 INFO L78 Accepts]: Start accepts. Automaton has 4443 states and 6071 transitions. Word has length 75 [2025-01-10 02:40:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:56,010 INFO L471 AbstractCegarLoop]: Abstraction has 4443 states and 6071 transitions. [2025-01-10 02:40:56,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.444444444444445) internal successors, (134), 18 states have internal predecessors, (134), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:40:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4443 states and 6071 transitions. [2025-01-10 02:40:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-10 02:40:56,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:56,012 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 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] [2025-01-10 02:40:56,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 02:40:56,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:56,212 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting analog_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:40:56,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:56,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1467638956, now seen corresponding path program 1 times [2025-01-10 02:40:56,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:56,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366702544] [2025-01-10 02:40:56,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:56,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:56,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-10 02:40:56,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-10 02:40:56,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:56,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-01-10 02:40:56,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:56,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366702544] [2025-01-10 02:40:56,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366702544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:56,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:56,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:40:56,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722669743] [2025-01-10 02:40:56,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:56,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:56,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:56,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:56,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:56,751 INFO L87 Difference]: Start difference. First operand 4443 states and 6071 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:41:00,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:41:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:41:00,895 INFO L93 Difference]: Finished difference Result 9108 states and 12411 transitions. [2025-01-10 02:41:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:41:00,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 119 [2025-01-10 02:41:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:41:00,916 INFO L225 Difference]: With dead ends: 9108 [2025-01-10 02:41:00,918 INFO L226 Difference]: Without dead ends: 4860 [2025-01-10 02:41:00,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:41:00,927 INFO L435 NwaCegarLoop]: 1776 mSDtfsCounter, 1642 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:41:00,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1642 Valid, 1899 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-10 02:41:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2025-01-10 02:41:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 4854. [2025-01-10 02:41:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4854 states, 4062 states have (on average 1.4022648941408173) internal successors, (5696), 4298 states have internal predecessors, (5696), 423 states have call successors, (423), 162 states have call predecessors, (423), 162 states have return successors, (423), 408 states have call predecessors, (423), 423 states have call successors, (423) [2025-01-10 02:41:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4854 states to 4854 states and 6542 transitions. [2025-01-10 02:41:01,015 INFO L78 Accepts]: Start accepts. Automaton has 4854 states and 6542 transitions. Word has length 119 [2025-01-10 02:41:01,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:41:01,015 INFO L471 AbstractCegarLoop]: Abstraction has 4854 states and 6542 transitions. [2025-01-10 02:41:01,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:41:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4854 states and 6542 transitions. [2025-01-10 02:41:01,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-10 02:41:01,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:41:01,019 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:41:01,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 02:41:01,020 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:41:01,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:41:01,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2086637709, now seen corresponding path program 1 times [2025-01-10 02:41:01,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:41:01,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854236697] [2025-01-10 02:41:01,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:41:01,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:41:01,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-10 02:41:01,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-10 02:41:01,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:41:01,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:41:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-10 02:41:01,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:41:01,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854236697] [2025-01-10 02:41:01,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854236697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:41:01,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:41:01,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:41:01,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665812921] [2025-01-10 02:41:01,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:41:01,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:41:01,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:41:01,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:41:01,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:41:01,546 INFO L87 Difference]: Start difference. First operand 4854 states and 6542 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:41:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:41:01,670 INFO L93 Difference]: Finished difference Result 4957 states and 6660 transitions. [2025-01-10 02:41:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:41:01,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 117 [2025-01-10 02:41:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:41:01,689 INFO L225 Difference]: With dead ends: 4957 [2025-01-10 02:41:01,689 INFO L226 Difference]: Without dead ends: 4955 [2025-01-10 02:41:01,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:41:01,693 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1731 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:41:01,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 1733 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:41:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2025-01-10 02:41:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 3300. [2025-01-10 02:41:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 2705 states have (on average 1.401478743068392) internal successors, (3791), 2929 states have internal predecessors, (3791), 282 states have call successors, (282), 108 states have call predecessors, (282), 108 states have return successors, (282), 272 states have call predecessors, (282), 282 states have call successors, (282) [2025-01-10 02:41:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4355 transitions. [2025-01-10 02:41:01,762 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4355 transitions. Word has length 117 [2025-01-10 02:41:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:41:01,762 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 4355 transitions. [2025-01-10 02:41:01,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:41:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4355 transitions. [2025-01-10 02:41:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-10 02:41:01,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:41:01,764 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 5, 4, 4, 4, 4, 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] [2025-01-10 02:41:01,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 02:41:01,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:41:01,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:41:01,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1835218982, now seen corresponding path program 1 times [2025-01-10 02:41:01,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:41:01,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403890320] [2025-01-10 02:41:01,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:41:01,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:41:02,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-10 02:41:02,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-10 02:41:02,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:41:02,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:41:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-01-10 02:41:02,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:41:02,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403890320] [2025-01-10 02:41:02,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403890320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:41:02,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:41:02,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:41:02,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117212070] [2025-01-10 02:41:02,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:41:02,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:41:02,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:41:02,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:41:02,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:41:02,310 INFO L87 Difference]: Start difference. First operand 3300 states and 4355 transitions. Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:41:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:41:02,392 INFO L93 Difference]: Finished difference Result 3300 states and 4355 transitions. [2025-01-10 02:41:02,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:41:02,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 128 [2025-01-10 02:41:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:41:02,401 INFO L225 Difference]: With dead ends: 3300 [2025-01-10 02:41:02,401 INFO L226 Difference]: Without dead ends: 3299 [2025-01-10 02:41:02,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:41:02,403 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1670 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:41:02,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 1677 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:41:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2025-01-10 02:41:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 3299. [2025-01-10 02:41:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3299 states, 2705 states have (on average 1.4011090573012939) internal successors, (3790), 2928 states have internal predecessors, (3790), 282 states have call successors, (282), 108 states have call predecessors, (282), 108 states have return successors, (282), 272 states have call predecessors, (282), 282 states have call successors, (282) [2025-01-10 02:41:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 4354 transitions. [2025-01-10 02:41:02,472 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 4354 transitions. Word has length 128 [2025-01-10 02:41:02,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:41:02,473 INFO L471 AbstractCegarLoop]: Abstraction has 3299 states and 4354 transitions. [2025-01-10 02:41:02,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:41:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 4354 transitions. [2025-01-10 02:41:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-10 02:41:02,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:41:02,474 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:41:02,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 02:41:02,474 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting analog_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:41:02,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:41:02,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1687276780, now seen corresponding path program 1 times [2025-01-10 02:41:02,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:41:02,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222275261] [2025-01-10 02:41:02,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:41:02,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:41:02,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-10 02:41:02,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-10 02:41:02,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:41:02,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:41:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-01-10 02:41:02,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:41:02,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222275261] [2025-01-10 02:41:02,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222275261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:41:02,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:41:02,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:41:02,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772066993] [2025-01-10 02:41:02,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:41:02,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:41:02,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:41:02,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:41:02,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:41:02,992 INFO L87 Difference]: Start difference. First operand 3299 states and 4354 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:41:07,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:41:07,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:41:07,186 INFO L93 Difference]: Finished difference Result 9081 states and 12134 transitions. [2025-01-10 02:41:07,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:41:07,187 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 135 [2025-01-10 02:41:07,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:41:07,198 INFO L225 Difference]: With dead ends: 9081 [2025-01-10 02:41:07,198 INFO L226 Difference]: Without dead ends: 5977 [2025-01-10 02:41:07,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:41:07,205 INFO L435 NwaCegarLoop]: 3350 mSDtfsCounter, 1670 mSDsluCounter, 5021 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 8371 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:41:07,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 8371 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-10 02:41:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5977 states. [2025-01-10 02:41:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5977 to 3303. [2025-01-10 02:41:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 2709 states have (on average 1.400516795865633) internal successors, (3794), 2932 states have internal predecessors, (3794), 282 states have call successors, (282), 108 states have call predecessors, (282), 108 states have return successors, (282), 272 states have call predecessors, (282), 282 states have call successors, (282) [2025-01-10 02:41:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 4358 transitions. [2025-01-10 02:41:07,281 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 4358 transitions. Word has length 135 [2025-01-10 02:41:07,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:41:07,282 INFO L471 AbstractCegarLoop]: Abstraction has 3303 states and 4358 transitions. [2025-01-10 02:41:07,282 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:41:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4358 transitions. [2025-01-10 02:41:07,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-10 02:41:07,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:41:07,283 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:41:07,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 02:41:07,283 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:41:07,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:41:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1607358620, now seen corresponding path program 1 times [2025-01-10 02:41:07,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:41:07,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655255218] [2025-01-10 02:41:07,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:41:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:41:07,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-10 02:41:07,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-10 02:41:07,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:41:07,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:41:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-01-10 02:41:07,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:41:07,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655255218] [2025-01-10 02:41:07,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655255218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:41:07,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:41:07,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:41:07,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218301330] [2025-01-10 02:41:07,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:41:07,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:41:07,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:41:07,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:41:07,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:41:07,890 INFO L87 Difference]: Start difference. First operand 3303 states and 4358 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:41:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:41:08,108 INFO L93 Difference]: Finished difference Result 6549 states and 8721 transitions. [2025-01-10 02:41:08,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:41:08,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 137 [2025-01-10 02:41:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:41:08,118 INFO L225 Difference]: With dead ends: 6549 [2025-01-10 02:41:08,118 INFO L226 Difference]: Without dead ends: 3441 [2025-01-10 02:41:08,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:41:08,124 INFO L435 NwaCegarLoop]: 1680 mSDtfsCounter, 66 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 3337 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:41:08,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 3337 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:41:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2025-01-10 02:41:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3355. [2025-01-10 02:41:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 2755 states have (on average 1.3989110707803993) internal successors, (3854), 2978 states have internal predecessors, (3854), 288 states have call successors, (288), 108 states have call predecessors, (288), 108 states have return successors, (288), 278 states have call predecessors, (288), 288 states have call successors, (288) [2025-01-10 02:41:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 4430 transitions. [2025-01-10 02:41:08,240 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 4430 transitions. Word has length 137 [2025-01-10 02:41:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:41:08,242 INFO L471 AbstractCegarLoop]: Abstraction has 3355 states and 4430 transitions. [2025-01-10 02:41:08,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:41:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 4430 transitions. [2025-01-10 02:41:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-10 02:41:08,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:41:08,244 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:41:08,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 02:41:08,244 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:41:08,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:41:08,245 INFO L85 PathProgramCache]: Analyzing trace with hash 233405094, now seen corresponding path program 1 times [2025-01-10 02:41:08,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:41:08,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492780090] [2025-01-10 02:41:08,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:41:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:41:08,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-10 02:41:08,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-10 02:41:08,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:41:08,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:41:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 10 proven. 378 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-01-10 02:41:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:41:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492780090] [2025-01-10 02:41:09,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492780090] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:41:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137856385] [2025-01-10 02:41:09,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:41:09,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:41:09,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:41:09,321 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:41:09,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 02:41:10,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-10 02:41:10,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-10 02:41:10,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:41:10,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:41:10,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 1761 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 02:41:10,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:41:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 14 proven. 378 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-10 02:41:10,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:41:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 10 proven. 378 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-01-10 02:41:11,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137856385] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:41:11,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:41:11,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 19 [2025-01-10 02:41:11,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008729428] [2025-01-10 02:41:11,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:41:11,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 02:41:11,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:41:11,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 02:41:11,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:41:11,362 INFO L87 Difference]: Start difference. First operand 3355 states and 4430 transitions. Second operand has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:41:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:41:11,676 INFO L93 Difference]: Finished difference Result 6774 states and 8943 transitions. [2025-01-10 02:41:11,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 02:41:11,677 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 139 [2025-01-10 02:41:11,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:41:11,685 INFO L225 Difference]: With dead ends: 6774 [2025-01-10 02:41:11,685 INFO L226 Difference]: Without dead ends: 3435 [2025-01-10 02:41:11,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 262 SyntacticMatches, 14 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:41:11,691 INFO L435 NwaCegarLoop]: 1678 mSDtfsCounter, 3 mSDsluCounter, 8375 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10053 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:41:11,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 10053 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:41:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2025-01-10 02:41:11,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2025-01-10 02:41:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3435 states, 2835 states have (on average 1.3876543209876544) internal successors, (3934), 3058 states have internal predecessors, (3934), 288 states have call successors, (288), 108 states have call predecessors, (288), 108 states have return successors, (288), 278 states have call predecessors, (288), 288 states have call successors, (288) [2025-01-10 02:41:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4510 transitions. [2025-01-10 02:41:11,755 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4510 transitions. Word has length 139 [2025-01-10 02:41:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:41:11,756 INFO L471 AbstractCegarLoop]: Abstraction has 3435 states and 4510 transitions. [2025-01-10 02:41:11,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:41:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4510 transitions. [2025-01-10 02:41:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-10 02:41:11,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:41:11,757 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:41:11,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 02:41:11,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:41:11,958 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-01-10 02:41:11,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:41:11,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1314438502, now seen corresponding path program 2 times [2025-01-10 02:41:11,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:41:11,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138251466] [2025-01-10 02:41:11,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:41:11,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:41:12,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-01-10 02:41:12,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 147 of 147 statements. [2025-01-10 02:41:12,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:41:12,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:41:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 18 proven. 48 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2025-01-10 02:41:12,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:41:12,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138251466] [2025-01-10 02:41:12,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138251466] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:41:12,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532451344] [2025-01-10 02:41:12,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:41:12,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:41:12,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:41:12,593 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:41:12,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 02:41:13,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes.