./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 93c428ff6f0565c9de954639ae23000ff5693477bac9f291339fc811e0689668 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:48:58,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:48:58,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:48:58,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:48:58,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:48:58,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:48:58,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:48:58,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:48:58,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:48:58,757 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:48:58,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:48:58,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:48:58,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:48:58,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:48:58,758 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:48:58,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:48:58,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:48:58,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:48:58,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:48:58,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:48:58,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:48:58,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:48:58,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:48:58,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:48:58,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:48:58,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:48:58,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:48:58,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:48:58,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:48:58,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:48:58,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:48:58,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:48:58,759 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:48:58,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:48:58,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:48:58,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:48:58,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:48:58,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:48:58,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:48:58,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:48:58,760 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93c428ff6f0565c9de954639ae23000ff5693477bac9f291339fc811e0689668 [2025-02-06 06:48:58,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:48:58,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:48:58,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:48:58,981 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:48:58,981 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:48:58,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i [2025-02-06 06:49:00,128 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2313fc62/4838b48089b14481aec14c77d9bc54a6/FLAG7d9a50d1e [2025-02-06 06:49:00,570 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:49:00,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i [2025-02-06 06:49:00,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2313fc62/4838b48089b14481aec14c77d9bc54a6/FLAG7d9a50d1e [2025-02-06 06:49:00,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2313fc62/4838b48089b14481aec14c77d9bc54a6 [2025-02-06 06:49:00,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:49:00,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:49:00,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:49:00,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:49:00,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:49:00,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:49:00" (1/1) ... [2025-02-06 06:49:00,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1837d07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:00, skipping insertion in model container [2025-02-06 06:49:00,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:49:00" (1/1) ... [2025-02-06 06:49:00,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:49:01,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i[129978,129991] [2025-02-06 06:49:01,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:49:01,392 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:49:01,474 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; subl %2, %0; sete %1": "+m" (v->counter), "=qm" (c): "er" (i): "memory"); [3226-3227] [2025-02-06 06:49:01,477 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; xaddb %b0, %1\n": "+q" (__ret), "+m" (v->counter): : "memory", "cc"); [3238-3239] [2025-02-06 06:49:01,478 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; xaddw %w0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [3242-3243] [2025-02-06 06:49:01,478 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; xaddl %0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [3246-3247] [2025-02-06 06:49:01,478 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; xaddq %q0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [3250-3251] [2025-02-06 06:49:01,521 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp): "ebx"); [3767] [2025-02-06 06:49:01,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___0): "ebx"); [3772] [2025-02-06 06:49:01,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___1): "ebx"); [3777] [2025-02-06 06:49:01,525 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___2): "ebx"); [3782] [2025-02-06 06:49:01,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___3): "ebx"); [3787] [2025-02-06 06:49:01,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu), "=r" (__val_gu): "0" (tmp), "i" (1UL)); [3886-3887] [2025-02-06 06:49:01,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i[129978,129991] [2025-02-06 06:49:01,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:49:01,681 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:49:01,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:01 WrapperNode [2025-02-06 06:49:01,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:49:01,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:49:01,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:49:01,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:49:01,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:01" (1/1) ... [2025-02-06 06:49:01,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:01" (1/1) ... [2025-02-06 06:49:01,812 INFO L138 Inliner]: procedures = 190, calls = 552, calls flagged for inlining = 74, calls inlined = 69, statements flattened = 1678 [2025-02-06 06:49:01,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:49:01,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:49:01,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:49:01,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:49:01,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:01" (1/1) ... [2025-02-06 06:49:01,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:01" (1/1) ... [2025-02-06 06:49:01,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:01" (1/1) ... [2025-02-06 06:49:01,961 INFO L175 MemorySlicer]: Split 205 memory accesses to 7 slices as follows [2, 122, 4, 23, 27, 13, 14]. 60 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2, 0, 0, 0, 0, 0]. The 128 writes are split as follows [0, 62, 2, 23, 27, 2, 12]. [2025-02-06 06:49:01,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:01" (1/1) ... [2025-02-06 06:49:01,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:01" (1/1) ... [2025-02-06 06:49:02,019 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:01" (1/1) ... [2025-02-06 06:49:02,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:01" (1/1) ... [2025-02-06 06:49:02,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:01" (1/1) ... [2025-02-06 06:49:02,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:01" (1/1) ... [2025-02-06 06:49:02,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:49:02,039 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:49:02,039 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:49:02,039 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:49:02,040 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:01" (1/1) ... [2025-02-06 06:49:02,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:49:02,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:49:02,061 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 06:49:02,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 06:49:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_serio_raw_mutex [2025-02-06 06:49:02,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_serio_raw_mutex [2025-02-06 06:49:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:49:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:49:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:49:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 06:49:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 06:49:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 06:49:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 06:49:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2025-02-06 06:49:02,078 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2025-02-06 06:49:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:49:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:49:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:49:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 06:49:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 06:49:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 06:49:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 06:49:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 06:49:02,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 06:49:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:49:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:49:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:49:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 06:49:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 06:49:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 06:49:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 06:49:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-02-06 06:49:02,080 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-02-06 06:49:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:49:02,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:49:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 06:49:02,080 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 06:49:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure kill_fasync [2025-02-06 06:49:02,080 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_fasync [2025-02-06 06:49:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure list_del_init [2025-02-06 06:49:02,080 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del_init [2025-02-06 06:49:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-02-06 06:49:02,080 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-02-06 06:49:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:49:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:49:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:49:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:49:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:49:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:49:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 06:49:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-02-06 06:49:02,081 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-02-06 06:49:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 06:49:02,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 06:49:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-02-06 06:49:02,081 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-02-06 06:49:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2025-02-06 06:49:02,081 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2025-02-06 06:49:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 06:49:02,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 06:49:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_disconnect [2025-02-06 06:49:02,081 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_disconnect [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure serio_continue_rx [2025-02-06 06:49:02,082 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_continue_rx [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-02-06 06:49:02,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 06:49:02,082 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_poll [2025-02-06 06:49:02,082 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_poll [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-02-06 06:49:02,082 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-02-06 06:49:02,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-02-06 06:49:02,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure serio_set_drvdata [2025-02-06 06:49:02,082 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_set_drvdata [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:49:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-02-06 06:49:02,083 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 06:49:02,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure misc_register [2025-02-06 06:49:02,083 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_register [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-02-06 06:49:02,083 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure serio_pause_rx [2025-02-06 06:49:02,083 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_pause_rx [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-02-06 06:49:02,083 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_add_return [2025-02-06 06:49:02,083 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_add_return [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 06:49:02,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_file_operations_2 [2025-02-06 06:49:02,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_file_operations_2 [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure serio_get_drvdata [2025-02-06 06:49:02,084 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_get_drvdata [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-02-06 06:49:02,084 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_serio_raw_mutex [2025-02-06 06:49:02,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_serio_raw_mutex [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2025-02-06 06:49:02,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-02-06 06:49:02,084 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure serio_close [2025-02-06 06:49:02,084 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_close [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_serio_raw_mutex [2025-02-06 06:49:02,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_serio_raw_mutex [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 06:49:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_write [2025-02-06 06:49:02,084 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_write [2025-02-06 06:49:02,085 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_fasync [2025-02-06 06:49:02,085 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_fasync [2025-02-06 06:49:02,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:49:02,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:49:02,451 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:49:02,454 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:49:02,517 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 06:49:02,636 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5308: havoc misc_deregister_#t~nondet302#1; [2025-02-06 06:49:02,757 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5312: havoc #t~nondet303; [2025-02-06 06:49:02,766 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5319: havoc #t~nondet304; [2025-02-06 06:49:02,783 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3529: havoc dev_get_drvdata_#t~mem88#1.base, dev_get_drvdata_#t~mem88#1.offset; [2025-02-06 06:49:02,802 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3406: havoc __kmalloc_#t~ret56#1.base, __kmalloc_#t~ret56#1.offset; [2025-02-06 06:49:02,842 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4488-1: ldv_mutex_lock_interruptible_14_#res#1 := ldv_mutex_lock_interruptible_14_~ldv_func_res~2#1; [2025-02-06 06:49:02,849 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5289: havoc fasync_helper_#t~nondet300#1; [2025-02-06 06:49:07,377 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5323: havoc mutex_lock_killable_#t~nondet305#1; [2025-02-06 06:49:07,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3507: havoc iminor_#t~mem70#1; [2025-02-06 06:49:07,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-1: ldv_mutex_lock_interruptible_12_#res#1 := ldv_mutex_lock_interruptible_12_~ldv_func_res~1#1; [2025-02-06 06:49:07,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5295: havoc get_device_#t~ret301#1.base, get_device_#t~ret301#1.offset; [2025-02-06 06:49:07,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3976: call ULTIMATE.dealloc(serio_raw_connect_~#serio_raw_no~0#1.base, serio_raw_connect_~#serio_raw_no~0#1.offset);havoc serio_raw_connect_~#serio_raw_no~0#1.base, serio_raw_connect_~#serio_raw_no~0#1.offset;call ULTIMATE.dealloc(serio_raw_connect_~#descriptor~0#1.base, serio_raw_connect_~#descriptor~0#1.offset);havoc serio_raw_connect_~#descriptor~0#1.base, serio_raw_connect_~#descriptor~0#1.offset;call ULTIMATE.dealloc(serio_raw_connect_~#__key~0#1.base, serio_raw_connect_~#__key~0#1.offset);havoc serio_raw_connect_~#__key~0#1.base, serio_raw_connect_~#__key~0#1.offset; [2025-02-06 06:49:07,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4175: call ULTIMATE.dealloc(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset);havoc main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset);havoc main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset);havoc main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset);havoc main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset);havoc main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset);havoc main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg9~0#1.base, main_~#ldvarg9~0#1.offset);havoc main_~#ldvarg9~0#1.base, main_~#ldvarg9~0#1.offset; [2025-02-06 06:49:07,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5334: havoc noop_llseek_#t~nondet307#1; [2025-02-06 06:49:07,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4509-1: ldv_mutex_lock_killable_16_#res#1 := ldv_mutex_lock_killable_16_~ldv_func_res~3#1; [2025-02-06 06:49:07,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5270: havoc __serio_register_driver_#t~nondet299#1; [2025-02-06 06:49:07,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5338: havoc prepare_to_wait_event_#t~nondet308#1; [2025-02-06 06:49:07,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3724: call ULTIMATE.dealloc(serio_raw_read_~#c~1#1.base, serio_raw_read_~#c~1#1.offset);havoc serio_raw_read_~#c~1#1.base, serio_raw_read_~#c~1#1.offset;call ULTIMATE.dealloc(serio_raw_read_~#__wait~0#1.base, serio_raw_read_~#__wait~0#1.offset);havoc serio_raw_read_~#__wait~0#1.base, serio_raw_read_~#__wait~0#1.offset; [2025-02-06 06:49:07,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4057: call ULTIMATE.dealloc(serio_raw_reconnect_~#descriptor~1#1.base, serio_raw_reconnect_~#descriptor~1#1.offset);havoc serio_raw_reconnect_~#descriptor~1#1.base, serio_raw_reconnect_~#descriptor~1#1.offset; [2025-02-06 06:49:07,378 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc serio_open_#t~nondet309#1; [2025-02-06 06:49:07,553 INFO L? ?]: Removed 756 outVars from TransFormulas that were not future-live. [2025-02-06 06:49:07,553 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:49:07,585 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:49:07,586 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 06:49:07,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:49:07 BoogieIcfgContainer [2025-02-06 06:49:07,586 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:49:07,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:49:07,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:49:07,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:49:07,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:49:00" (1/3) ... [2025-02-06 06:49:07,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c4e290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:49:07, skipping insertion in model container [2025-02-06 06:49:07,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:01" (2/3) ... [2025-02-06 06:49:07,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c4e290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:49:07, skipping insertion in model container [2025-02-06 06:49:07,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:49:07" (3/3) ... [2025-02-06 06:49:07,592 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i [2025-02-06 06:49:07,603 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:49:07,606 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i that has 41 procedures, 544 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-06 06:49:07,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:49:07,663 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;@789a7616, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:49:07,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:49:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 546 states, 387 states have (on average 1.3281653746770026) internal successors, (514), 411 states have internal predecessors, (514), 115 states have call successors, (115), 40 states have call predecessors, (115), 39 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2025-02-06 06:49:07,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 06:49:07,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:07,679 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:49:07,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:07,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash -630741122, now seen corresponding path program 1 times [2025-02-06 06:49:07,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:07,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917485531] [2025-02-06 06:49:07,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:07,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:08,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 06:49:08,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 06:49:08,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:08,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 06:49:08,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:08,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917485531] [2025-02-06 06:49:08,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917485531] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:49:08,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830222858] [2025-02-06 06:49:08,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:08,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:49:08,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:49:08,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:49:08,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 06:49:09,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 06:49:09,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 06:49:09,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:09,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:09,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 06:49:09,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:49:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-02-06 06:49:09,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:49:09,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830222858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:09,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:49:09,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 06:49:09,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041725076] [2025-02-06 06:49:09,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:09,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 06:49:09,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:09,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 06:49:09,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 06:49:09,748 INFO L87 Difference]: Start difference. First operand has 546 states, 387 states have (on average 1.3281653746770026) internal successors, (514), 411 states have internal predecessors, (514), 115 states have call successors, (115), 40 states have call predecessors, (115), 39 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:49:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:09,862 INFO L93 Difference]: Finished difference Result 1087 states and 1510 transitions. [2025-02-06 06:49:09,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 06:49:09,864 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 168 [2025-02-06 06:49:09,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:09,877 INFO L225 Difference]: With dead ends: 1087 [2025-02-06 06:49:09,877 INFO L226 Difference]: Without dead ends: 532 [2025-02-06 06:49:09,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 06:49:09,889 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:09,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 723 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:49:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-06 06:49:09,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-06 06:49:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 382 states have (on average 1.301047120418848) internal successors, (497), 397 states have internal predecessors, (497), 111 states have call successors, (111), 39 states have call predecessors, (111), 38 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-02-06 06:49:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 711 transitions. [2025-02-06 06:49:09,970 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 711 transitions. Word has length 168 [2025-02-06 06:49:09,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:09,970 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 711 transitions. [2025-02-06 06:49:09,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:49:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 711 transitions. [2025-02-06 06:49:09,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 06:49:09,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:09,978 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:49:09,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 06:49:10,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 06:49:10,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:10,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash 310354052, now seen corresponding path program 1 times [2025-02-06 06:49:10,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:10,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891677264] [2025-02-06 06:49:10,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:10,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:10,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 06:49:10,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 06:49:10,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:10,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:11,183 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-02-06 06:49:11,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:11,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891677264] [2025-02-06 06:49:11,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891677264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:11,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:11,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:11,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105688210] [2025-02-06 06:49:11,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:11,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:11,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:11,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:11,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:11,185 INFO L87 Difference]: Start difference. First operand 532 states and 711 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 06:49:15,203 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-02-06 06:49:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:15,373 INFO L93 Difference]: Finished difference Result 1503 states and 2006 transitions. [2025-02-06 06:49:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:15,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 168 [2025-02-06 06:49:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:15,382 INFO L225 Difference]: With dead ends: 1503 [2025-02-06 06:49:15,383 INFO L226 Difference]: Without dead ends: 1007 [2025-02-06 06:49:15,388 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-02-06 06:49:15,391 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 637 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:15,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1406 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 06:49:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-02-06 06:49:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1001. [2025-02-06 06:49:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 726 states have (on average 1.3057851239669422) internal successors, (948), 749 states have internal predecessors, (948), 199 states have call successors, (199), 76 states have call predecessors, (199), 75 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) [2025-02-06 06:49:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1338 transitions. [2025-02-06 06:49:15,451 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1338 transitions. Word has length 168 [2025-02-06 06:49:15,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:15,451 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1338 transitions. [2025-02-06 06:49:15,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 06:49:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1338 transitions. [2025-02-06 06:49:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 06:49:15,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:15,454 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:49:15,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:49:15,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:15,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:15,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1228862533, now seen corresponding path program 1 times [2025-02-06 06:49:15,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:15,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870143684] [2025-02-06 06:49:15,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:15,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:15,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 06:49:16,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 06:49:16,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:16,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-02-06 06:49:16,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:16,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870143684] [2025-02-06 06:49:16,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870143684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:16,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:16,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:16,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102305425] [2025-02-06 06:49:16,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:16,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:16,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:16,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:16,202 INFO L87 Difference]: Start difference. First operand 1001 states and 1338 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 06:49:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:16,456 INFO L93 Difference]: Finished difference Result 2451 states and 3218 transitions. [2025-02-06 06:49:16,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:16,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 175 [2025-02-06 06:49:16,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:16,465 INFO L225 Difference]: With dead ends: 2451 [2025-02-06 06:49:16,465 INFO L226 Difference]: Without dead ends: 1484 [2025-02-06 06:49:16,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:16,468 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 399 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:16,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1296 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:49:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2025-02-06 06:49:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1458. [2025-02-06 06:49:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1056 states have (on average 1.2821969696969697) internal successors, (1354), 1095 states have internal predecessors, (1354), 272 states have call successors, (272), 132 states have call predecessors, (272), 129 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-02-06 06:49:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1898 transitions. [2025-02-06 06:49:16,567 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1898 transitions. Word has length 175 [2025-02-06 06:49:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:16,567 INFO L471 AbstractCegarLoop]: Abstraction has 1458 states and 1898 transitions. [2025-02-06 06:49:16,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 06:49:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1898 transitions. [2025-02-06 06:49:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-06 06:49:16,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:16,571 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:49:16,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:49:16,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:16,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:16,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1288743675, now seen corresponding path program 1 times [2025-02-06 06:49:16,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:16,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698331481] [2025-02-06 06:49:16,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:16,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:16,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 06:49:17,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 06:49:17,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:17,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-02-06 06:49:17,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:17,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698331481] [2025-02-06 06:49:17,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698331481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:17,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:17,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:17,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228116540] [2025-02-06 06:49:17,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:17,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:17,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:17,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:17,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:17,131 INFO L87 Difference]: Start difference. First operand 1458 states and 1898 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 06:49:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:17,205 INFO L93 Difference]: Finished difference Result 1480 states and 1924 transitions. [2025-02-06 06:49:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:17,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 173 [2025-02-06 06:49:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:17,215 INFO L225 Difference]: With dead ends: 1480 [2025-02-06 06:49:17,215 INFO L226 Difference]: Without dead ends: 1469 [2025-02-06 06:49:17,216 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-02-06 06:49:17,217 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 706 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:17,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 732 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:49:17,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2025-02-06 06:49:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1458. [2025-02-06 06:49:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1056 states have (on average 1.2803030303030303) internal successors, (1352), 1095 states have internal predecessors, (1352), 272 states have call successors, (272), 132 states have call predecessors, (272), 129 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-02-06 06:49:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1896 transitions. [2025-02-06 06:49:17,282 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1896 transitions. Word has length 173 [2025-02-06 06:49:17,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:17,283 INFO L471 AbstractCegarLoop]: Abstraction has 1458 states and 1896 transitions. [2025-02-06 06:49:17,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 06:49:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1896 transitions. [2025-02-06 06:49:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-06 06:49:17,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:17,286 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:49:17,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:49:17,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:17,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:17,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1260114524, now seen corresponding path program 1 times [2025-02-06 06:49:17,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:17,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777218256] [2025-02-06 06:49:17,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:17,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:17,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 06:49:17,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 06:49:17,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:17,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-02-06 06:49:18,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:18,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777218256] [2025-02-06 06:49:18,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777218256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:18,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:18,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:18,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688614965] [2025-02-06 06:49:18,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:18,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:18,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:18,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:18,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:18,019 INFO L87 Difference]: Start difference. First operand 1458 states and 1896 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 06:49:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:18,079 INFO L93 Difference]: Finished difference Result 1460 states and 1897 transitions. [2025-02-06 06:49:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:18,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 173 [2025-02-06 06:49:18,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:18,088 INFO L225 Difference]: With dead ends: 1460 [2025-02-06 06:49:18,088 INFO L226 Difference]: Without dead ends: 1457 [2025-02-06 06:49:18,090 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-02-06 06:49:18,091 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 663 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:18,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 704 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:49:18,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-02-06 06:49:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2025-02-06 06:49:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1056 states have (on average 1.2793560606060606) internal successors, (1351), 1094 states have internal predecessors, (1351), 271 states have call successors, (271), 132 states have call predecessors, (271), 129 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-02-06 06:49:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1894 transitions. [2025-02-06 06:49:18,158 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1894 transitions. Word has length 173 [2025-02-06 06:49:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:18,160 INFO L471 AbstractCegarLoop]: Abstraction has 1457 states and 1894 transitions. [2025-02-06 06:49:18,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 06:49:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1894 transitions. [2025-02-06 06:49:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-06 06:49:18,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:18,161 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:49:18,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:49:18,162 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:18,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:18,163 INFO L85 PathProgramCache]: Analyzing trace with hash -409396268, now seen corresponding path program 1 times [2025-02-06 06:49:18,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:18,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637708515] [2025-02-06 06:49:18,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:18,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:18,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 06:49:18,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 06:49:18,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:18,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-02-06 06:49:18,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:18,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637708515] [2025-02-06 06:49:18,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637708515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:18,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:18,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:18,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762344301] [2025-02-06 06:49:18,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:18,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:18,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:18,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:18,786 INFO L87 Difference]: Start difference. First operand 1457 states and 1894 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 06:49:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:18,849 INFO L93 Difference]: Finished difference Result 1459 states and 1895 transitions. [2025-02-06 06:49:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:18,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 174 [2025-02-06 06:49:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:18,857 INFO L225 Difference]: With dead ends: 1459 [2025-02-06 06:49:18,857 INFO L226 Difference]: Without dead ends: 1456 [2025-02-06 06:49:18,858 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-02-06 06:49:18,858 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 660 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:18,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 702 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:49:18,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2025-02-06 06:49:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1456. [2025-02-06 06:49:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1056 states have (on average 1.2784090909090908) internal successors, (1350), 1093 states have internal predecessors, (1350), 270 states have call successors, (270), 132 states have call predecessors, (270), 129 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-02-06 06:49:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1892 transitions. [2025-02-06 06:49:18,919 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1892 transitions. Word has length 174 [2025-02-06 06:49:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:18,919 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 1892 transitions. [2025-02-06 06:49:18,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 06:49:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1892 transitions. [2025-02-06 06:49:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-06 06:49:18,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:18,921 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:49:18,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:49:18,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:18,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:18,922 INFO L85 PathProgramCache]: Analyzing trace with hash 298758193, now seen corresponding path program 1 times [2025-02-06 06:49:18,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:18,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247052837] [2025-02-06 06:49:18,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:18,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:19,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 06:49:19,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 06:49:19,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:19,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-02-06 06:49:19,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:19,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247052837] [2025-02-06 06:49:19,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247052837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:19,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:19,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:19,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196216156] [2025-02-06 06:49:19,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:19,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:19,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:19,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:19,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:19,405 INFO L87 Difference]: Start difference. First operand 1456 states and 1892 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 06:49:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:19,532 INFO L93 Difference]: Finished difference Result 2916 states and 3786 transitions. [2025-02-06 06:49:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:19,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 178 [2025-02-06 06:49:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:19,539 INFO L225 Difference]: With dead ends: 2916 [2025-02-06 06:49:19,540 INFO L226 Difference]: Without dead ends: 1504 [2025-02-06 06:49:19,543 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-02-06 06:49:19,543 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 98 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:19,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1339 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:49:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-02-06 06:49:19,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1494. [2025-02-06 06:49:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1093 states have (on average 1.2790484903934127) internal successors, (1398), 1130 states have internal predecessors, (1398), 270 states have call successors, (270), 133 states have call predecessors, (270), 130 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-02-06 06:49:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1940 transitions. [2025-02-06 06:49:19,622 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1940 transitions. Word has length 178 [2025-02-06 06:49:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:19,623 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 1940 transitions. [2025-02-06 06:49:19,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 06:49:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1940 transitions. [2025-02-06 06:49:19,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 06:49:19,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:19,624 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:49:19,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 06:49:19,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:19,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash 193064869, now seen corresponding path program 1 times [2025-02-06 06:49:19,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:19,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373218195] [2025-02-06 06:49:19,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:19,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 06:49:20,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 06:49:20,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:20,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-02-06 06:49:20,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:20,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373218195] [2025-02-06 06:49:20,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373218195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:20,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:20,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:20,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081896222] [2025-02-06 06:49:20,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:20,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:20,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:20,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:20,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:20,147 INFO L87 Difference]: Start difference. First operand 1494 states and 1940 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 06:49:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:20,232 INFO L93 Difference]: Finished difference Result 1496 states and 1941 transitions. [2025-02-06 06:49:20,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:20,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 175 [2025-02-06 06:49:20,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:20,240 INFO L225 Difference]: With dead ends: 1496 [2025-02-06 06:49:20,241 INFO L226 Difference]: Without dead ends: 1493 [2025-02-06 06:49:20,241 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-02-06 06:49:20,242 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 657 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:20,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 700 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:49:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2025-02-06 06:49:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1493. [2025-02-06 06:49:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1093 states have (on average 1.2781335773101556) internal successors, (1397), 1129 states have internal predecessors, (1397), 269 states have call successors, (269), 133 states have call predecessors, (269), 130 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-02-06 06:49:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1938 transitions. [2025-02-06 06:49:20,334 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1938 transitions. Word has length 175 [2025-02-06 06:49:20,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:20,334 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1938 transitions. [2025-02-06 06:49:20,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 06:49:20,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1938 transitions. [2025-02-06 06:49:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-06 06:49:20,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:20,336 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:49:20,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 06:49:20,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:20,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:20,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1689489909, now seen corresponding path program 1 times [2025-02-06 06:49:20,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:20,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493763285] [2025-02-06 06:49:20,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:20,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:20,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-06 06:49:20,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-06 06:49:20,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:20,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-02-06 06:49:21,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:21,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493763285] [2025-02-06 06:49:21,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493763285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:21,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:21,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802581268] [2025-02-06 06:49:21,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:21,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:21,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:21,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:21,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:21,011 INFO L87 Difference]: Start difference. First operand 1493 states and 1938 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 06:49:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:21,206 INFO L93 Difference]: Finished difference Result 4071 states and 5352 transitions. [2025-02-06 06:49:21,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:21,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 176 [2025-02-06 06:49:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:21,222 INFO L225 Difference]: With dead ends: 4071 [2025-02-06 06:49:21,222 INFO L226 Difference]: Without dead ends: 2654 [2025-02-06 06:49:21,227 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-02-06 06:49:21,229 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 640 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:21,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1411 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:49:21,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2025-02-06 06:49:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2628. [2025-02-06 06:49:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 1953 states have (on average 1.2892985151049667) internal successors, (2518), 2022 states have internal predecessors, (2518), 453 states have call successors, (453), 231 states have call predecessors, (453), 221 states have return successors, (483), 422 states have call predecessors, (483), 445 states have call successors, (483) [2025-02-06 06:49:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 3454 transitions. [2025-02-06 06:49:21,376 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 3454 transitions. Word has length 176 [2025-02-06 06:49:21,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:21,376 INFO L471 AbstractCegarLoop]: Abstraction has 2628 states and 3454 transitions. [2025-02-06 06:49:21,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 06:49:21,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 3454 transitions. [2025-02-06 06:49:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-06 06:49:21,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:21,382 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:49:21,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 06:49:21,382 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:21,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:21,382 INFO L85 PathProgramCache]: Analyzing trace with hash 299055092, now seen corresponding path program 1 times [2025-02-06 06:49:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:21,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505497464] [2025-02-06 06:49:21,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:21,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:21,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-06 06:49:21,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-06 06:49:21,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:21,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2025-02-06 06:49:21,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:21,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505497464] [2025-02-06 06:49:21,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505497464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:21,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:21,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:21,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329217223] [2025-02-06 06:49:21,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:21,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:21,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:21,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:21,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:21,990 INFO L87 Difference]: Start difference. First operand 2628 states and 3454 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-06 06:49:26,008 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-02-06 06:49:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:26,273 INFO L93 Difference]: Finished difference Result 6810 states and 8966 transitions. [2025-02-06 06:49:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:26,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 230 [2025-02-06 06:49:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:26,291 INFO L225 Difference]: With dead ends: 6810 [2025-02-06 06:49:26,292 INFO L226 Difference]: Without dead ends: 4266 [2025-02-06 06:49:26,297 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-02-06 06:49:26,298 INFO L435 NwaCegarLoop]: 1099 mSDtfsCounter, 597 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:26,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 1683 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 06:49:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2025-02-06 06:49:26,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 4218. [2025-02-06 06:49:26,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4218 states, 3201 states have (on average 1.3002186816619807) internal successors, (4162), 3282 states have internal predecessors, (4162), 657 states have call successors, (657), 373 states have call predecessors, (657), 359 states have return successors, (715), 622 states have call predecessors, (715), 649 states have call successors, (715) [2025-02-06 06:49:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4218 states to 4218 states and 5534 transitions. [2025-02-06 06:49:26,472 INFO L78 Accepts]: Start accepts. Automaton has 4218 states and 5534 transitions. Word has length 230 [2025-02-06 06:49:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:26,472 INFO L471 AbstractCegarLoop]: Abstraction has 4218 states and 5534 transitions. [2025-02-06 06:49:26,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-06 06:49:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 4218 states and 5534 transitions. [2025-02-06 06:49:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-06 06:49:26,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:26,479 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:49:26,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 06:49:26,479 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:26,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash 640899518, now seen corresponding path program 1 times [2025-02-06 06:49:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983231839] [2025-02-06 06:49:26,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:26,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:26,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-06 06:49:26,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-06 06:49:26,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:26,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-02-06 06:49:27,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:27,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983231839] [2025-02-06 06:49:27,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983231839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:27,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:27,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:49:27,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546199530] [2025-02-06 06:49:27,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:27,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:49:27,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:27,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:49:27,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:49:27,296 INFO L87 Difference]: Start difference. First operand 4218 states and 5534 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 06:49:31,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:49:31,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:31,661 INFO L93 Difference]: Finished difference Result 10678 states and 13972 transitions. [2025-02-06 06:49:31,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:49:31,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 260 [2025-02-06 06:49:31,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:31,693 INFO L225 Difference]: With dead ends: 10678 [2025-02-06 06:49:31,694 INFO L226 Difference]: Without dead ends: 6544 [2025-02-06 06:49:31,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:49:31,708 INFO L435 NwaCegarLoop]: 1309 mSDtfsCounter, 615 mSDsluCounter, 1998 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 3307 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:31,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 3307 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 06:49:31,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6544 states. [2025-02-06 06:49:31,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6544 to 4234. [2025-02-06 06:49:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4234 states, 3217 states have (on average 1.298725520671433) internal successors, (4178), 3298 states have internal predecessors, (4178), 657 states have call successors, (657), 373 states have call predecessors, (657), 359 states have return successors, (715), 622 states have call predecessors, (715), 649 states have call successors, (715) [2025-02-06 06:49:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 5550 transitions. [2025-02-06 06:49:31,912 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 5550 transitions. Word has length 260 [2025-02-06 06:49:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:31,912 INFO L471 AbstractCegarLoop]: Abstraction has 4234 states and 5550 transitions. [2025-02-06 06:49:31,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 06:49:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 5550 transitions. [2025-02-06 06:49:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-06 06:49:31,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:31,916 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:49:31,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 06:49:31,916 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:31,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:31,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1517634192, now seen corresponding path program 1 times [2025-02-06 06:49:31,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:31,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785785416] [2025-02-06 06:49:31,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:31,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:32,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-06 06:49:32,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-06 06:49:32,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:32,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-02-06 06:49:32,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:32,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785785416] [2025-02-06 06:49:32,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785785416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:32,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:32,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:32,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824611422] [2025-02-06 06:49:32,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:32,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:32,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:32,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:32,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:32,491 INFO L87 Difference]: Start difference. First operand 4234 states and 5550 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 06:49:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:32,668 INFO L93 Difference]: Finished difference Result 8384 states and 11010 transitions. [2025-02-06 06:49:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:32,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 260 [2025-02-06 06:49:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:32,699 INFO L225 Difference]: With dead ends: 8384 [2025-02-06 06:49:32,699 INFO L226 Difference]: Without dead ends: 4234 [2025-02-06 06:49:32,710 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-02-06 06:49:32,711 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 0 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:32,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1384 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:49:32,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2025-02-06 06:49:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 4234. [2025-02-06 06:49:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4234 states, 3217 states have (on average 1.2875349704693815) internal successors, (4142), 3298 states have internal predecessors, (4142), 657 states have call successors, (657), 373 states have call predecessors, (657), 359 states have return successors, (715), 622 states have call predecessors, (715), 649 states have call successors, (715) [2025-02-06 06:49:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 5514 transitions. [2025-02-06 06:49:32,890 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 5514 transitions. Word has length 260 [2025-02-06 06:49:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:32,890 INFO L471 AbstractCegarLoop]: Abstraction has 4234 states and 5514 transitions. [2025-02-06 06:49:32,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 06:49:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 5514 transitions. [2025-02-06 06:49:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-06 06:49:32,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:32,894 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:49:32,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 06:49:32,895 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:32,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:32,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1457035947, now seen corresponding path program 1 times [2025-02-06 06:49:32,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:32,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701725031] [2025-02-06 06:49:32,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:32,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:33,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-06 06:49:33,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-06 06:49:33,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:33,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:33,646 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-02-06 06:49:33,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:33,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701725031] [2025-02-06 06:49:33,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701725031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:33,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:33,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:33,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821795229] [2025-02-06 06:49:33,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:33,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:33,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:33,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:33,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:33,649 INFO L87 Difference]: Start difference. First operand 4234 states and 5514 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 06:49:37,681 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-02-06 06:49:37,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:37,944 INFO L93 Difference]: Finished difference Result 8386 states and 10923 transitions. [2025-02-06 06:49:37,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:37,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 262 [2025-02-06 06:49:37,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:37,972 INFO L225 Difference]: With dead ends: 8386 [2025-02-06 06:49:37,972 INFO L226 Difference]: Without dead ends: 4236 [2025-02-06 06:49:37,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:37,986 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 550 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:37,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1675 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 06:49:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2025-02-06 06:49:38,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 4161. [2025-02-06 06:49:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4161 states, 3171 states have (on average 1.2853989277830338) internal successors, (4076), 3248 states have internal predecessors, (4076), 634 states have call successors, (634), 359 states have call predecessors, (634), 355 states have return successors, (644), 613 states have call predecessors, (644), 614 states have call successors, (644) [2025-02-06 06:49:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 5354 transitions. [2025-02-06 06:49:38,263 INFO L78 Accepts]: Start accepts. Automaton has 4161 states and 5354 transitions. Word has length 262 [2025-02-06 06:49:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:38,263 INFO L471 AbstractCegarLoop]: Abstraction has 4161 states and 5354 transitions. [2025-02-06 06:49:38,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 06:49:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4161 states and 5354 transitions. [2025-02-06 06:49:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-06 06:49:38,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:38,268 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:49:38,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 06:49:38,268 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:38,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:38,269 INFO L85 PathProgramCache]: Analyzing trace with hash 177172269, now seen corresponding path program 1 times [2025-02-06 06:49:38,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:38,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646355104] [2025-02-06 06:49:38,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:38,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:38,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-06 06:49:39,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-06 06:49:39,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:39,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-02-06 06:49:39,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:39,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646355104] [2025-02-06 06:49:39,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646355104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:39,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:39,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:49:39,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133470685] [2025-02-06 06:49:39,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:39,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:49:39,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:39,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:49:39,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:49:39,382 INFO L87 Difference]: Start difference. First operand 4161 states and 5354 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 06:49:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:39,686 INFO L93 Difference]: Finished difference Result 4188 states and 5390 transitions. [2025-02-06 06:49:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:49:39,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 262 [2025-02-06 06:49:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:39,705 INFO L225 Difference]: With dead ends: 4188 [2025-02-06 06:49:39,705 INFO L226 Difference]: Without dead ends: 4166 [2025-02-06 06:49:39,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:49:39,708 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 1 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:39,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2791 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:49:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2025-02-06 06:49:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 4152. [2025-02-06 06:49:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 3167 states have (on average 1.2844963688032838) internal successors, (4068), 3241 states have internal predecessors, (4068), 630 states have call successors, (630), 358 states have call predecessors, (630), 354 states have return successors, (641), 612 states have call predecessors, (641), 611 states have call successors, (641) [2025-02-06 06:49:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 5339 transitions. [2025-02-06 06:49:39,881 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 5339 transitions. Word has length 262 [2025-02-06 06:49:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:39,881 INFO L471 AbstractCegarLoop]: Abstraction has 4152 states and 5339 transitions. [2025-02-06 06:49:39,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 06:49:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 5339 transitions. [2025-02-06 06:49:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-06 06:49:39,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:39,885 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:49:39,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 06:49:39,885 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:39,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:39,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1095820269, now seen corresponding path program 1 times [2025-02-06 06:49:39,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:39,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248397595] [2025-02-06 06:49:39,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:39,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:40,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-06 06:49:40,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-06 06:49:40,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:40,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-02-06 06:49:40,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:40,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248397595] [2025-02-06 06:49:40,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248397595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:40,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:40,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:49:40,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701196779] [2025-02-06 06:49:40,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:40,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:49:40,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:40,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:49:40,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:49:40,725 INFO L87 Difference]: Start difference. First operand 4152 states and 5339 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-06 06:49:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:41,031 INFO L93 Difference]: Finished difference Result 7797 states and 10052 transitions. [2025-02-06 06:49:41,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:49:41,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 295 [2025-02-06 06:49:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:41,049 INFO L225 Difference]: With dead ends: 7797 [2025-02-06 06:49:41,050 INFO L226 Difference]: Without dead ends: 3729 [2025-02-06 06:49:41,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:49:41,061 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 0 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:41,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2760 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:49:41,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2025-02-06 06:49:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 3729. [2025-02-06 06:49:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3729 states, 2843 states have (on average 1.2866690116074568) internal successors, (3658), 2903 states have internal predecessors, (3658), 571 states have call successors, (571), 316 states have call predecessors, (571), 314 states have return successors, (584), 557 states have call predecessors, (584), 554 states have call successors, (584) [2025-02-06 06:49:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3729 states to 3729 states and 4813 transitions. [2025-02-06 06:49:41,214 INFO L78 Accepts]: Start accepts. Automaton has 3729 states and 4813 transitions. Word has length 295 [2025-02-06 06:49:41,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:41,215 INFO L471 AbstractCegarLoop]: Abstraction has 3729 states and 4813 transitions. [2025-02-06 06:49:41,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-06 06:49:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3729 states and 4813 transitions. [2025-02-06 06:49:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-06 06:49:41,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:41,223 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:49:41,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 06:49:41,224 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:41,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:41,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1151127208, now seen corresponding path program 1 times [2025-02-06 06:49:41,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:41,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696999947] [2025-02-06 06:49:41,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:41,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:41,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-06 06:49:41,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-06 06:49:41,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:41,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2025-02-06 06:49:41,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:41,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696999947] [2025-02-06 06:49:41,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696999947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:41,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:41,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:49:41,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544083094] [2025-02-06 06:49:41,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:41,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:49:41,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:41,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:49:41,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:49:41,857 INFO L87 Difference]: Start difference. First operand 3729 states and 4813 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-02-06 06:49:45,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:49:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:46,177 INFO L93 Difference]: Finished difference Result 8991 states and 11541 transitions. [2025-02-06 06:49:46,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:49:46,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 352 [2025-02-06 06:49:46,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:46,197 INFO L225 Difference]: With dead ends: 8991 [2025-02-06 06:49:46,197 INFO L226 Difference]: Without dead ends: 5346 [2025-02-06 06:49:46,205 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-02-06 06:49:46,206 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 473 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:46,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1486 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 46 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 06:49:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5346 states. [2025-02-06 06:49:46,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5346 to 5167. [2025-02-06 06:49:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5167 states, 3999 states have (on average 1.2798199549887472) internal successors, (5118), 4087 states have internal predecessors, (5118), 708 states have call successors, (708), 458 states have call predecessors, (708), 459 states have return successors, (729), 687 states have call predecessors, (729), 689 states have call successors, (729) [2025-02-06 06:49:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 6555 transitions. [2025-02-06 06:49:46,397 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 6555 transitions. Word has length 352 [2025-02-06 06:49:46,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:46,398 INFO L471 AbstractCegarLoop]: Abstraction has 5167 states and 6555 transitions. [2025-02-06 06:49:46,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-02-06 06:49:46,399 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 6555 transitions. [2025-02-06 06:49:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-02-06 06:49:46,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:46,405 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:49:46,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 06:49:46,405 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:46,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:46,406 INFO L85 PathProgramCache]: Analyzing trace with hash 478801032, now seen corresponding path program 1 times [2025-02-06 06:49:46,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:46,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732875753] [2025-02-06 06:49:46,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:46,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:46,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-02-06 06:49:46,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-02-06 06:49:46,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:46,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2025-02-06 06:49:47,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:47,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732875753] [2025-02-06 06:49:47,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732875753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:47,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:47,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 06:49:47,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219815732] [2025-02-06 06:49:47,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:47,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:49:47,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:47,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:49:47,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:49:47,241 INFO L87 Difference]: Start difference. First operand 5167 states and 6555 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 5 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-06 06:49:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:47,422 INFO L93 Difference]: Finished difference Result 5216 states and 6615 transitions. [2025-02-06 06:49:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:49:47,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 5 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) Word has length 351 [2025-02-06 06:49:47,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:47,435 INFO L225 Difference]: With dead ends: 5216 [2025-02-06 06:49:47,435 INFO L226 Difference]: Without dead ends: 5138 [2025-02-06 06:49:47,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:49:47,437 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 1 mSDsluCounter, 2782 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3482 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:47,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3482 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:49:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2025-02-06 06:49:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 5106. [2025-02-06 06:49:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5106 states, 3945 states have (on average 1.273764258555133) internal successors, (5025), 4032 states have internal predecessors, (5025), 702 states have call successors, (702), 457 states have call predecessors, (702), 458 states have return successors, (724), 682 states have call predecessors, (724), 684 states have call successors, (724) [2025-02-06 06:49:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5106 states to 5106 states and 6451 transitions. [2025-02-06 06:49:47,580 INFO L78 Accepts]: Start accepts. Automaton has 5106 states and 6451 transitions. Word has length 351 [2025-02-06 06:49:47,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:47,581 INFO L471 AbstractCegarLoop]: Abstraction has 5106 states and 6451 transitions. [2025-02-06 06:49:47,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 5 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-06 06:49:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 5106 states and 6451 transitions. [2025-02-06 06:49:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-02-06 06:49:47,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:47,587 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:49:47,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 06:49:47,587 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:47,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:47,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1667630284, now seen corresponding path program 1 times [2025-02-06 06:49:47,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:47,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018594900] [2025-02-06 06:49:47,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:47,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:48,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-02-06 06:49:48,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-02-06 06:49:48,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:48,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2025-02-06 06:49:48,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:48,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018594900] [2025-02-06 06:49:48,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018594900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:48,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:48,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 06:49:48,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289283526] [2025-02-06 06:49:48,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:48,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:49:48,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:48,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:49:48,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:49:48,846 INFO L87 Difference]: Start difference. First operand 5106 states and 6451 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-06 06:49:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:49,131 INFO L93 Difference]: Finished difference Result 5206 states and 6556 transitions. [2025-02-06 06:49:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:49:49,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) Word has length 358 [2025-02-06 06:49:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:49,145 INFO L225 Difference]: With dead ends: 5206 [2025-02-06 06:49:49,145 INFO L226 Difference]: Without dead ends: 4933 [2025-02-06 06:49:49,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:49:49,146 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 1 mSDsluCounter, 2774 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3472 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:49,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3472 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:49:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4933 states. [2025-02-06 06:49:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4933 to 4917. [2025-02-06 06:49:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4917 states, 3806 states have (on average 1.2722017866526536) internal successors, (4842), 3885 states have internal predecessors, (4842), 665 states have call successors, (665), 443 states have call predecessors, (665), 445 states have return successors, (689), 650 states have call predecessors, (689), 649 states have call successors, (689) [2025-02-06 06:49:49,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4917 states to 4917 states and 6196 transitions. [2025-02-06 06:49:49,310 INFO L78 Accepts]: Start accepts. Automaton has 4917 states and 6196 transitions. Word has length 358 [2025-02-06 06:49:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:49,311 INFO L471 AbstractCegarLoop]: Abstraction has 4917 states and 6196 transitions. [2025-02-06 06:49:49,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-06 06:49:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4917 states and 6196 transitions. [2025-02-06 06:49:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-02-06 06:49:49,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:49,318 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:49:49,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 06:49:49,318 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:49,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:49,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1918763431, now seen corresponding path program 1 times [2025-02-06 06:49:49,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:49,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023857129] [2025-02-06 06:49:49,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:49,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:49,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-02-06 06:49:49,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-02-06 06:49:49,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:49,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2025-02-06 06:49:50,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:50,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023857129] [2025-02-06 06:49:50,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023857129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:50,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:50,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 06:49:50,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366588241] [2025-02-06 06:49:50,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:50,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:49:50,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:50,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:49:50,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:49:50,296 INFO L87 Difference]: Start difference. First operand 4917 states and 6196 transitions. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 3 states have call predecessors, (35), 1 states have call successors, (35) [2025-02-06 06:49:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:50,525 INFO L93 Difference]: Finished difference Result 9834 states and 12450 transitions. [2025-02-06 06:49:50,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:49:50,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 3 states have call predecessors, (35), 1 states have call successors, (35) Word has length 364 [2025-02-06 06:49:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:50,543 INFO L225 Difference]: With dead ends: 9834 [2025-02-06 06:49:50,544 INFO L226 Difference]: Without dead ends: 5001 [2025-02-06 06:49:50,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:49:50,552 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 15 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3465 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:50,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 3465 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:49:50,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2025-02-06 06:49:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 4969. [2025-02-06 06:49:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4969 states, 3858 states have (on average 1.2747537584240538) internal successors, (4918), 3937 states have internal predecessors, (4918), 673 states have call successors, (673), 443 states have call predecessors, (673), 437 states have return successors, (689), 650 states have call predecessors, (689), 657 states have call successors, (689) [2025-02-06 06:49:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4969 states to 4969 states and 6280 transitions. [2025-02-06 06:49:50,739 INFO L78 Accepts]: Start accepts. Automaton has 4969 states and 6280 transitions. Word has length 364 [2025-02-06 06:49:50,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:50,740 INFO L471 AbstractCegarLoop]: Abstraction has 4969 states and 6280 transitions. [2025-02-06 06:49:50,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 3 states have call predecessors, (35), 1 states have call successors, (35) [2025-02-06 06:49:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4969 states and 6280 transitions. [2025-02-06 06:49:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-02-06 06:49:50,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:49:50,748 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:49:50,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 06:49:50,748 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:49:50,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:49:50,749 INFO L85 PathProgramCache]: Analyzing trace with hash 44758167, now seen corresponding path program 1 times [2025-02-06 06:49:50,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:49:50,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130580996] [2025-02-06 06:49:50,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:49:50,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:49:51,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-02-06 06:49:51,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-02-06 06:49:51,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:49:51,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:49:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2025-02-06 06:49:51,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:49:51,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130580996] [2025-02-06 06:49:51,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130580996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:49:51,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:49:51,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 06:49:51,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418155066] [2025-02-06 06:49:51,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:49:51,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:49:51,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:49:51,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:49:51,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:49:51,839 INFO L87 Difference]: Start difference. First operand 4969 states and 6280 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-06 06:49:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:49:52,090 INFO L93 Difference]: Finished difference Result 5079 states and 6392 transitions. [2025-02-06 06:49:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:49:52,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) Word has length 366 [2025-02-06 06:49:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:49:52,097 INFO L225 Difference]: With dead ends: 5079 [2025-02-06 06:49:52,097 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 06:49:52,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:49:52,103 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 28 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:49:52,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3350 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:49:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 06:49:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 06:49:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:49:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 06:49:52,108 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 366 [2025-02-06 06:49:52,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:49:52,108 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 06:49:52,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-06 06:49:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 06:49:52,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 06:49:52,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 06:49:52,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 06:49:52,113 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:49:52,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.