./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-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/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! 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-?-e2fb8be-m [2025-03-09 02:48:59,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:48:59,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 02:48:59,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:48:59,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:48:59,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:48:59,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:48:59,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:48:59,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:48:59,574 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:48:59,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:48:59,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:48:59,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:48:59,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:48:59,575 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:48:59,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:48:59,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:48:59,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:48:59,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:48:59,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:48:59,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:48:59,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:48:59,575 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:48:59,575 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:48:59,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:48:59,576 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:48:59,576 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:48:59,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:48:59,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:48:59,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:48:59,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:48:59,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:59,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:48:59,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:48:59,576 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:48:59,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:48:59,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:48:59,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:48:59,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:48:59,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:48:59,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:48:59,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:48:59,577 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-03-09 02:48:59,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:48:59,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:48:59,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:48:59,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:48:59,854 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:48:59,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/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-03-09 02:49:00,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/614e7cb73/983b73382d38464994d0a6af334888e4/FLAG65a27b2fe [2025-03-09 02:49:02,132 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:49:02,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/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-03-09 02:49:02,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/614e7cb73/983b73382d38464994d0a6af334888e4/FLAG65a27b2fe [2025-03-09 02:49:02,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/614e7cb73/983b73382d38464994d0a6af334888e4 [2025-03-09 02:49:02,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:49:02,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:49:02,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:49:02,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:49:02,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:49:02,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:49:02" (1/1) ... [2025-03-09 02:49:02,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41cc7110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:02, skipping insertion in model container [2025-03-09 02:49:02,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:49:02" (1/1) ... [2025-03-09 02:49:02,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:49:02,498 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [2550] [2025-03-09 02:49:02,499 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-03-09 02:49:02,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:49:02,876 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:49:02,932 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [2550] [2025-03-09 02:49:02,933 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-03-09 02:49:02,935 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-03-09 02:49:02,937 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-03-09 02:49:02,941 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-03-09 02:49:02,942 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-03-09 02:49:02,944 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-03-09 02:49:02,945 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-03-09 02:49:02,946 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-03-09 02:49:02,951 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-03-09 02:49:02,952 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-03-09 02:49:02,952 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-03-09 02:49:02,953 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("outb %b0, %w1": : "a" (value), "Nd" (port)); [2810] [2025-03-09 02:49:02,953 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1, %b0": "=a" (value): "Nd" (port)); [2818] [2025-03-09 02:49:03,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:49:03,106 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:49:03,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:03 WrapperNode [2025-03-09 02:49:03,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:49:03,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:49:03,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:49:03,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:49:03,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:03" (1/1) ... [2025-03-09 02:49:03,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:03" (1/1) ... [2025-03-09 02:49:03,262 INFO L138 Inliner]: procedures = 120, calls = 710, calls flagged for inlining = 41, calls inlined = 39, statements flattened = 2504 [2025-03-09 02:49:03,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:49:03,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:49:03,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:49:03,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:49:03,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:03" (1/1) ... [2025-03-09 02:49:03,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:03" (1/1) ... [2025-03-09 02:49:03,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:03" (1/1) ... [2025-03-09 02:49:03,402 INFO L175 MemorySlicer]: Split 482 memory accesses to 19 slices as follows [2, 28, 22, 1, 3, 1, 252, 2, 18, 7, 21, 23, 6, 3, 9, 9, 5, 51, 19]. 52 percent of accesses are in the largest equivalence class. The 134 initializations are split as follows [2, 0, 0, 0, 0, 0, 7, 0, 18, 7, 16, 16, 4, 0, 6, 4, 3, 51, 0]. The 145 writes are split as follows [0, 24, 22, 0, 0, 0, 75, 1, 0, 0, 0, 5, 0, 1, 0, 0, 0, 0, 17]. [2025-03-09 02:49:03,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:03" (1/1) ... [2025-03-09 02:49:03,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:03" (1/1) ... [2025-03-09 02:49:03,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:03" (1/1) ... [2025-03-09 02:49:03,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:03" (1/1) ... [2025-03-09 02:49:03,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:03" (1/1) ... [2025-03-09 02:49:03,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:03" (1/1) ... [2025-03-09 02:49:03,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:49:03,528 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:49:03,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:49:03,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:49:03,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:03" (1/1) ... [2025-03-09 02:49:03,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:49:03,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:03,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:49:03,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:49:03,590 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_trigger [2025-03-09 02:49:03,590 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_trigger [2025-03-09 02:49:03,590 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-03-09 02:49:03,590 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-03-09 02:49:03,590 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_disable [2025-03-09 02:49:03,591 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_disable [2025-03-09 02:49:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-09 02:49:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-09 02:49:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-09 02:49:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-09 02:49:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-09 02:49:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-09 02:49:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-09 02:49:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-09 02:49:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2025-03-09 02:49:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight16 [2025-03-09 02:49:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight16 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-09 02:49:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-09 02:49:03,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_get_drvdata [2025-03-09 02:49:03,594 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_get_drvdata [2025-03-09 02:49:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_read [2025-03-09 02:49:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_read [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-09 02:49:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2025-03-09 02:49:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_open [2025-03-09 02:49:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_open [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure trace_hardirqs_on [2025-03-09 02:49:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_hardirqs_on [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-09 02:49:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-09 02:49:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-09 02:49:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-09 02:49:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-09 02:49:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-09 02:49:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-09 02:49:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-09 02:49:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-09 02:49:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-09 02:49:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_restore [2025-03-09 02:49:03,599 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_restore [2025-03-09 02:49:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight32 [2025-03-09 02:49:03,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight32 [2025-03-09 02:49:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2025-03-09 02:49:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2025-03-09 02:49:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-09 02:49:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-09 02:49:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-09 02:49:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-09 02:49:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 02:49:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 02:49:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 02:49:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_save [2025-03-09 02:49:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_save [2025-03-09 02:49:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:49:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure analog_poll [2025-03-09 02:49:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_poll [2025-03-09 02:49:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2025-03-09 02:49:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2025-03-09 02:49:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:49:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 02:49:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2025-03-09 02:49:03,601 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2025-03-09 02:49:03,601 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-09 02:49:03,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-09 02:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure trace_hardirqs_off [2025-03-09 02:49:03,602 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_hardirqs_off [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_set_drvdata [2025-03-09 02:49:03,602 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_set_drvdata [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure analog_decode [2025-03-09 02:49:03,602 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_decode [2025-03-09 02:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure arch_irqs_disabled_flags [2025-03-09 02:49:03,602 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_irqs_disabled_flags [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight8 [2025-03-09 02:49:03,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight8 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure analog_button_read [2025-03-09 02:49:03,603 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_button_read [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-03-09 02:49:03,603 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2025-03-09 02:49:03,603 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2025-03-09 02:49:03,603 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_close [2025-03-09 02:49:03,603 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_close [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_time [2025-03-09 02:49:03,603 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_time [2025-03-09 02:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-09 02:49:03,604 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure analog_disconnect [2025-03-09 02:49:03,604 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_disconnect [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-09 02:49:03,604 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-09 02:49:03,604 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-09 02:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-09 02:49:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-09 02:49:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-09 02:49:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-09 02:49:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-09 02:49:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-09 02:49:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-09 02:49:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-09 02:49:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_cooked_read [2025-03-09 02:49:03,605 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_cooked_read [2025-03-09 02:49:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2025-03-09 02:49:03,605 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2025-03-09 02:49:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure paravirt_read_tsc [2025-03-09 02:49:03,606 INFO L138 BoogieDeclarations]: Found implementation of procedure paravirt_read_tsc [2025-03-09 02:49:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-09 02:49:03,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-09 02:49:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:49:03,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:49:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure analog_cooked_read [2025-03-09 02:49:03,607 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_cooked_read [2025-03-09 02:49:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2025-03-09 02:49:03,607 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2025-03-09 02:49:03,966 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:49:03,969 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:49:04,033 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-09 02:49:04,036 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4393: havoc #t~nondet473; [2025-03-09 02:49:04,044 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4333: havoc #t~nondet465; [2025-03-09 02:49:04,515 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2802: havoc #t~bitwise25; [2025-03-09 02:49:04,606 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4385: havoc #t~nondet471; [2025-03-09 02:49:04,653 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923: havoc #t~mem38.base, #t~mem38.offset; [2025-03-09 02:49:04,800 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3054: havoc #t~mem89; [2025-03-09 02:49:10,037 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3817: havoc analog_init_masks_#t~mem383#1;havoc analog_init_masks_#t~mem384#1;havoc analog_init_masks_#t~short385#1;call ULTIMATE.dealloc(analog_init_masks_~#max~0#1.base, analog_init_masks_~#max~0#1.offset);havoc analog_init_masks_~#max~0#1.base, analog_init_masks_~#max~0#1.offset; [2025-03-09 02:49:10,037 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4352: havoc input_register_device_#t~nondet466#1; [2025-03-09 02:49:10,037 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4365: havoc ldv_bind_1_#t~nondet468#1; [2025-03-09 02:49:10,037 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4375: havoc ldv_release_1_#t~nondet469#1; [2025-03-09 02:49:10,037 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4048: call ULTIMATE.dealloc(analog_parse_options_~#end~0#1.base, analog_parse_options_~#end~0#1.offset);havoc analog_parse_options_~#end~0#1.base, analog_parse_options_~#end~0#1.offset; [2025-03-09 02:49:10,037 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2934: havoc input_allocate_device_#t~ret39#1.base, input_allocate_device_#t~ret39#1.offset; [2025-03-09 02:49:10,037 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4323: havoc __gameport_register_driver_#t~nondet464#1; [2025-03-09 02:49:10,037 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4389: havoc simple_strtoul_#t~nondet472#1; [2025-03-09 02:49:10,445 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3307: havoc #t~mem164;call ULTIMATE.dealloc(~#time~0.base, ~#time~0.offset);havoc ~#time~0.base, ~#time~0.offset;call ULTIMATE.dealloc(~#data~0.base, ~#data~0.offset);havoc ~#data~0.base, ~#data~0.offset; [2025-03-09 02:49:10,658 INFO L? ?]: Removed 1065 outVars from TransFormulas that were not future-live. [2025-03-09 02:49:10,659 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:49:10,723 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:49:10,724 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:49:10,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:49:10 BoogieIcfgContainer [2025-03-09 02:49:10,724 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:49:10,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:49:10,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:49:10,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:49:10,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:49:02" (1/3) ... [2025-03-09 02:49:10,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acaa8ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:49:10, skipping insertion in model container [2025-03-09 02:49:10,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:49:03" (2/3) ... [2025-03-09 02:49:10,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acaa8ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:49:10, skipping insertion in model container [2025-03-09 02:49:10,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:49:10" (3/3) ... [2025-03-09 02:49:10,731 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-03-09 02:49:10,741 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:49:10,744 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, 1381 locations, 1 initial locations, 3 loop locations, and 235 error locations. [2025-03-09 02:49:10,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:49:10,808 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;@125cf276, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:49:10,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 235 error locations. [2025-03-09 02:49:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 1380 states, 962 states have (on average 1.5717255717255718) internal successors, (1512), 1213 states have internal predecessors, (1512), 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-03-09 02:49:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 02:49:10,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:10,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:10,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:49:10,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:10,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1419073790, now seen corresponding path program 1 times [2025-03-09 02:49:10,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:10,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030587022] [2025-03-09 02:49:10,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:10,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:11,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:49:11,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:49:11,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:11,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:11,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:11,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030587022] [2025-03-09 02:49:11,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030587022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:11,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:11,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:49:11,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785465066] [2025-03-09 02:49:11,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:11,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:11,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:11,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:11,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:11,780 INFO L87 Difference]: Start difference. First operand has 1380 states, 962 states have (on average 1.5717255717255718) internal successors, (1512), 1213 states have internal predecessors, (1512), 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-03-09 02:49:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:12,530 INFO L93 Difference]: Finished difference Result 2799 states and 3665 transitions. [2025-03-09 02:49:12,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:12,532 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-03-09 02:49:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:12,544 INFO L225 Difference]: With dead ends: 2799 [2025-03-09 02:49:12,544 INFO L226 Difference]: Without dead ends: 1394 [2025-03-09 02:49:12,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:12,553 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 88 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 3280 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:12,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 3280 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:49:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-09 02:49:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1388. [2025-03-09 02:49:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 994 states have (on average 1.5301810865191148) internal successors, (1521), 1216 states have internal predecessors, (1521), 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-03-09 02:49:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1791 transitions. [2025-03-09 02:49:12,675 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1791 transitions. Word has length 18 [2025-03-09 02:49:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:12,675 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1791 transitions. [2025-03-09 02:49:12,675 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-03-09 02:49:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1791 transitions. [2025-03-09 02:49:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 02:49:12,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:12,676 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-03-09 02:49:12,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:49:12,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:49:12,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:12,677 INFO L85 PathProgramCache]: Analyzing trace with hash 376917218, now seen corresponding path program 1 times [2025-03-09 02:49:12,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:12,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220596098] [2025-03-09 02:49:12,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:12,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:13,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:49:13,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:49:13,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:13,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:13,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:13,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220596098] [2025-03-09 02:49:13,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220596098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:13,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:13,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:13,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286256121] [2025-03-09 02:49:13,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:13,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:13,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:13,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:13,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:13,469 INFO L87 Difference]: Start difference. First operand 1388 states and 1791 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-03-09 02:49:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:14,415 INFO L93 Difference]: Finished difference Result 2806 states and 3637 transitions. [2025-03-09 02:49:14,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:14,416 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-03-09 02:49:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:14,429 INFO L225 Difference]: With dead ends: 2806 [2025-03-09 02:49:14,429 INFO L226 Difference]: Without dead ends: 1434 [2025-03-09 02:49:14,434 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-03-09 02:49:14,436 INFO L435 NwaCegarLoop]: 1611 mSDtfsCounter, 24 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3215 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:14,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3215 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 02:49:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2025-03-09 02:49:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1432. [2025-03-09 02:49:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1036 states have (on average 1.524131274131274) internal successors, (1579), 1258 states have internal predecessors, (1579), 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-03-09 02:49:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1853 transitions. [2025-03-09 02:49:14,491 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1853 transitions. Word has length 20 [2025-03-09 02:49:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:14,492 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 1853 transitions. [2025-03-09 02:49:14,492 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-03-09 02:49:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1853 transitions. [2025-03-09 02:49:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 02:49:14,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:14,493 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-03-09 02:49:14,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:49:14,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:49:14,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2052052256, now seen corresponding path program 1 times [2025-03-09 02:49:14,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:14,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987709873] [2025-03-09 02:49:14,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:14,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:14,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:49:14,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:49:14,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:14,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:15,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:15,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987709873] [2025-03-09 02:49:15,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987709873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:15,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:15,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150927889] [2025-03-09 02:49:15,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:15,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:15,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:15,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:15,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:15,045 INFO L87 Difference]: Start difference. First operand 1432 states and 1853 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-03-09 02:49:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:15,787 INFO L93 Difference]: Finished difference Result 1462 states and 1897 transitions. [2025-03-09 02:49:15,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:15,787 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-03-09 02:49:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:15,794 INFO L225 Difference]: With dead ends: 1462 [2025-03-09 02:49:15,794 INFO L226 Difference]: Without dead ends: 1460 [2025-03-09 02:49:15,795 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-03-09 02:49:15,797 INFO L435 NwaCegarLoop]: 1619 mSDtfsCounter, 3 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3233 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:15,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3233 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:49:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2025-03-09 02:49:15,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1456. [2025-03-09 02:49:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1060 states have (on average 1.519811320754717) internal successors, (1611), 1282 states have internal predecessors, (1611), 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-03-09 02:49:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1885 transitions. [2025-03-09 02:49:15,841 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1885 transitions. Word has length 23 [2025-03-09 02:49:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:15,841 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 1885 transitions. [2025-03-09 02:49:15,841 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-03-09 02:49:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1885 transitions. [2025-03-09 02:49:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 02:49:15,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:15,842 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-03-09 02:49:15,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:49:15,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:49:15,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1068651549, now seen corresponding path program 1 times [2025-03-09 02:49:15,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:15,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393193134] [2025-03-09 02:49:15,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:15,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:16,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:49:16,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:49:16,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:16,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:16,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393193134] [2025-03-09 02:49:16,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393193134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64125607] [2025-03-09 02:49:16,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:16,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:16,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:16,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:16,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:49:17,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:49:17,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:49:17,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:17,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:17,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:17,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:17,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:17,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64125607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:17,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:17,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:49:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004199171] [2025-03-09 02:49:17,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:17,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:17,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:17,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:17,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:17,401 INFO L87 Difference]: Start difference. First operand 1456 states and 1885 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-03-09 02:49:18,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:18,319 INFO L93 Difference]: Finished difference Result 1458 states and 1885 transitions. [2025-03-09 02:49:18,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:18,319 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-03-09 02:49:18,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:18,325 INFO L225 Difference]: With dead ends: 1458 [2025-03-09 02:49:18,325 INFO L226 Difference]: Without dead ends: 1456 [2025-03-09 02:49:18,326 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-03-09 02:49:18,327 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 48 mSDsluCounter, 3193 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 4816 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:18,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 4816 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 02:49:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2025-03-09 02:49:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1454. [2025-03-09 02:49:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1060 states have (on average 1.5160377358490567) internal successors, (1607), 1280 states have internal predecessors, (1607), 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-03-09 02:49:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1881 transitions. [2025-03-09 02:49:18,361 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1881 transitions. Word has length 24 [2025-03-09 02:49:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:18,362 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 1881 transitions. [2025-03-09 02:49:18,362 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-03-09 02:49:18,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1881 transitions. [2025-03-09 02:49:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 02:49:18,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:18,364 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-03-09 02:49:18,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:18,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:18,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:49:18,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:18,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1231539633, now seen corresponding path program 1 times [2025-03-09 02:49:18,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:18,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392667906] [2025-03-09 02:49:18,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:18,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:18,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:49:18,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:49:18,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:18,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:49:19,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:19,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392667906] [2025-03-09 02:49:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392667906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:19,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:19,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307440377] [2025-03-09 02:49:19,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:19,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:19,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:19,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:19,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:19,065 INFO L87 Difference]: Start difference. First operand 1454 states and 1881 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-03-09 02:49:19,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:19,722 INFO L93 Difference]: Finished difference Result 1456 states and 1881 transitions. [2025-03-09 02:49:19,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:19,723 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-03-09 02:49:19,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:19,728 INFO L225 Difference]: With dead ends: 1456 [2025-03-09 02:49:19,728 INFO L226 Difference]: Without dead ends: 1455 [2025-03-09 02:49:19,729 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-03-09 02:49:19,730 INFO L435 NwaCegarLoop]: 1608 mSDtfsCounter, 24 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3212 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:19,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3212 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:49:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2025-03-09 02:49:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1447. [2025-03-09 02:49:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1054 states have (on average 1.51707779886148) internal successors, (1599), 1273 states have internal predecessors, (1599), 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-03-09 02:49:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1873 transitions. [2025-03-09 02:49:19,761 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1873 transitions. Word has length 25 [2025-03-09 02:49:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:19,761 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1873 transitions. [2025-03-09 02:49:19,761 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-03-09 02:49:19,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1873 transitions. [2025-03-09 02:49:19,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 02:49:19,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:19,762 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-03-09 02:49:19,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:49:19,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:49:19,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:19,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1064096859, now seen corresponding path program 1 times [2025-03-09 02:49:19,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:19,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027638081] [2025-03-09 02:49:19,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:20,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:49:20,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:49:20,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:20,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:20,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:20,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027638081] [2025-03-09 02:49:20,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027638081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:20,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534615045] [2025-03-09 02:49:20,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:20,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:20,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:20,345 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:20,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:49:21,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:49:21,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:49:21,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:21,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:21,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:21,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:21,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:21,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534615045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:21,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:21,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:49:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133506270] [2025-03-09 02:49:21,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:21,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:21,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:21,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:21,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:21,229 INFO L87 Difference]: Start difference. First operand 1447 states and 1873 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-03-09 02:49:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:21,725 INFO L93 Difference]: Finished difference Result 1451 states and 1877 transitions. [2025-03-09 02:49:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:21,725 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-03-09 02:49:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:21,731 INFO L225 Difference]: With dead ends: 1451 [2025-03-09 02:49:21,732 INFO L226 Difference]: Without dead ends: 1450 [2025-03-09 02:49:21,733 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-03-09 02:49:21,733 INFO L435 NwaCegarLoop]: 1617 mSDtfsCounter, 5 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3228 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:21,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3228 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:49:21,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-03-09 02:49:21,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1446. [2025-03-09 02:49:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1054 states have (on average 1.5132827324478177) internal successors, (1595), 1272 states have internal predecessors, (1595), 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-03-09 02:49:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1869 transitions. [2025-03-09 02:49:21,768 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1869 transitions. Word has length 29 [2025-03-09 02:49:21,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:21,768 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 1869 transitions. [2025-03-09 02:49:21,769 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-03-09 02:49:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1869 transitions. [2025-03-09 02:49:21,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:49:21,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:21,769 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-03-09 02:49:21,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:49:21,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 02:49:21,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:49:21,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1372736492, now seen corresponding path program 1 times [2025-03-09 02:49:21,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:21,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090142829] [2025-03-09 02:49:21,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:21,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:22,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:49:22,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:49:22,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:22,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:22,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:22,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090142829] [2025-03-09 02:49:22,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090142829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:22,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008606221] [2025-03-09 02:49:22,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:22,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:22,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:22,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:22,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:49:23,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:49:23,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:49:23,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:23,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:23,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 1345 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:23,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:23,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:49:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:23,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008606221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:49:23,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:49:23,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:49:23,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076718943] [2025-03-09 02:49:23,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:49:23,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:49:23,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:23,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:49:23,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:23,642 INFO L87 Difference]: Start difference. First operand 1446 states and 1869 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-03-09 02:49:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:24,518 INFO L93 Difference]: Finished difference Result 1535 states and 1993 transitions. [2025-03-09 02:49:24,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:49:24,518 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-03-09 02:49:24,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:24,522 INFO L225 Difference]: With dead ends: 1535 [2025-03-09 02:49:24,522 INFO L226 Difference]: Without dead ends: 1534 [2025-03-09 02:49:24,523 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-03-09 02:49:24,524 INFO L435 NwaCegarLoop]: 1615 mSDtfsCounter, 12 mSDsluCounter, 3231 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4846 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:24,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4846 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 02:49:24,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2025-03-09 02:49:24,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1518. [2025-03-09 02:49:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1126 states have (on average 1.5017761989342806) internal successors, (1691), 1344 states have internal predecessors, (1691), 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-03-09 02:49:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1965 transitions. [2025-03-09 02:49:24,574 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1965 transitions. Word has length 30 [2025-03-09 02:49:24,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:24,575 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1965 transitions. [2025-03-09 02:49:24,576 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-03-09 02:49:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1965 transitions. [2025-03-09 02:49:24,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 02:49:24,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:24,576 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-03-09 02:49:24,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 02:49:24,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:24,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:49:24,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1288059889, now seen corresponding path program 1 times [2025-03-09 02:49:24,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:24,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59474603] [2025-03-09 02:49:24,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:24,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:25,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:49:25,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:49:25,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:25,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:25,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:25,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59474603] [2025-03-09 02:49:25,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59474603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:25,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419729635] [2025-03-09 02:49:25,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:25,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:25,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:25,244 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:25,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:49:25,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:49:26,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:49:26,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:26,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:26,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:26,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:26,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:49:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:26,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419729635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:49:26,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:49:26,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:49:26,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367008106] [2025-03-09 02:49:26,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:49:26,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:49:26,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:26,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:49:26,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:26,423 INFO L87 Difference]: Start difference. First operand 1518 states and 1965 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-03-09 02:49:27,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:27,321 INFO L93 Difference]: Finished difference Result 3294 states and 4291 transitions. [2025-03-09 02:49:27,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:49:27,322 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-03-09 02:49:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:27,327 INFO L225 Difference]: With dead ends: 3294 [2025-03-09 02:49:27,327 INFO L226 Difference]: Without dead ends: 1792 [2025-03-09 02:49:27,330 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-03-09 02:49:27,330 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 92 mSDsluCounter, 4837 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 6443 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:27,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 6443 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 02:49:27,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2025-03-09 02:49:27,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1778. [2025-03-09 02:49:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1380 states have (on average 1.4746376811594204) internal successors, (2035), 1598 states have internal predecessors, (2035), 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-03-09 02:49:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2321 transitions. [2025-03-09 02:49:27,358 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2321 transitions. Word has length 32 [2025-03-09 02:49:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:27,358 INFO L471 AbstractCegarLoop]: Abstraction has 1778 states and 2321 transitions. [2025-03-09 02:49:27,359 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-03-09 02:49:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2321 transitions. [2025-03-09 02:49:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 02:49:27,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:27,362 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-03-09 02:49:27,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:49:27,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:27,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:49:27,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash -861188364, now seen corresponding path program 1 times [2025-03-09 02:49:27,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:27,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201365978] [2025-03-09 02:49:27,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:27,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:27,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 02:49:27,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 02:49:27,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:27,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 02:49:28,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:28,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201365978] [2025-03-09 02:49:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201365978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:28,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:49:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888836891] [2025-03-09 02:49:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:28,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:28,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:28,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:28,043 INFO L87 Difference]: Start difference. First operand 1778 states and 2321 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-03-09 02:49:32,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:49:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:32,390 INFO L93 Difference]: Finished difference Result 3792 states and 4972 transitions. [2025-03-09 02:49:32,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:32,391 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-03-09 02:49:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:32,399 INFO L225 Difference]: With dead ends: 3792 [2025-03-09 02:49:32,399 INFO L226 Difference]: Without dead ends: 2030 [2025-03-09 02:49:32,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:32,403 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 81 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 3281 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:32,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 3281 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-09 02:49:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2025-03-09 02:49:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2028. [2025-03-09 02:49:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 1624 states have (on average 1.457512315270936) internal successors, (2367), 1842 states have internal predecessors, (2367), 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-03-09 02:49:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 2663 transitions. [2025-03-09 02:49:32,431 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 2663 transitions. Word has length 47 [2025-03-09 02:49:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:32,431 INFO L471 AbstractCegarLoop]: Abstraction has 2028 states and 2663 transitions. [2025-03-09 02:49:32,432 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-03-09 02:49:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2663 transitions. [2025-03-09 02:49:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 02:49:32,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:32,433 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-03-09 02:49:32,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:49:32,433 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:49:32,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash -925556105, now seen corresponding path program 1 times [2025-03-09 02:49:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:32,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685194696] [2025-03-09 02:49:32,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:32,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 02:49:32,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:49:32,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:32,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:49:32,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:32,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685194696] [2025-03-09 02:49:32,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685194696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:32,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:32,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:32,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201506637] [2025-03-09 02:49:32,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:32,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:32,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:32,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:32,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:32,885 INFO L87 Difference]: Start difference. First operand 2028 states and 2663 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-03-09 02:49:33,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:33,618 INFO L93 Difference]: Finished difference Result 2539 states and 3353 transitions. [2025-03-09 02:49:33,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:33,619 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-03-09 02:49:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:33,626 INFO L225 Difference]: With dead ends: 2539 [2025-03-09 02:49:33,627 INFO L226 Difference]: Without dead ends: 2537 [2025-03-09 02:49:33,628 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-03-09 02:49:33,628 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 66 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 3224 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:33,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 3224 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:49:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2025-03-09 02:49:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2535. [2025-03-09 02:49:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2115 states have (on average 1.433096926713948) internal successors, (3031), 2333 states have internal predecessors, (3031), 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-03-09 02:49:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3351 transitions. [2025-03-09 02:49:33,665 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3351 transitions. Word has length 48 [2025-03-09 02:49:33,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:33,665 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 3351 transitions. [2025-03-09 02:49:33,665 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-03-09 02:49:33,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3351 transitions. [2025-03-09 02:49:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 02:49:33,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:33,666 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-03-09 02:49:33,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:49:33,666 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:49:33,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:33,666 INFO L85 PathProgramCache]: Analyzing trace with hash 189198845, now seen corresponding path program 2 times [2025-03-09 02:49:33,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:33,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258822043] [2025-03-09 02:49:33,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:49:33,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:33,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-09 02:49:34,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 48 statements. [2025-03-09 02:49:34,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:49:34,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:49:38,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:38,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258822043] [2025-03-09 02:49:38,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258822043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:38,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103689094] [2025-03-09 02:49:38,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:49:38,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:38,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:38,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:38,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:49:39,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-09 02:49:39,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 48 statements. [2025-03-09 02:49:39,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:49:39,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:39,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:49:39,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 02:49:40,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:40,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103689094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:40,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:40,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2025-03-09 02:49:40,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127913] [2025-03-09 02:49:40,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:40,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:40,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:40,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:40,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:40,282 INFO L87 Difference]: Start difference. First operand 2535 states and 3351 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-03-09 02:49:44,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:49:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:46,120 INFO L93 Difference]: Finished difference Result 3995 states and 5232 transitions. [2025-03-09 02:49:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:46,120 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-03-09 02:49:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:46,126 INFO L225 Difference]: With dead ends: 3995 [2025-03-09 02:49:46,126 INFO L226 Difference]: Without dead ends: 1476 [2025-03-09 02:49:46,130 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-03-09 02:49:46,131 INFO L435 NwaCegarLoop]: 1590 mSDtfsCounter, 1675 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:46,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 2912 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 459 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2025-03-09 02:49:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2025-03-09 02:49:46,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1476. [2025-03-09 02:49:46,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1087 states have (on average 1.4931002759889604) internal successors, (1623), 1303 states have internal predecessors, (1623), 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-03-09 02:49:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 1893 transitions. [2025-03-09 02:49:46,156 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 1893 transitions. Word has length 48 [2025-03-09 02:49:46,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:46,156 INFO L471 AbstractCegarLoop]: Abstraction has 1476 states and 1893 transitions. [2025-03-09 02:49:46,157 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-03-09 02:49:46,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1893 transitions. [2025-03-09 02:49:46,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 02:49:46,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:46,158 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-03-09 02:49:46,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 02:49:46,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 02:49:46,359 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:49:46,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:46,360 INFO L85 PathProgramCache]: Analyzing trace with hash -415818023, now seen corresponding path program 1 times [2025-03-09 02:49:46,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:46,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774727745] [2025-03-09 02:49:46,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:46,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:46,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 02:49:46,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 02:49:46,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:46,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:49:46,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:46,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774727745] [2025-03-09 02:49:46,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774727745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:46,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370734318] [2025-03-09 02:49:46,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:46,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:46,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:46,908 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:46,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:49:47,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 02:49:47,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 02:49:47,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:47,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:47,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 1471 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:49:47,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 02:49:48,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:49:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 02:49:48,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370734318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:49:48,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:49:48,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-03-09 02:49:48,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693209362] [2025-03-09 02:49:48,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:49:48,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:49:48,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:48,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:49:48,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:49:48,233 INFO L87 Difference]: Start difference. First operand 1476 states and 1893 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-03-09 02:49:52,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:49:56,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:56,738 INFO L93 Difference]: Finished difference Result 4437 states and 5701 transitions. [2025-03-09 02:49:56,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 02:49:56,739 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-03-09 02:49:56,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:56,749 INFO L225 Difference]: With dead ends: 4437 [2025-03-09 02:49:56,749 INFO L226 Difference]: Without dead ends: 2977 [2025-03-09 02:49:56,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:49:56,753 INFO L435 NwaCegarLoop]: 1639 mSDtfsCounter, 1745 mSDsluCounter, 7785 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 9424 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:56,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 9424 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 952 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2025-03-09 02:49:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2025-03-09 02:49:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2773. [2025-03-09 02:49:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2773 states, 2210 states have (on average 1.4737556561085974) internal successors, (3257), 2436 states have internal predecessors, (3257), 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-03-09 02:49:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 3789 transitions. [2025-03-09 02:49:56,823 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 3789 transitions. Word has length 58 [2025-03-09 02:49:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:56,823 INFO L471 AbstractCegarLoop]: Abstraction has 2773 states and 3789 transitions. [2025-03-09 02:49:56,823 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-03-09 02:49:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 3789 transitions. [2025-03-09 02:49:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-09 02:49:56,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:56,825 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-03-09 02:49:56,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:49:57,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:57,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:49:57,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:57,026 INFO L85 PathProgramCache]: Analyzing trace with hash 744477187, now seen corresponding path program 1 times [2025-03-09 02:49:57,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:57,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835583737] [2025-03-09 02:49:57,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:57,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:57,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-09 02:49:57,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 02:49:57,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:57,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-09 02:49:57,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:57,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835583737] [2025-03-09 02:49:57,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835583737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:57,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827832123] [2025-03-09 02:49:57,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:57,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:57,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:57,584 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:57,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:49:58,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-09 02:49:58,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 02:49:58,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:58,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:58,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 1540 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:49:58,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 02:49:59,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:49:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 66 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 02:49:59,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827832123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:49:59,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:49:59,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 9, 9] total 18 [2025-03-09 02:49:59,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647674359] [2025-03-09 02:49:59,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:49:59,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 02:49:59,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:59,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 02:49:59,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:49:59,887 INFO L87 Difference]: Start difference. First operand 2773 states and 3789 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-03-09 02:50:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:50:05,156 INFO L93 Difference]: Finished difference Result 7406 states and 9945 transitions. [2025-03-09 02:50:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-09 02:50:05,156 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-03-09 02:50:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:50:05,168 INFO L225 Difference]: With dead ends: 7406 [2025-03-09 02:50:05,168 INFO L226 Difference]: Without dead ends: 4649 [2025-03-09 02:50:05,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=720, Invalid=1350, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 02:50:05,172 INFO L435 NwaCegarLoop]: 1584 mSDtfsCounter, 1775 mSDsluCounter, 6050 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 7634 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:50:05,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 7634 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-09 02:50:05,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2025-03-09 02:50:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4446. [2025-03-09 02:50:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4446 states, 3705 states have (on average 1.4240215924426451) internal successors, (5276), 3941 states have internal predecessors, (5276), 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-03-09 02:50:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4446 states to 4446 states and 6074 transitions. [2025-03-09 02:50:05,261 INFO L78 Accepts]: Start accepts. Automaton has 4446 states and 6074 transitions. Word has length 75 [2025-03-09 02:50:05,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:50:05,262 INFO L471 AbstractCegarLoop]: Abstraction has 4446 states and 6074 transitions. [2025-03-09 02:50:05,262 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-03-09 02:50:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 4446 states and 6074 transitions. [2025-03-09 02:50:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-09 02:50:05,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:50:05,264 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-03-09 02:50:05,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 02:50:05,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:50:05,465 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting analog_disconnectErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:50:05,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:50:05,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1208075128, now seen corresponding path program 1 times [2025-03-09 02:50:05,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:50:05,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527353914] [2025-03-09 02:50:05,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:50:05,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:50:05,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-09 02:50:05,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-09 02:50:05,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:50:05,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:50:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-09 02:50:06,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:50:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527353914] [2025-03-09 02:50:06,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527353914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:50:06,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:50:06,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:50:06,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081580719] [2025-03-09 02:50:06,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:50:06,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:50:06,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:50:06,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:50:06,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:50:06,030 INFO L87 Difference]: Start difference. First operand 4446 states and 6074 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-03-09 02:50:10,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:50:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:50:10,399 INFO L93 Difference]: Finished difference Result 9114 states and 12417 transitions. [2025-03-09 02:50:10,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:50:10,400 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-03-09 02:50:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:50:10,422 INFO L225 Difference]: With dead ends: 9114 [2025-03-09 02:50:10,422 INFO L226 Difference]: Without dead ends: 4863 [2025-03-09 02:50:10,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:50:10,431 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 1643 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:50:10,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 1808 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-09 02:50:10,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4863 states. [2025-03-09 02:50:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4863 to 4857. [2025-03-09 02:50:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4857 states, 4065 states have (on average 1.401968019680197) internal successors, (5699), 4301 states have internal predecessors, (5699), 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-03-09 02:50:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4857 states to 4857 states and 6545 transitions. [2025-03-09 02:50:10,516 INFO L78 Accepts]: Start accepts. Automaton has 4857 states and 6545 transitions. Word has length 119 [2025-03-09 02:50:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:50:10,516 INFO L471 AbstractCegarLoop]: Abstraction has 4857 states and 6545 transitions. [2025-03-09 02:50:10,516 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-03-09 02:50:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4857 states and 6545 transitions. [2025-03-09 02:50:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-09 02:50:10,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:50:10,521 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-03-09 02:50:10,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 02:50:10,521 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:50:10,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:50:10,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1957057318, now seen corresponding path program 1 times [2025-03-09 02:50:10,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:50:10,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030899887] [2025-03-09 02:50:10,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:50:10,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:50:10,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-09 02:50:10,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-09 02:50:10,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:50:10,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:50:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-09 02:50:11,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:50:11,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030899887] [2025-03-09 02:50:11,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030899887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:50:11,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:50:11,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:50:11,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356525044] [2025-03-09 02:50:11,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:50:11,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:50:11,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:50:11,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:50:11,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:50:11,061 INFO L87 Difference]: Start difference. First operand 4857 states and 6545 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-03-09 02:50:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:50:11,760 INFO L93 Difference]: Finished difference Result 4960 states and 6663 transitions. [2025-03-09 02:50:11,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:50:11,761 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-03-09 02:50:11,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:50:11,778 INFO L225 Difference]: With dead ends: 4960 [2025-03-09 02:50:11,778 INFO L226 Difference]: Without dead ends: 4958 [2025-03-09 02:50:11,781 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-03-09 02:50:11,781 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 1732 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:50:11,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 1642 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:50:11,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2025-03-09 02:50:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 3302. [2025-03-09 02:50:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 2707 states have (on average 1.4011821204285186) internal successors, (3793), 2931 states have internal predecessors, (3793), 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-03-09 02:50:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4357 transitions. [2025-03-09 02:50:11,854 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4357 transitions. Word has length 117 [2025-03-09 02:50:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:50:11,854 INFO L471 AbstractCegarLoop]: Abstraction has 3302 states and 4357 transitions. [2025-03-09 02:50:11,854 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-03-09 02:50:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4357 transitions. [2025-03-09 02:50:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-09 02:50:11,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:50:11,856 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-03-09 02:50:11,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 02:50:11,856 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:50:11,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:50:11,857 INFO L85 PathProgramCache]: Analyzing trace with hash -8328916, now seen corresponding path program 1 times [2025-03-09 02:50:11,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:50:11,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107205272] [2025-03-09 02:50:11,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:50:11,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:50:12,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-09 02:50:12,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-09 02:50:12,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:50:12,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:50:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-03-09 02:50:12,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:50:12,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107205272] [2025-03-09 02:50:12,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107205272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:50:12,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:50:12,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:50:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927296642] [2025-03-09 02:50:12,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:50:12,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:50:12,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:50:12,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:50:12,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:50:12,367 INFO L87 Difference]: Start difference. First operand 3302 states and 4357 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-03-09 02:50:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:50:12,932 INFO L93 Difference]: Finished difference Result 3302 states and 4357 transitions. [2025-03-09 02:50:12,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:50:12,932 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-03-09 02:50:12,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:50:12,941 INFO L225 Difference]: With dead ends: 3302 [2025-03-09 02:50:12,942 INFO L226 Difference]: Without dead ends: 3301 [2025-03-09 02:50:12,943 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-03-09 02:50:12,944 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 1671 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1671 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:50:12,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1671 Valid, 1586 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:50:12,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2025-03-09 02:50:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 3301. [2025-03-09 02:50:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3301 states, 2707 states have (on average 1.4008127077946066) internal successors, (3792), 2930 states have internal predecessors, (3792), 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-03-09 02:50:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 4356 transitions. [2025-03-09 02:50:13,017 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 4356 transitions. Word has length 128 [2025-03-09 02:50:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:50:13,018 INFO L471 AbstractCegarLoop]: Abstraction has 3301 states and 4356 transitions. [2025-03-09 02:50:13,018 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-03-09 02:50:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 4356 transitions. [2025-03-09 02:50:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-09 02:50:13,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:50:13,019 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-03-09 02:50:13,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 02:50:13,020 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting analog_disconnectErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:50:13,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:50:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1428339446, now seen corresponding path program 1 times [2025-03-09 02:50:13,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:50:13,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915943595] [2025-03-09 02:50:13,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:50:13,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:50:13,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-09 02:50:13,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-09 02:50:13,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:50:13,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:50:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-09 02:50:13,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:50:13,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915943595] [2025-03-09 02:50:13,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915943595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:50:13,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:50:13,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:50:13,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702722595] [2025-03-09 02:50:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:50:13,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:50:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:50:13,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:50:13,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:50:13,566 INFO L87 Difference]: Start difference. First operand 3301 states and 4356 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-03-09 02:50:17,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:50:18,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:50:18,585 INFO L93 Difference]: Finished difference Result 9087 states and 12140 transitions. [2025-03-09 02:50:18,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:50:18,585 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-03-09 02:50:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:50:18,598 INFO L225 Difference]: With dead ends: 9087 [2025-03-09 02:50:18,598 INFO L226 Difference]: Without dead ends: 5981 [2025-03-09 02:50:18,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:50:18,606 INFO L435 NwaCegarLoop]: 3168 mSDtfsCounter, 1671 mSDsluCounter, 4748 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1671 SdHoareTripleChecker+Valid, 7916 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-09 02:50:18,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1671 Valid, 7916 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-03-09 02:50:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2025-03-09 02:50:18,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3305. [2025-03-09 02:50:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 2711 states have (on average 1.400221320545924) internal successors, (3796), 2934 states have internal predecessors, (3796), 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-03-09 02:50:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4360 transitions. [2025-03-09 02:50:18,689 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4360 transitions. Word has length 135 [2025-03-09 02:50:18,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:50:18,689 INFO L471 AbstractCegarLoop]: Abstraction has 3305 states and 4360 transitions. [2025-03-09 02:50:18,689 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-03-09 02:50:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4360 transitions. [2025-03-09 02:50:18,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-09 02:50:18,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:50:18,691 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-03-09 02:50:18,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 02:50:18,691 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:50:18,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:50:18,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1516327351, now seen corresponding path program 1 times [2025-03-09 02:50:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:50:18,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201532134] [2025-03-09 02:50:18,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:50:18,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:50:19,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-09 02:50:19,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-09 02:50:19,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:50:19,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:50:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-03-09 02:50:19,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:50:19,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201532134] [2025-03-09 02:50:19,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201532134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:50:19,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:50:19,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:50:19,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480060745] [2025-03-09 02:50:19,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:50:19,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:50:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:50:19,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:50:19,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:50:19,232 INFO L87 Difference]: Start difference. First operand 3305 states and 4360 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-03-09 02:50:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:50:19,876 INFO L93 Difference]: Finished difference Result 6553 states and 8725 transitions. [2025-03-09 02:50:19,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:50:19,876 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-03-09 02:50:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:50:19,885 INFO L225 Difference]: With dead ends: 6553 [2025-03-09 02:50:19,885 INFO L226 Difference]: Without dead ends: 3443 [2025-03-09 02:50:19,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:50:19,890 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 66 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:50:19,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 3155 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:50:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2025-03-09 02:50:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3357. [2025-03-09 02:50:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 2757 states have (on average 1.3986216902430177) internal successors, (3856), 2980 states have internal predecessors, (3856), 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-03-09 02:50:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4432 transitions. [2025-03-09 02:50:19,981 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4432 transitions. Word has length 137 [2025-03-09 02:50:19,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:50:19,981 INFO L471 AbstractCegarLoop]: Abstraction has 3357 states and 4432 transitions. [2025-03-09 02:50:19,981 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-03-09 02:50:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4432 transitions. [2025-03-09 02:50:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-09 02:50:19,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:50:19,984 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-03-09 02:50:19,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 02:50:19,984 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-09 02:50:19,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:50:19,985 INFO L85 PathProgramCache]: Analyzing trace with hash -149066529, now seen corresponding path program 1 times [2025-03-09 02:50:19,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:50:19,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410804461] [2025-03-09 02:50:19,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:50:19,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:50:20,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-09 02:50:20,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-09 02:50:20,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:50:20,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:50:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 10 proven. 378 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-09 02:50:21,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:50:21,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410804461] [2025-03-09 02:50:21,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410804461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:50:21,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990970315] [2025-03-09 02:50:21,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:50:21,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:50:21,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:50:21,491 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:50:21,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:50:22,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-09 02:50:22,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-09 02:50:22,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:50:22,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:50:22,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 1761 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 02:50:22,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:50:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 14 proven. 378 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-09 02:50:22,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:50:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 10 proven. 378 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-09 02:50:23,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990970315] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:50:23,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:50:23,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 19 [2025-03-09 02:50:23,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145922577] [2025-03-09 02:50:23,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:50:23,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 02:50:23,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:50:23,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 02:50:23,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:50:23,949 INFO L87 Difference]: Start difference. First operand 3357 states and 4432 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)