./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--char--lp.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--char--lp.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 5bdb144d16ce690b0c83c76766410e2201d517c4cbaa861cb0d7e2bbbb9cb236 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:45:53,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:45:53,125 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:45:53,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:45:53,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:45:53,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:45:53,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:45:53,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:45:53,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:45:53,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:45:53,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:45:53,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:45:53,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:45:53,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:45:53,147 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:45:53,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:45:53,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:45:53,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:45:53,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:45:53,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:45:53,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:45:53,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:45:53,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:45:53,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:45:53,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:45:53,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:45:53,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:45:53,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:45:53,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:45:53,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:45:53,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:45:53,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:45:53,148 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:45:53,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:45:53,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:45:53,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:45:53,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:45:53,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:45:53,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:45:53,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:45:53,149 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 -> 5bdb144d16ce690b0c83c76766410e2201d517c4cbaa861cb0d7e2bbbb9cb236 [2025-02-06 06:45:53,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:45:53,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:45:53,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:45:53,340 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:45:53,340 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:45:53,342 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--char--lp.ko-entry_point.cil.out.i [2025-02-06 06:45:54,464 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df0ae2400/22881f3eb6fa44b5b3e129f61e5aabdd/FLAG220fc8a2c [2025-02-06 06:45:54,875 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:45:54,876 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--char--lp.ko-entry_point.cil.out.i [2025-02-06 06:45:54,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df0ae2400/22881f3eb6fa44b5b3e129f61e5aabdd/FLAG220fc8a2c [2025-02-06 06:45:54,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df0ae2400/22881f3eb6fa44b5b3e129f61e5aabdd [2025-02-06 06:45:54,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:45:54,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:45:54,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:45:54,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:45:54,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:45:54,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:45:54" (1/1) ... [2025-02-06 06:45:54,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54eebe7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:54, skipping insertion in model container [2025-02-06 06:45:54,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:45:54" (1/1) ... [2025-02-06 06:45:55,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:45:55,837 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--char--lp.ko-entry_point.cil.out.i[147706,147719] [2025-02-06 06:45:55,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:45:56,033 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:45:56,106 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [3376] [2025-02-06 06:45:56,107 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %2, %0; setc %1": "+m" (*addr), "=qm" (c): "Ir" (nr): "memory"); [3384-3385] [2025-02-06 06:45:56,108 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; btr %2, %0; setc %1": "+m" (*addr), "=qm" (c): "Ir" (nr): "memory"); [3393-3394] [2025-02-06 06:45:56,109 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3402-3403] [2025-02-06 06:45:56,109 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [3421] [2025-02-06 06:45:56,110 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3424] [2025-02-06 06:45:56,111 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3427] [2025-02-06 06:45:56,111 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3430] [2025-02-06 06:45:56,111 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& cpu_tss.x86_tss.sp0)); [3451] [2025-02-06 06:45:56,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& cpu_tss.x86_tss.sp0)); [3454] [2025-02-06 06:45:56,115 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& cpu_tss.x86_tss.sp0)); [3457] [2025-02-06 06:45:56,115 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& cpu_tss.x86_tss.sp0)); [3460] [2025-02-06 06:45:56,263 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--char--lp.ko-entry_point.cil.out.i[147706,147719] [2025-02-06 06:45:56,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:45:56,349 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:45:56,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:56 WrapperNode [2025-02-06 06:45:56,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:45:56,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:45:56,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:45:56,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:45:56,356 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:45:56" (1/1) ... [2025-02-06 06:45:56,405 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:45:56" (1/1) ... [2025-02-06 06:45:56,501 INFO L138 Inliner]: procedures = 224, calls = 1326, calls flagged for inlining = 80, calls inlined = 75, statements flattened = 3189 [2025-02-06 06:45:56,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:45:56,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:45:56,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:45:56,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:45:56,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:56" (1/1) ... [2025-02-06 06:45:56,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:56" (1/1) ... [2025-02-06 06:45:56,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:56" (1/1) ... [2025-02-06 06:45:56,679 INFO L175 MemorySlicer]: Split 824 memory accesses to 20 slices as follows [16, 2, 5, 1, 5, 29, 15, 15, 26, 6, 3, 5, 1, 8, 12, 3, 647, 14, 8, 3]. 79 percent of accesses are in the largest equivalence class. The 518 initializations are split as follows [0, 2, 5, 0, 5, 0, 8, 8, 0, 6, 3, 5, 0, 8, 0, 3, 451, 3, 8, 3]. The 150 writes are split as follows [16, 0, 0, 0, 0, 29, 3, 0, 26, 0, 0, 0, 1, 0, 2, 0, 63, 10, 0, 0]. [2025-02-06 06:45:56,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:56" (1/1) ... [2025-02-06 06:45:56,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:56" (1/1) ... [2025-02-06 06:45:56,750 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:56" (1/1) ... [2025-02-06 06:45:56,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:56" (1/1) ... [2025-02-06 06:45:56,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:56" (1/1) ... [2025-02-06 06:45:56,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:56" (1/1) ... [2025-02-06 06:45:56,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:45:56,800 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:45:56,800 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:45:56,800 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:45:56,801 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:56" (1/1) ... [2025-02-06 06:45:56,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:45:56,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:45:56,824 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:45:56,825 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:45:56,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_port_mutex_of_lp_struct [2025-02-06 06:45:56,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_port_mutex_of_lp_struct [2025-02-06 06:45:56,842 INFO L130 BoogieDeclarations]: Found specification of procedure lp_error [2025-02-06 06:45:56,842 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_error [2025-02-06 06:45:56,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:45:56,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:45:56,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:45:56,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 06:45:56,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 06:45:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 06:45:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 06:45:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 06:45:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 06:45:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 06:45:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-06 06:45:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-06 06:45:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-06 06:45:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-06 06:45:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-06 06:45:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-06 06:45:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-06 06:45:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-06 06:45:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-06 06:45:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-02-06 06:45:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 06:45:56,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 06:45:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-02-06 06:45:56,844 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-02-06 06:45:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure lp_register [2025-02-06 06:45:56,844 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_register [2025-02-06 06:45:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure file_inode [2025-02-06 06:45:56,844 INFO L138 BoogieDeclarations]: Found implementation of procedure file_inode [2025-02-06 06:45:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-02-06 06:45:56,845 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-02-06 06:45:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure lp_release_parport [2025-02-06 06:45:56,845 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_release_parport [2025-02-06 06:45:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:45:56,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:45:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-02-06 06:45:56,845 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-02-06 06:45:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 06:45:56,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 06:45:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 06:45:56,845 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 06:45:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-02-06 06:45:56,845 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-02-06 06:45:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2025-02-06 06:45:56,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2025-02-06 06:45:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_port_mutex_of_lp_struct [2025-02-06 06:45:56,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_port_mutex_of_lp_struct [2025-02-06 06:45:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:45:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure lp_set_timeout [2025-02-06 06:45:56,846 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_set_timeout [2025-02-06 06:45:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure lp_reset [2025-02-06 06:45:56,846 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_reset [2025-02-06 06:45:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_25 [2025-02-06 06:45:56,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_25 [2025-02-06 06:45:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:45:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:45:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:45:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:45:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-06 06:45:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-02-06 06:45:56,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2025-02-06 06:45:56,848 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-02-06 06:45:56,848 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure parport_write [2025-02-06 06:45:56,848 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_write [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-06 06:45:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-06 06:45:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-06 06:45:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-06 06:45:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-06 06:45:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-06 06:45:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 06:45:56,849 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 06:45:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2025-02-06 06:45:56,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2025-02-06 06:45:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lp_mutex [2025-02-06 06:45:56,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lp_mutex [2025-02-06 06:45:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure test_ti_thread_flag [2025-02-06 06:45:56,849 INFO L138 BoogieDeclarations]: Found implementation of procedure test_ti_thread_flag [2025-02-06 06:45:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure parport_negotiate [2025-02-06 06:45:56,849 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_negotiate [2025-02-06 06:45:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure parport_release [2025-02-06 06:45:56,849 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_release [2025-02-06 06:45:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_console [2025-02-06 06:45:56,849 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_console [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure parport_set_timeout [2025-02-06 06:45:56,851 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_set_timeout [2025-02-06 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure parport_claim_or_block [2025-02-06 06:45:56,852 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_claim_or_block [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure lp_do_ioctl [2025-02-06 06:45:56,852 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_do_ioctl [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2025-02-06 06:45:56,852 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-06 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-06 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-06 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-02-06 06:45:56,853 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-02-06 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 06:45:56,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-02-06 06:45:56,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-02-06 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure lp_claim_parport_or_block [2025-02-06 06:45:56,856 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_claim_parport_or_block [2025-02-06 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure compat_ptr [2025-02-06 06:45:56,856 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_ptr [2025-02-06 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2025-02-06 06:45:56,856 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2025-02-06 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-02-06 06:45:56,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-02-06 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-02-06 06:45:56,856 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-02-06 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-02-06 06:45:56,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-02-06 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2025-02-06 06:45:56,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __bad_percpu_size [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure lp_detach [2025-02-06 06:45:56,857 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_detach [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lp_mutex [2025-02-06 06:45:56,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lp_mutex [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-02-06 06:45:56,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure lp_negotiate [2025-02-06 06:45:56,857 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_negotiate [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2025-02-06 06:45:56,857 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait [2025-02-06 06:45:56,857 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure lp_wait_ready [2025-02-06 06:45:56,857 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_wait_ready [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2025-02-06 06:45:56,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2025-02-06 06:45:56,857 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 06:45:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 06:45:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 06:45:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-06 06:45:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-06 06:45:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-06 06:45:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure lp_write [2025-02-06 06:45:56,858 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_write [2025-02-06 06:45:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2025-02-06 06:45:56,858 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2025-02-06 06:45:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-02-06 06:45:56,858 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-02-06 06:45:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:45:56,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:45:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure parport_yield_blocking [2025-02-06 06:45:56,858 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_yield_blocking [2025-02-06 06:45:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-02-06 06:45:56,858 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-02-06 06:45:57,370 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:45:57,372 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:45:57,489 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3868: call ULTIMATE.dealloc(~#wait~0.base, ~#wait~0.offset);havoc ~#wait~0.base, ~#wait~0.offset; [2025-02-06 06:45:57,491 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 06:45:57,560 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6259: havoc parport_register_device_#t~ret597#1.base, parport_register_device_#t~ret597#1.offset; [2025-02-06 06:45:57,561 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6189: havoc device_create_#t~ret583#1.base, device_create_#t~ret583#1.offset; [2025-02-06 06:45:57,564 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3687: havoc #t~mem69.base, #t~mem69.offset; [2025-02-06 06:45:57,687 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6229: havoc #t~nondet590; [2025-02-06 06:45:57,690 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6276: havoc #t~nondet599; [2025-02-06 06:45:57,693 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6283: havoc #t~nondet600; [2025-02-06 06:45:57,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6252: havoc #t~nondet595; [2025-02-06 06:45:57,711 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6301: havoc #t~nondet603; [2025-02-06 06:45:57,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6266: havoc #t~nondet598; [2025-02-06 06:45:57,717 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6248: havoc #t~nondet594; [2025-02-06 06:45:57,861 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5267-1: ldv_mutex_lock_interruptible_18_#res#1 := ldv_mutex_lock_interruptible_18_~ldv_func_res~3#1; [2025-02-06 06:45:57,862 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4327: call ULTIMATE.dealloc(~#status~2#1.base, ~#status~2#1.offset);havoc ~#status~2#1.base, ~#status~2#1.offset; [2025-02-06 06:45:57,875 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6179: havoc _copy_to_user_#t~nondet581#1; [2025-02-06 06:45:57,933 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6175: havoc _copy_from_user_#t~nondet580#1; [2025-02-06 06:45:57,958 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3681: havoc #t~mem68; [2025-02-06 06:45:58,047 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6293: havoc #t~nondet601; [2025-02-06 06:45:58,149 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5209-1: ldv_mutex_lock_interruptible_12_#res#1 := ldv_mutex_lock_interruptible_12_~ldv_func_res~1#1; [2025-02-06 06:46:03,239 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6214: havoc ldv_probe_2_#t~nondet587#1; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6218: havoc ldv_release_1_#t~nondet588#1; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6186: havoc compat_get_timeval_#t~nondet582#1; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5230-1: ldv_mutex_lock_interruptible_14_#res#1 := ldv_mutex_lock_interruptible_14_~ldv_func_res~2#1; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6222: havoc ldv_release_2_#t~nondet589#1; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6256: havoc parport_read_#t~nondet596#1; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4475: call ULTIMATE.dealloc(lp_compat_ioctl_~#par_timeout~1#1.base, lp_compat_ioctl_~#par_timeout~1#1.offset);havoc lp_compat_ioctl_~#par_timeout~1#1.base, lp_compat_ioctl_~#par_timeout~1#1.offset; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6160: havoc __parport_register_driver_#t~nondet577#1; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4445: call ULTIMATE.dealloc(lp_ioctl_~#par_timeout~0#1.base, lp_ioctl_~#par_timeout~0#1.offset);havoc lp_ioctl_~#par_timeout~0#1.base, lp_ioctl_~#par_timeout~0#1.offset; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6164: havoc __register_chrdev_#t~nondet578#1; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6297: havoc simple_strtoul_#t~nondet602#1; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3655: havoc __kmalloc_#t~ret65#1.base, __kmalloc_#t~ret65#1.offset; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6199: havoc ldv_close_1_#t~nondet584#1; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4118: call ULTIMATE.dealloc(lp_read_~#wait~1#1.base, lp_read_~#wait~1#1.offset);havoc lp_read_~#wait~1#1.base, lp_read_~#wait~1#1.offset; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4681: call ULTIMATE.dealloc(lp_init_~#__key~0#1.base, lp_init_~#__key~0#1.offset);havoc lp_init_~#__key~0#1.base, lp_init_~#__key~0#1.offset;call ULTIMATE.dealloc(lp_init_~#__key___0~0#1.base, lp_init_~#__key___0~0#1.offset);havoc lp_init_~#__key___0~0#1.base, lp_init_~#__key___0~0#1.offset;call ULTIMATE.dealloc(lp_init_~#__key___1~0#1.base, lp_init_~#__key___1~0#1.offset);havoc lp_init_~#__key___1~0#1.base, lp_init_~#__key___1~0#1.offset;call ULTIMATE.dealloc(lp_init_~#__key___2~0#1.base, lp_init_~#__key___2~0#1.offset);havoc lp_init_~#__key___2~0#1.base, lp_init_~#__key___2~0#1.offset; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6171: havoc _cond_resched_#t~nondet579#1; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6138: havoc __class_create_#t~ret576#1.base, __class_create_#t~ret576#1.offset; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6206: havoc ldv_open_1_#t~nondet585#1; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4753: call ULTIMATE.dealloc(lp_init_module_~#ep~0#1.base, lp_init_module_~#ep~0#1.offset);havoc lp_init_module_~#ep~0#1.base, lp_init_module_~#ep~0#1.offset; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6240: havoc noop_llseek_#t~nondet592#1; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6210: havoc ldv_probe_1_#t~nondet586#1; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4856: call ULTIMATE.dealloc(main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset);havoc main_~#ldvarg7~0#1.base, main_~#ldvarg7~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_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset);havoc main_~#ldvarg0~0#1.base, main_~#ldvarg0~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_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset);havoc main_~#ldvarg1~0#1.base, main_~#ldvarg1~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_~#ldvarg10~0#1.base, main_~#ldvarg10~0#1.offset);havoc main_~#ldvarg10~0#1.base, main_~#ldvarg10~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg13~0#1.base, main_~#ldvarg13~0#1.offset);havoc main_~#ldvarg13~0#1.base, main_~#ldvarg13~0#1.offset; [2025-02-06 06:46:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6244: havoc parport_claim_#t~nondet593#1; [2025-02-06 06:46:03,546 INFO L? ?]: Removed 1071 outVars from TransFormulas that were not future-live. [2025-02-06 06:46:03,547 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:46:03,596 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:46:03,596 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 06:46:03,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:46:03 BoogieIcfgContainer [2025-02-06 06:46:03,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:46:03,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:46:03,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:46:03,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:46:03,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:45:54" (1/3) ... [2025-02-06 06:46:03,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47715d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:46:03, skipping insertion in model container [2025-02-06 06:46:03,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:56" (2/3) ... [2025-02-06 06:46:03,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47715d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:46:03, skipping insertion in model container [2025-02-06 06:46:03,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:46:03" (3/3) ... [2025-02-06 06:46:03,604 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i [2025-02-06 06:46:03,614 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:46:03,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i that has 58 procedures, 994 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 06:46:03,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:46:03,689 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;@2e4039bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:46:03,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:46:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 998 states, 730 states have (on average 1.3821917808219177) internal successors, (1009), 759 states have internal predecessors, (1009), 205 states have call successors, (205), 57 states have call predecessors, (205), 56 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2025-02-06 06:46:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 06:46:03,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:03,710 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 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:46:03,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:03,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:03,714 INFO L85 PathProgramCache]: Analyzing trace with hash -996032846, now seen corresponding path program 1 times [2025-02-06 06:46:03,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:03,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124379778] [2025-02-06 06:46:03,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:03,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:04,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 06:46:04,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 06:46:04,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:04,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-02-06 06:46:05,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:05,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124379778] [2025-02-06 06:46:05,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124379778] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:46:05,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989965596] [2025-02-06 06:46:05,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:05,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:46:05,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:46:05,084 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:46:05,085 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:46:06,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 06:46:06,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 06:46:06,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:06,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:06,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 3610 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 06:46:06,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:46:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-02-06 06:46:06,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:46:06,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989965596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:06,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:46:06,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 06:46:06,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998258921] [2025-02-06 06:46:06,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:06,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 06:46:06,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:06,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 06:46:06,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 06:46:06,533 INFO L87 Difference]: Start difference. First operand has 998 states, 730 states have (on average 1.3821917808219177) internal successors, (1009), 759 states have internal predecessors, (1009), 205 states have call successors, (205), 57 states have call predecessors, (205), 56 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 06:46:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:06,734 INFO L93 Difference]: Finished difference Result 1991 states and 2857 transitions. [2025-02-06 06:46:06,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 06:46:06,736 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 180 [2025-02-06 06:46:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:06,750 INFO L225 Difference]: With dead ends: 1991 [2025-02-06 06:46:06,750 INFO L226 Difference]: Without dead ends: 981 [2025-02-06 06:46:06,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 181 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:46:06,758 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:06,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1366 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:46:06,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-02-06 06:46:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 981. [2025-02-06 06:46:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 725 states have (on average 1.36) internal successors, (986), 742 states have internal predecessors, (986), 200 states have call successors, (200), 56 states have call predecessors, (200), 55 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) [2025-02-06 06:46:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1377 transitions. [2025-02-06 06:46:06,840 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1377 transitions. Word has length 180 [2025-02-06 06:46:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:06,840 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1377 transitions. [2025-02-06 06:46:06,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 06:46:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1377 transitions. [2025-02-06 06:46:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 06:46:06,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:06,843 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 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:46:06,856 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:46:07,047 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:46:07,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:07,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:07,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1700897096, now seen corresponding path program 1 times [2025-02-06 06:46:07,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:07,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061614409] [2025-02-06 06:46:07,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:07,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:07,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 06:46:07,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 06:46:07,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:07,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-02-06 06:46:08,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:08,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061614409] [2025-02-06 06:46:08,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061614409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:08,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:46:08,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:46:08,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97089019] [2025-02-06 06:46:08,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:08,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:46:08,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:08,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:46:08,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:46:08,353 INFO L87 Difference]: Start difference. First operand 981 states and 1377 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 06:46:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:08,801 INFO L93 Difference]: Finished difference Result 2866 states and 4024 transitions. [2025-02-06 06:46:08,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:46:08,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 180 [2025-02-06 06:46:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:08,812 INFO L225 Difference]: With dead ends: 2866 [2025-02-06 06:46:08,812 INFO L226 Difference]: Without dead ends: 1923 [2025-02-06 06:46:08,816 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:46:08,817 INFO L435 NwaCegarLoop]: 1410 mSDtfsCounter, 1331 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 4103 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:08,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 4103 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 06:46:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-02-06 06:46:08,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1905. [2025-02-06 06:46:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1419 states have (on average 1.3636363636363635) internal successors, (1935), 1446 states have internal predecessors, (1935), 376 states have call successors, (376), 110 states have call predecessors, (376), 109 states have return successors, (367), 366 states have call predecessors, (367), 367 states have call successors, (367) [2025-02-06 06:46:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2678 transitions. [2025-02-06 06:46:08,952 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2678 transitions. Word has length 180 [2025-02-06 06:46:08,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:08,954 INFO L471 AbstractCegarLoop]: Abstraction has 1905 states and 2678 transitions. [2025-02-06 06:46:08,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 06:46:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2678 transitions. [2025-02-06 06:46:08,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-06 06:46:08,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:08,960 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 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] [2025-02-06 06:46:08,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:46:08,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:08,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:08,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1116780347, now seen corresponding path program 1 times [2025-02-06 06:46:08,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:08,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044986007] [2025-02-06 06:46:08,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:08,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:09,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 06:46:09,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 06:46:09,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:09,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-02-06 06:46:10,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:10,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044986007] [2025-02-06 06:46:10,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044986007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:10,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:46:10,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:46:10,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755005113] [2025-02-06 06:46:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:10,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:46:10,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:10,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:46:10,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:46:10,004 INFO L87 Difference]: Start difference. First operand 1905 states and 2678 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 06:46:10,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:10,367 INFO L93 Difference]: Finished difference Result 3793 states and 5331 transitions. [2025-02-06 06:46:10,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:46:10,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 181 [2025-02-06 06:46:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:10,380 INFO L225 Difference]: With dead ends: 3793 [2025-02-06 06:46:10,381 INFO L226 Difference]: Without dead ends: 1926 [2025-02-06 06:46:10,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:46:10,387 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 1373 mSDsluCounter, 2695 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 4038 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:10,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 4038 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:46:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2025-02-06 06:46:10,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1913. [2025-02-06 06:46:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1427 states have (on average 1.3615977575332867) internal successors, (1943), 1454 states have internal predecessors, (1943), 376 states have call successors, (376), 110 states have call predecessors, (376), 109 states have return successors, (367), 366 states have call predecessors, (367), 367 states have call successors, (367) [2025-02-06 06:46:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2686 transitions. [2025-02-06 06:46:10,493 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2686 transitions. Word has length 181 [2025-02-06 06:46:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:10,494 INFO L471 AbstractCegarLoop]: Abstraction has 1913 states and 2686 transitions. [2025-02-06 06:46:10,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 06:46:10,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2686 transitions. [2025-02-06 06:46:10,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 06:46:10,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:10,497 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 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, 1, 1] [2025-02-06 06:46:10,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:46:10,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:10,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:10,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2057003727, now seen corresponding path program 1 times [2025-02-06 06:46:10,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:10,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235918953] [2025-02-06 06:46:10,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:10,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:11,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 06:46:11,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 06:46:11,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:11,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-02-06 06:46:11,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:11,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235918953] [2025-02-06 06:46:11,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235918953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:11,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:46:11,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:46:11,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242792496] [2025-02-06 06:46:11,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:11,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:46:11,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:11,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:46:11,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:46:11,352 INFO L87 Difference]: Start difference. First operand 1913 states and 2686 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:46:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:11,675 INFO L93 Difference]: Finished difference Result 4337 states and 6032 transitions. [2025-02-06 06:46:11,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:46:11,676 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), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 184 [2025-02-06 06:46:11,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:11,688 INFO L225 Difference]: With dead ends: 4337 [2025-02-06 06:46:11,688 INFO L226 Difference]: Without dead ends: 2460 [2025-02-06 06:46:11,693 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:46:11,694 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 428 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:11,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 2592 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:46:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2025-02-06 06:46:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 2398. [2025-02-06 06:46:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 1798 states have (on average 1.35706340378198) internal successors, (2440), 1829 states have internal predecessors, (2440), 445 states have call successors, (445), 155 states have call predecessors, (445), 154 states have return successors, (436), 433 states have call predecessors, (436), 436 states have call successors, (436) [2025-02-06 06:46:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3321 transitions. [2025-02-06 06:46:11,779 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3321 transitions. Word has length 184 [2025-02-06 06:46:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:11,780 INFO L471 AbstractCegarLoop]: Abstraction has 2398 states and 3321 transitions. [2025-02-06 06:46:11,780 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), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:46:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3321 transitions. [2025-02-06 06:46:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 06:46:11,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:11,784 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:46:11,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:46:11,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:11,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1073019466, now seen corresponding path program 1 times [2025-02-06 06:46:11,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:11,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158220200] [2025-02-06 06:46:11,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:11,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:12,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 06:46:12,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 06:46:12,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:12,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-02-06 06:46:12,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:12,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158220200] [2025-02-06 06:46:12,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158220200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:12,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:46:12,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:46:12,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719120877] [2025-02-06 06:46:12,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:12,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:46:12,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:12,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:46:12,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:46:12,656 INFO L87 Difference]: Start difference. First operand 2398 states and 3321 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 06:46:16,692 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:46:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:16,980 INFO L93 Difference]: Finished difference Result 6882 states and 9538 transitions. [2025-02-06 06:46:16,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:46:16,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 191 [2025-02-06 06:46:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:16,999 INFO L225 Difference]: With dead ends: 6882 [2025-02-06 06:46:16,999 INFO L226 Difference]: Without dead ends: 4522 [2025-02-06 06:46:17,006 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:46:17,007 INFO L435 NwaCegarLoop]: 1363 mSDtfsCounter, 1273 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 2620 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:17,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 2620 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 06:46:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4522 states. [2025-02-06 06:46:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4522 to 4509. [2025-02-06 06:46:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4509 states, 3387 states have (on average 1.3613817537643933) internal successors, (4611), 3436 states have internal predecessors, (4611), 824 states have call successors, (824), 298 states have call predecessors, (824), 297 states have return successors, (815), 812 states have call predecessors, (815), 815 states have call successors, (815) [2025-02-06 06:46:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 6250 transitions. [2025-02-06 06:46:17,151 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 6250 transitions. Word has length 191 [2025-02-06 06:46:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:17,152 INFO L471 AbstractCegarLoop]: Abstraction has 4509 states and 6250 transitions. [2025-02-06 06:46:17,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 06:46:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 6250 transitions. [2025-02-06 06:46:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-06 06:46:17,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:17,156 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:46:17,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:46:17,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:17,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:17,157 INFO L85 PathProgramCache]: Analyzing trace with hash 132547475, now seen corresponding path program 1 times [2025-02-06 06:46:17,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:17,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097522927] [2025-02-06 06:46:17,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:17,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:17,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 06:46:17,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 06:46:17,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:17,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-02-06 06:46:18,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:18,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097522927] [2025-02-06 06:46:18,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097522927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:18,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:46:18,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:46:18,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006831572] [2025-02-06 06:46:18,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:18,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:46:18,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:18,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:46:18,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:46:18,021 INFO L87 Difference]: Start difference. First operand 4509 states and 6250 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:46:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:18,224 INFO L93 Difference]: Finished difference Result 4511 states and 6251 transitions. [2025-02-06 06:46:18,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:46:18,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 190 [2025-02-06 06:46:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:18,247 INFO L225 Difference]: With dead ends: 4511 [2025-02-06 06:46:18,247 INFO L226 Difference]: Without dead ends: 4508 [2025-02-06 06:46:18,251 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:46:18,252 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 1320 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:18,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 1343 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:46:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4508 states. [2025-02-06 06:46:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4508 to 4508. [2025-02-06 06:46:18,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4508 states, 3387 states have (on average 1.36108650723354) internal successors, (4610), 3435 states have internal predecessors, (4610), 823 states have call successors, (823), 298 states have call predecessors, (823), 297 states have return successors, (815), 812 states have call predecessors, (815), 815 states have call successors, (815) [2025-02-06 06:46:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 6248 transitions. [2025-02-06 06:46:18,462 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 6248 transitions. Word has length 190 [2025-02-06 06:46:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:18,462 INFO L471 AbstractCegarLoop]: Abstraction has 4508 states and 6248 transitions. [2025-02-06 06:46:18,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:46:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 6248 transitions. [2025-02-06 06:46:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 06:46:18,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:18,464 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:46:18,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:46:18,465 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:18,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:18,465 INFO L85 PathProgramCache]: Analyzing trace with hash -186891612, now seen corresponding path program 1 times [2025-02-06 06:46:18,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:18,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52716987] [2025-02-06 06:46:18,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:18,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:19,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 06:46:19,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 06:46:19,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:19,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-02-06 06:46:19,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:19,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52716987] [2025-02-06 06:46:19,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52716987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:19,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:46:19,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:46:19,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471612799] [2025-02-06 06:46:19,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:19,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:46:19,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:19,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:46:19,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:46:19,357 INFO L87 Difference]: Start difference. First operand 4508 states and 6248 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:46:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:19,607 INFO L93 Difference]: Finished difference Result 4510 states and 6249 transitions. [2025-02-06 06:46:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:46:19,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 191 [2025-02-06 06:46:19,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:19,634 INFO L225 Difference]: With dead ends: 4510 [2025-02-06 06:46:19,634 INFO L226 Difference]: Without dead ends: 4507 [2025-02-06 06:46:19,638 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:46:19,639 INFO L435 NwaCegarLoop]: 1341 mSDtfsCounter, 1317 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:19,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 1341 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:46:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2025-02-06 06:46:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 4507. [2025-02-06 06:46:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4507 states, 3387 states have (on average 1.3607912607026866) internal successors, (4609), 3434 states have internal predecessors, (4609), 822 states have call successors, (822), 298 states have call predecessors, (822), 297 states have return successors, (815), 812 states have call predecessors, (815), 815 states have call successors, (815) [2025-02-06 06:46:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 6246 transitions. [2025-02-06 06:46:19,830 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 6246 transitions. Word has length 191 [2025-02-06 06:46:19,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:19,830 INFO L471 AbstractCegarLoop]: Abstraction has 4507 states and 6246 transitions. [2025-02-06 06:46:19,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:46:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 6246 transitions. [2025-02-06 06:46:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 06:46:19,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:19,835 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:46:19,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 06:46:19,835 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:19,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1499569740, now seen corresponding path program 1 times [2025-02-06 06:46:19,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:19,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867766001] [2025-02-06 06:46:19,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:19,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:20,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 06:46:20,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 06:46:20,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:20,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-02-06 06:46:20,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:20,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867766001] [2025-02-06 06:46:20,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867766001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:20,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:46:20,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:46:20,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113533432] [2025-02-06 06:46:20,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:20,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:46:20,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:20,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:46:20,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:46:20,602 INFO L87 Difference]: Start difference. First operand 4507 states and 6246 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:46:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:20,854 INFO L93 Difference]: Finished difference Result 5005 states and 6750 transitions. [2025-02-06 06:46:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:46:20,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 192 [2025-02-06 06:46:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:20,879 INFO L225 Difference]: With dead ends: 5005 [2025-02-06 06:46:20,882 INFO L226 Difference]: Without dead ends: 5001 [2025-02-06 06:46:20,887 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:46:20,888 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1005 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:20,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1763 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:46:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2025-02-06 06:46:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 4997. [2025-02-06 06:46:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4997 states, 3711 states have (on average 1.336566963082727) internal successors, (4960), 3756 states have internal predecessors, (4960), 892 states have call successors, (892), 394 states have call predecessors, (892), 393 states have return successors, (887), 884 states have call predecessors, (887), 887 states have call successors, (887) [2025-02-06 06:46:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4997 states to 4997 states and 6739 transitions. [2025-02-06 06:46:21,134 INFO L78 Accepts]: Start accepts. Automaton has 4997 states and 6739 transitions. Word has length 192 [2025-02-06 06:46:21,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:21,135 INFO L471 AbstractCegarLoop]: Abstraction has 4997 states and 6739 transitions. [2025-02-06 06:46:21,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:46:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 4997 states and 6739 transitions. [2025-02-06 06:46:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-06 06:46:21,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:21,141 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:46:21,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 06:46:21,141 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:21,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:21,141 INFO L85 PathProgramCache]: Analyzing trace with hash 757080229, now seen corresponding path program 1 times [2025-02-06 06:46:21,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:21,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186804133] [2025-02-06 06:46:21,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:21,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:21,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 06:46:21,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 06:46:21,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:21,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-02-06 06:46:21,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:21,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186804133] [2025-02-06 06:46:21,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186804133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:21,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:46:21,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:46:21,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629175490] [2025-02-06 06:46:21,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:21,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:46:21,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:21,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:46:21,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:46:21,891 INFO L87 Difference]: Start difference. First operand 4997 states and 6739 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:46:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:22,103 INFO L93 Difference]: Finished difference Result 4999 states and 6740 transitions. [2025-02-06 06:46:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:46:22,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 193 [2025-02-06 06:46:22,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:22,126 INFO L225 Difference]: With dead ends: 4999 [2025-02-06 06:46:22,126 INFO L226 Difference]: Without dead ends: 4996 [2025-02-06 06:46:22,127 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:46:22,128 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 1309 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:22,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 1335 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:46:22,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4996 states. [2025-02-06 06:46:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4996 to 4996. [2025-02-06 06:46:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4996 states, 3711 states have (on average 1.3362974939369443) internal successors, (4959), 3755 states have internal predecessors, (4959), 891 states have call successors, (891), 394 states have call predecessors, (891), 393 states have return successors, (887), 884 states have call predecessors, (887), 887 states have call successors, (887) [2025-02-06 06:46:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 6737 transitions. [2025-02-06 06:46:22,284 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 6737 transitions. Word has length 193 [2025-02-06 06:46:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:22,284 INFO L471 AbstractCegarLoop]: Abstraction has 4996 states and 6737 transitions. [2025-02-06 06:46:22,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:46:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 6737 transitions. [2025-02-06 06:46:22,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-06 06:46:22,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:22,288 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:46:22,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 06:46:22,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:22,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:22,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1993751509, now seen corresponding path program 1 times [2025-02-06 06:46:22,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:22,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589360163] [2025-02-06 06:46:22,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:22,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:22,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-06 06:46:22,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-06 06:46:22,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:22,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-02-06 06:46:23,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:23,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589360163] [2025-02-06 06:46:23,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589360163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:23,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:46:23,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:46:23,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154943564] [2025-02-06 06:46:23,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:23,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:46:23,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:23,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:46:23,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:46:23,081 INFO L87 Difference]: Start difference. First operand 4996 states and 6737 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:46:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:23,675 INFO L93 Difference]: Finished difference Result 14790 states and 20055 transitions. [2025-02-06 06:46:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:46:23,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 194 [2025-02-06 06:46:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:23,712 INFO L225 Difference]: With dead ends: 14790 [2025-02-06 06:46:23,712 INFO L226 Difference]: Without dead ends: 9795 [2025-02-06 06:46:23,731 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:46:23,732 INFO L435 NwaCegarLoop]: 1714 mSDtfsCounter, 1308 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 2967 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:23,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 2967 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:46:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9795 states. [2025-02-06 06:46:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9795 to 9753. [2025-02-06 06:46:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9753 states, 7265 states have (on average 1.337646249139711) internal successors, (9718), 7355 states have internal predecessors, (9718), 1724 states have call successors, (1724), 765 states have call predecessors, (1724), 763 states have return successors, (1773), 1705 states have call predecessors, (1773), 1717 states have call successors, (1773) [2025-02-06 06:46:24,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9753 states to 9753 states and 13215 transitions. [2025-02-06 06:46:24,087 INFO L78 Accepts]: Start accepts. Automaton has 9753 states and 13215 transitions. Word has length 194 [2025-02-06 06:46:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:24,089 INFO L471 AbstractCegarLoop]: Abstraction has 9753 states and 13215 transitions. [2025-02-06 06:46:24,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:46:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 9753 states and 13215 transitions. [2025-02-06 06:46:24,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-06 06:46:24,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:24,095 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2025-02-06 06:46:24,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 06:46:24,096 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:24,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:24,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1686048034, now seen corresponding path program 1 times [2025-02-06 06:46:24,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:24,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523767148] [2025-02-06 06:46:24,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:24,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:24,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-06 06:46:24,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-06 06:46:24,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:24,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-02-06 06:46:25,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:25,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523767148] [2025-02-06 06:46:25,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523767148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:25,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:46:25,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:46:25,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824334907] [2025-02-06 06:46:25,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:25,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:46:25,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:25,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:46:25,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:46:25,062 INFO L87 Difference]: Start difference. First operand 9753 states and 13215 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 06:46:25,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:25,582 INFO L93 Difference]: Finished difference Result 19492 states and 26413 transitions. [2025-02-06 06:46:25,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:46:25,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 254 [2025-02-06 06:46:25,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:25,617 INFO L225 Difference]: With dead ends: 19492 [2025-02-06 06:46:25,617 INFO L226 Difference]: Without dead ends: 9777 [2025-02-06 06:46:25,641 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:46:25,642 INFO L435 NwaCegarLoop]: 1332 mSDtfsCounter, 3 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:25,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2660 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:46:25,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9777 states. [2025-02-06 06:46:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9777 to 9757. [2025-02-06 06:46:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9757 states, 7269 states have (on average 1.337460448479846) internal successors, (9722), 7359 states have internal predecessors, (9722), 1724 states have call successors, (1724), 765 states have call predecessors, (1724), 763 states have return successors, (1773), 1705 states have call predecessors, (1773), 1717 states have call successors, (1773) [2025-02-06 06:46:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9757 states to 9757 states and 13219 transitions. [2025-02-06 06:46:26,233 INFO L78 Accepts]: Start accepts. Automaton has 9757 states and 13219 transitions. Word has length 254 [2025-02-06 06:46:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:26,234 INFO L471 AbstractCegarLoop]: Abstraction has 9757 states and 13219 transitions. [2025-02-06 06:46:26,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 06:46:26,234 INFO L276 IsEmpty]: Start isEmpty. Operand 9757 states and 13219 transitions. [2025-02-06 06:46:26,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-02-06 06:46:26,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:26,240 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2025-02-06 06:46:26,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 06:46:26,240 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:26,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:26,241 INFO L85 PathProgramCache]: Analyzing trace with hash 132117828, now seen corresponding path program 1 times [2025-02-06 06:46:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:26,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320940158] [2025-02-06 06:46:26,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:26,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:26,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-06 06:46:26,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-06 06:46:26,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:26,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-02-06 06:46:27,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:27,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320940158] [2025-02-06 06:46:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320940158] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:46:27,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248337225] [2025-02-06 06:46:27,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:27,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:46:27,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:46:27,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:46:27,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 06:46:28,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-06 06:46:28,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-06 06:46:28,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:28,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:28,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 4151 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:46:28,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:46:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-02-06 06:46:28,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:46:28,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248337225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:28,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:46:28,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-06 06:46:28,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465714337] [2025-02-06 06:46:28,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:28,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:46:28,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:28,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:46:28,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:46:28,867 INFO L87 Difference]: Start difference. First operand 9757 states and 13219 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:46:32,903 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:46:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:33,393 INFO L93 Difference]: Finished difference Result 15215 states and 20536 transitions. [2025-02-06 06:46:33,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:46:33,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 266 [2025-02-06 06:46:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:33,420 INFO L225 Difference]: With dead ends: 15215 [2025-02-06 06:46:33,420 INFO L226 Difference]: Without dead ends: 5492 [2025-02-06 06:46:33,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:46:33,448 INFO L435 NwaCegarLoop]: 1336 mSDtfsCounter, 9 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2666 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:33,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2666 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 06:46:33,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5492 states. [2025-02-06 06:46:33,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5492 to 5471. [2025-02-06 06:46:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5471 states, 4062 states have (on average 1.326686361398326) internal successors, (5389), 4113 states have internal predecessors, (5389), 964 states have call successors, (964), 446 states have call predecessors, (964), 444 states have return successors, (985), 951 states have call predecessors, (985), 957 states have call successors, (985) [2025-02-06 06:46:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 7338 transitions. [2025-02-06 06:46:33,748 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 7338 transitions. Word has length 266 [2025-02-06 06:46:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:33,748 INFO L471 AbstractCegarLoop]: Abstraction has 5471 states and 7338 transitions. [2025-02-06 06:46:33,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:46:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 7338 transitions. [2025-02-06 06:46:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-02-06 06:46:33,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:33,756 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2025-02-06 06:46:33,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 06:46:33,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:46:33,957 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:33,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:33,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2096840290, now seen corresponding path program 1 times [2025-02-06 06:46:33,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:33,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066254564] [2025-02-06 06:46:33,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:33,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:34,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-02-06 06:46:34,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-02-06 06:46:34,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:34,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-02-06 06:46:34,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:34,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066254564] [2025-02-06 06:46:34,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066254564] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:46:34,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173927490] [2025-02-06 06:46:34,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:34,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:46:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:46:34,855 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:46:34,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 06:46:36,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-02-06 06:46:36,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-02-06 06:46:36,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:36,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:36,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 4231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:46:36,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:46:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 255 proven. 1 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 06:46:36,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 06:46:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-02-06 06:46:36,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173927490] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 06:46:36,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 06:46:36,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 06:46:36,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851148251] [2025-02-06 06:46:36,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 06:46:36,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 06:46:36,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:36,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 06:46:36,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:46:36,874 INFO L87 Difference]: Start difference. First operand 5471 states and 7338 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 5 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2025-02-06 06:46:37,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:37,525 INFO L93 Difference]: Finished difference Result 10766 states and 14456 transitions. [2025-02-06 06:46:37,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:46:37,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 5 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) Word has length 283 [2025-02-06 06:46:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:37,550 INFO L225 Difference]: With dead ends: 10766 [2025-02-06 06:46:37,550 INFO L226 Difference]: Without dead ends: 5543 [2025-02-06 06:46:37,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:46:37,562 INFO L435 NwaCegarLoop]: 1332 mSDtfsCounter, 6 mSDsluCounter, 2652 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3984 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:37,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3984 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 06:46:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5543 states. [2025-02-06 06:46:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5543 to 5543. [2025-02-06 06:46:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5543 states, 4110 states have (on average 1.3228710462287105) internal successors, (5437), 4161 states have internal predecessors, (5437), 988 states have call successors, (988), 446 states have call predecessors, (988), 444 states have return successors, (1009), 975 states have call predecessors, (1009), 981 states have call successors, (1009) [2025-02-06 06:46:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5543 states to 5543 states and 7434 transitions. [2025-02-06 06:46:37,788 INFO L78 Accepts]: Start accepts. Automaton has 5543 states and 7434 transitions. Word has length 283 [2025-02-06 06:46:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:37,788 INFO L471 AbstractCegarLoop]: Abstraction has 5543 states and 7434 transitions. [2025-02-06 06:46:37,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 5 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2025-02-06 06:46:37,788 INFO L276 IsEmpty]: Start isEmpty. Operand 5543 states and 7434 transitions. [2025-02-06 06:46:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-02-06 06:46:37,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:37,794 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-06 06:46:37,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 06:46:37,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:46:37,994 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:37,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash 458914476, now seen corresponding path program 2 times [2025-02-06 06:46:37,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:37,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10535438] [2025-02-06 06:46:37,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 06:46:37,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:38,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 319 statements into 2 equivalence classes. [2025-02-06 06:46:38,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 319 statements. [2025-02-06 06:46:38,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 06:46:38,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2025-02-06 06:46:38,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:38,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10535438] [2025-02-06 06:46:38,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10535438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:38,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:46:38,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:46:38,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267675726] [2025-02-06 06:46:38,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:38,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:46:38,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:38,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:46:38,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:46:38,761 INFO L87 Difference]: Start difference. First operand 5543 states and 7434 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 06:46:42,796 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:46:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:43,073 INFO L93 Difference]: Finished difference Result 5551 states and 7440 transitions. [2025-02-06 06:46:43,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:46:43,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 319 [2025-02-06 06:46:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:43,112 INFO L225 Difference]: With dead ends: 5551 [2025-02-06 06:46:43,113 INFO L226 Difference]: Without dead ends: 5548 [2025-02-06 06:46:43,116 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:46:43,116 INFO L435 NwaCegarLoop]: 1449 mSDtfsCounter, 423 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:43,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 2491 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 06:46:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2025-02-06 06:46:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5542. [2025-02-06 06:46:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5542 states, 4110 states have (on average 1.321897810218978) internal successors, (5433), 4160 states have internal predecessors, (5433), 987 states have call successors, (987), 446 states have call predecessors, (987), 444 states have return successors, (1009), 975 states have call predecessors, (1009), 981 states have call successors, (1009) [2025-02-06 06:46:43,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 7429 transitions. [2025-02-06 06:46:43,291 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 7429 transitions. Word has length 319 [2025-02-06 06:46:43,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:43,292 INFO L471 AbstractCegarLoop]: Abstraction has 5542 states and 7429 transitions. [2025-02-06 06:46:43,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 06:46:43,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 7429 transitions. [2025-02-06 06:46:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-06 06:46:43,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:43,302 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-06 06:46:43,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 06:46:43,303 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:43,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:43,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1744409814, now seen corresponding path program 1 times [2025-02-06 06:46:43,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:43,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458282883] [2025-02-06 06:46:43,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:43,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:43,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-06 06:46:44,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-06 06:46:44,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:44,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-02-06 06:46:44,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:44,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458282883] [2025-02-06 06:46:44,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458282883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:44,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:46:44,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:46:44,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941313402] [2025-02-06 06:46:44,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:44,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:46:44,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:44,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:46:44,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:46:44,629 INFO L87 Difference]: Start difference. First operand 5542 states and 7429 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-06 06:46:48,660 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:46:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:48,999 INFO L93 Difference]: Finished difference Result 10859 states and 14554 transitions. [2025-02-06 06:46:48,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:46:48,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 352 [2025-02-06 06:46:48,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:49,017 INFO L225 Difference]: With dead ends: 10859 [2025-02-06 06:46:49,017 INFO L226 Difference]: Without dead ends: 5540 [2025-02-06 06:46:49,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:46:49,027 INFO L435 NwaCegarLoop]: 1333 mSDtfsCounter, 10 mSDsluCounter, 3984 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5317 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:49,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5317 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 06:46:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5540 states. [2025-02-06 06:46:49,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5540 to 5504. [2025-02-06 06:46:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5504 states, 4081 states have (on average 1.321244792942906) internal successors, (5392), 4134 states have internal predecessors, (5392), 980 states have call successors, (980), 444 states have call predecessors, (980), 442 states have return successors, (1002), 965 states have call predecessors, (1002), 974 states have call successors, (1002) [2025-02-06 06:46:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5504 states to 5504 states and 7374 transitions. [2025-02-06 06:46:49,414 INFO L78 Accepts]: Start accepts. Automaton has 5504 states and 7374 transitions. Word has length 352 [2025-02-06 06:46:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:49,414 INFO L471 AbstractCegarLoop]: Abstraction has 5504 states and 7374 transitions. [2025-02-06 06:46:49,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-06 06:46:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5504 states and 7374 transitions. [2025-02-06 06:46:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-02-06 06:46:49,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:49,425 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-06 06:46:49,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 06:46:49,426 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:49,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash -538378690, now seen corresponding path program 1 times [2025-02-06 06:46:49,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:49,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694949387] [2025-02-06 06:46:49,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:49,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:50,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-02-06 06:46:50,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-02-06 06:46:50,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:50,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2025-02-06 06:46:50,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:50,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694949387] [2025-02-06 06:46:50,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694949387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:50,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:46:50,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:46:50,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110150583] [2025-02-06 06:46:50,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:50,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:46:50,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:50,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:46:50,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:46:50,560 INFO L87 Difference]: Start difference. First operand 5504 states and 7374 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-06 06:46:54,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:46:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:46:54,969 INFO L93 Difference]: Finished difference Result 10759 states and 14423 transitions. [2025-02-06 06:46:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:46:54,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 369 [2025-02-06 06:46:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:46:54,988 INFO L225 Difference]: With dead ends: 10759 [2025-02-06 06:46:54,988 INFO L226 Difference]: Without dead ends: 5506 [2025-02-06 06:46:54,996 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:46:54,996 INFO L435 NwaCegarLoop]: 2163 mSDtfsCounter, 1273 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 3449 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:46:54,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 3449 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-06 06:46:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2025-02-06 06:46:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 5457. [2025-02-06 06:46:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5457 states, 4042 states have (on average 1.3193963384463137) internal successors, (5333), 4097 states have internal predecessors, (5333), 974 states have call successors, (974), 439 states have call predecessors, (974), 440 states have return successors, (975), 960 states have call predecessors, (975), 961 states have call successors, (975) [2025-02-06 06:46:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5457 states to 5457 states and 7282 transitions. [2025-02-06 06:46:55,161 INFO L78 Accepts]: Start accepts. Automaton has 5457 states and 7282 transitions. Word has length 369 [2025-02-06 06:46:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:46:55,162 INFO L471 AbstractCegarLoop]: Abstraction has 5457 states and 7282 transitions. [2025-02-06 06:46:55,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-06 06:46:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 5457 states and 7282 transitions. [2025-02-06 06:46:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-02-06 06:46:55,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:46:55,169 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-06 06:46:55,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 06:46:55,169 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:46:55,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:46:55,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2083215046, now seen corresponding path program 1 times [2025-02-06 06:46:55,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:46:55,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396029760] [2025-02-06 06:46:55,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:46:55,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:46:55,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-02-06 06:46:55,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-02-06 06:46:55,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:46:55,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:46:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-02-06 06:46:55,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:46:55,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396029760] [2025-02-06 06:46:55,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396029760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:46:55,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:46:55,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:46:55,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692107042] [2025-02-06 06:46:55,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:46:55,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:46:55,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:46:55,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:46:55,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:46:55,952 INFO L87 Difference]: Start difference. First operand 5457 states and 7282 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-02-06 06:46:59,985 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:47:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:47:00,437 INFO L93 Difference]: Finished difference Result 13036 states and 17362 transitions. [2025-02-06 06:47:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:47:00,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 370 [2025-02-06 06:47:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:47:00,468 INFO L225 Difference]: With dead ends: 13036 [2025-02-06 06:47:00,469 INFO L226 Difference]: Without dead ends: 7830 [2025-02-06 06:47:00,480 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:47:00,481 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 907 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:47:00,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 2806 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 86 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-06 06:47:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7830 states. [2025-02-06 06:47:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7830 to 7666. [2025-02-06 06:47:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7666 states, 5709 states have (on average 1.324049746015064) internal successors, (7559), 5796 states have internal predecessors, (7559), 1309 states have call successors, (1309), 644 states have call predecessors, (1309), 647 states have return successors, (1312), 1291 states have call predecessors, (1312), 1296 states have call successors, (1312) [2025-02-06 06:47:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7666 states to 7666 states and 10180 transitions. [2025-02-06 06:47:00,708 INFO L78 Accepts]: Start accepts. Automaton has 7666 states and 10180 transitions. Word has length 370 [2025-02-06 06:47:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:47:00,709 INFO L471 AbstractCegarLoop]: Abstraction has 7666 states and 10180 transitions. [2025-02-06 06:47:00,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-02-06 06:47:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 7666 states and 10180 transitions. [2025-02-06 06:47:00,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-02-06 06:47:00,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:47:00,715 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-06 06:47:00,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 06:47:00,715 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:47:00,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:47:00,716 INFO L85 PathProgramCache]: Analyzing trace with hash -527062563, now seen corresponding path program 1 times [2025-02-06 06:47:00,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:47:00,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901149538] [2025-02-06 06:47:00,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:47:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:47:01,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-02-06 06:47:01,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-02-06 06:47:01,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:47:01,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:47:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-02-06 06:47:01,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:47:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901149538] [2025-02-06 06:47:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901149538] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:47:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235273137] [2025-02-06 06:47:01,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:47:01,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:47:01,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:47:01,831 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:47:01,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 06:47:03,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-02-06 06:47:03,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-02-06 06:47:03,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:47:03,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:47:03,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 5007 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 06:47:03,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:47:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 255 proven. 40 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-02-06 06:47:03,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 06:47:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-02-06 06:47:04,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235273137] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 06:47:04,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 06:47:04,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-06 06:47:04,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339068759] [2025-02-06 06:47:04,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 06:47:04,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 06:47:04,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:47:04,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 06:47:04,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-06 06:47:04,391 INFO L87 Difference]: Start difference. First operand 7666 states and 10180 transitions. Second operand has 11 states, 11 states have (on average 17.90909090909091) internal successors, (197), 11 states have internal predecessors, (197), 10 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (63), 10 states have call predecessors, (63), 10 states have call successors, (63) [2025-02-06 06:47:05,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:47:05,341 INFO L93 Difference]: Finished difference Result 15177 states and 20174 transitions. [2025-02-06 06:47:05,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 06:47:05,341 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.90909090909091) internal successors, (197), 11 states have internal predecessors, (197), 10 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (63), 10 states have call predecessors, (63), 10 states have call successors, (63) Word has length 369 [2025-02-06 06:47:05,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:47:05,369 INFO L225 Difference]: With dead ends: 15177 [2025-02-06 06:47:05,369 INFO L226 Difference]: Without dead ends: 7762 [2025-02-06 06:47:05,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 732 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-06 06:47:05,383 INFO L435 NwaCegarLoop]: 1330 mSDtfsCounter, 3 mSDsluCounter, 5296 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6626 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 06:47:05,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6626 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 06:47:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2025-02-06 06:47:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 7762. [2025-02-06 06:47:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7762 states, 5773 states have (on average 1.320457301229863) internal successors, (7623), 5860 states have internal predecessors, (7623), 1341 states have call successors, (1341), 644 states have call predecessors, (1341), 647 states have return successors, (1344), 1323 states have call predecessors, (1344), 1328 states have call successors, (1344) [2025-02-06 06:47:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7762 states to 7762 states and 10308 transitions. [2025-02-06 06:47:05,628 INFO L78 Accepts]: Start accepts. Automaton has 7762 states and 10308 transitions. Word has length 369 [2025-02-06 06:47:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:47:05,629 INFO L471 AbstractCegarLoop]: Abstraction has 7762 states and 10308 transitions. [2025-02-06 06:47:05,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.90909090909091) internal successors, (197), 11 states have internal predecessors, (197), 10 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (63), 10 states have call predecessors, (63), 10 states have call successors, (63) [2025-02-06 06:47:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 7762 states and 10308 transitions. [2025-02-06 06:47:05,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-02-06 06:47:05,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:47:05,635 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2025-02-06 06:47:05,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 06:47:05,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 06:47:05,836 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:47:05,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:47:05,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1249615685, now seen corresponding path program 2 times [2025-02-06 06:47:05,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:47:05,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629378807] [2025-02-06 06:47:05,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 06:47:05,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:47:06,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 417 statements into 2 equivalence classes. [2025-02-06 06:47:06,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 88 of 417 statements. [2025-02-06 06:47:06,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 06:47:06,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:47:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1223 trivial. 0 not checked. [2025-02-06 06:47:06,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:47:06,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629378807] [2025-02-06 06:47:06,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629378807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:47:06,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:47:06,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 06:47:06,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649250746] [2025-02-06 06:47:06,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:47:06,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:47:06,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:47:06,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:47:06,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:47:06,843 INFO L87 Difference]: Start difference. First operand 7762 states and 10308 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-06 06:47:07,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:47:07,430 INFO L93 Difference]: Finished difference Result 8083 states and 10634 transitions. [2025-02-06 06:47:07,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:47:07,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 417 [2025-02-06 06:47:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:47:07,462 INFO L225 Difference]: With dead ends: 8083 [2025-02-06 06:47:07,462 INFO L226 Difference]: Without dead ends: 7036 [2025-02-06 06:47:07,468 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:47:07,468 INFO L435 NwaCegarLoop]: 1338 mSDtfsCounter, 0 mSDsluCounter, 5338 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6676 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 06:47:07,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6676 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 06:47:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7036 states. [2025-02-06 06:47:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7036 to 7036. [2025-02-06 06:47:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7036 states, 5230 states have (on average 1.3093690248565966) internal successors, (6848), 5298 states have internal predecessors, (6848), 1192 states have call successors, (1192), 610 states have call predecessors, (1192), 613 states have return successors, (1196), 1178 states have call predecessors, (1196), 1180 states have call successors, (1196) [2025-02-06 06:47:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7036 states to 7036 states and 9236 transitions. [2025-02-06 06:47:07,708 INFO L78 Accepts]: Start accepts. Automaton has 7036 states and 9236 transitions. Word has length 417 [2025-02-06 06:47:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:47:07,708 INFO L471 AbstractCegarLoop]: Abstraction has 7036 states and 9236 transitions. [2025-02-06 06:47:07,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-06 06:47:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7036 states and 9236 transitions. [2025-02-06 06:47:07,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-06 06:47:07,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:47:07,717 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:07,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 06:47:07,717 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:47:07,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:47:07,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1133770001, now seen corresponding path program 1 times [2025-02-06 06:47:07,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:47:07,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545785531] [2025-02-06 06:47:07,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:47:07,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:47:08,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-06 06:47:08,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-06 06:47:08,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:47:08,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:47:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1231 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1223 trivial. 0 not checked. [2025-02-06 06:47:08,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:47:08,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545785531] [2025-02-06 06:47:08,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545785531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:47:08,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:47:08,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 06:47:08,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919426779] [2025-02-06 06:47:08,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:47:08,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:47:08,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:47:08,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:47:08,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:47:08,978 INFO L87 Difference]: Start difference. First operand 7036 states and 9236 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 5 states have internal predecessors, (137), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-06 06:47:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:47:09,439 INFO L93 Difference]: Finished difference Result 9730 states and 12727 transitions. [2025-02-06 06:47:09,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:47:09,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 5 states have internal predecessors, (137), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) Word has length 430 [2025-02-06 06:47:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:47:09,465 INFO L225 Difference]: With dead ends: 9730 [2025-02-06 06:47:09,465 INFO L226 Difference]: Without dead ends: 7022 [2025-02-06 06:47:09,470 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:47:09,470 INFO L435 NwaCegarLoop]: 1331 mSDtfsCounter, 0 mSDsluCounter, 5318 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6649 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:47:09,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6649 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:47:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7022 states. [2025-02-06 06:47:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7022 to 7022. [2025-02-06 06:47:09,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7022 states, 5220 states have (on average 1.3091954022988506) internal successors, (6834), 5288 states have internal predecessors, (6834), 1192 states have call successors, (1192), 610 states have call predecessors, (1192), 609 states have return successors, (1192), 1174 states have call predecessors, (1192), 1180 states have call successors, (1192) [2025-02-06 06:47:09,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 9218 transitions. [2025-02-06 06:47:09,849 INFO L78 Accepts]: Start accepts. Automaton has 7022 states and 9218 transitions. Word has length 430 [2025-02-06 06:47:09,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:47:09,849 INFO L471 AbstractCegarLoop]: Abstraction has 7022 states and 9218 transitions. [2025-02-06 06:47:09,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 5 states have internal predecessors, (137), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-06 06:47:09,850 INFO L276 IsEmpty]: Start isEmpty. Operand 7022 states and 9218 transitions. [2025-02-06 06:47:09,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-02-06 06:47:09,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:47:09,862 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:47:09,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 06:47:09,862 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:47:09,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:47:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1889840730, now seen corresponding path program 1 times [2025-02-06 06:47:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:47:09,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635640376] [2025-02-06 06:47:09,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:47:09,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:47:10,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-06 06:47:10,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-06 06:47:10,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:47:10,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:47:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2025-02-06 06:47:10,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:47:10,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635640376] [2025-02-06 06:47:10,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635640376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:47:10,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:47:10,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:47:10,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591120048] [2025-02-06 06:47:10,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:47:10,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:47:10,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:47:10,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:47:10,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:47:10,765 INFO L87 Difference]: Start difference. First operand 7022 states and 9218 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-02-06 06:47:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:47:11,149 INFO L93 Difference]: Finished difference Result 13793 states and 18148 transitions. [2025-02-06 06:47:11,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:47:11,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 477 [2025-02-06 06:47:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:47:11,176 INFO L225 Difference]: With dead ends: 13793 [2025-02-06 06:47:11,176 INFO L226 Difference]: Without dead ends: 7022 [2025-02-06 06:47:11,188 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:47:11,189 INFO L435 NwaCegarLoop]: 1328 mSDtfsCounter, 0 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2650 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:47:11,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2650 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:47:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7022 states. [2025-02-06 06:47:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7022 to 7022. [2025-02-06 06:47:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7022 states, 5220 states have (on average 1.3057471264367817) internal successors, (6816), 5288 states have internal predecessors, (6816), 1192 states have call successors, (1192), 610 states have call predecessors, (1192), 609 states have return successors, (1192), 1174 states have call predecessors, (1192), 1180 states have call successors, (1192) [2025-02-06 06:47:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 9200 transitions. [2025-02-06 06:47:11,407 INFO L78 Accepts]: Start accepts. Automaton has 7022 states and 9200 transitions. Word has length 477 [2025-02-06 06:47:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:47:11,408 INFO L471 AbstractCegarLoop]: Abstraction has 7022 states and 9200 transitions. [2025-02-06 06:47:11,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-02-06 06:47:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 7022 states and 9200 transitions. [2025-02-06 06:47:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-02-06 06:47:11,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:47:11,418 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:47:11,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 06:47:11,418 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:47:11,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:47:11,419 INFO L85 PathProgramCache]: Analyzing trace with hash -227136938, now seen corresponding path program 1 times [2025-02-06 06:47:11,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:47:11,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603994949] [2025-02-06 06:47:11,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:47:11,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:47:12,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-06 06:47:12,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-06 06:47:12,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:47:12,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:47:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2025-02-06 06:47:12,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:47:12,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603994949] [2025-02-06 06:47:12,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603994949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:47:12,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:47:12,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 06:47:12,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147242703] [2025-02-06 06:47:12,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:47:12,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:47:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:47:12,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:47:12,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:47:12,605 INFO L87 Difference]: Start difference. First operand 7022 states and 9200 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 3 states have call predecessors, (39), 2 states have call successors, (39) [2025-02-06 06:47:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:47:13,029 INFO L93 Difference]: Finished difference Result 9716 states and 12685 transitions. [2025-02-06 06:47:13,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:47:13,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 3 states have call predecessors, (39), 2 states have call successors, (39) Word has length 480 [2025-02-06 06:47:13,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:47:13,056 INFO L225 Difference]: With dead ends: 9716 [2025-02-06 06:47:13,056 INFO L226 Difference]: Without dead ends: 7020 [2025-02-06 06:47:13,061 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:47:13,063 INFO L435 NwaCegarLoop]: 1328 mSDtfsCounter, 0 mSDsluCounter, 5305 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6633 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:47:13,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6633 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:47:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7020 states. [2025-02-06 06:47:13,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7020 to 7020. [2025-02-06 06:47:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7020 states, 5218 states have (on average 1.3054810272134918) internal successors, (6812), 5286 states have internal predecessors, (6812), 1192 states have call successors, (1192), 610 states have call predecessors, (1192), 609 states have return successors, (1192), 1174 states have call predecessors, (1192), 1180 states have call successors, (1192) [2025-02-06 06:47:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7020 states to 7020 states and 9196 transitions. [2025-02-06 06:47:13,276 INFO L78 Accepts]: Start accepts. Automaton has 7020 states and 9196 transitions. Word has length 480 [2025-02-06 06:47:13,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:47:13,277 INFO L471 AbstractCegarLoop]: Abstraction has 7020 states and 9196 transitions. [2025-02-06 06:47:13,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 3 states have call predecessors, (39), 2 states have call successors, (39) [2025-02-06 06:47:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 7020 states and 9196 transitions. [2025-02-06 06:47:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-02-06 06:47:13,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:47:13,286 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:13,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 06:47:13,286 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:47:13,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:47:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1793850983, now seen corresponding path program 1 times [2025-02-06 06:47:13,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:47:13,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778698017] [2025-02-06 06:47:13,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:47:13,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:47:13,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-02-06 06:47:13,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-02-06 06:47:13,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:47:13,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:47:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2025-02-06 06:47:14,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:47:14,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778698017] [2025-02-06 06:47:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778698017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:47:14,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:47:14,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:47:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585693741] [2025-02-06 06:47:14,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:47:14,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:47:14,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:47:14,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:47:14,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:47:14,420 INFO L87 Difference]: Start difference. First operand 7020 states and 9196 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 3 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-02-06 06:47:14,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:47:14,751 INFO L93 Difference]: Finished difference Result 13921 states and 18265 transitions. [2025-02-06 06:47:14,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:47:14,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 3 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 491 [2025-02-06 06:47:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:47:14,775 INFO L225 Difference]: With dead ends: 13921 [2025-02-06 06:47:14,775 INFO L226 Difference]: Without dead ends: 7152 [2025-02-06 06:47:14,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:47:14,786 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 23 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3989 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:47:14,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3989 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:47:14,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7152 states. [2025-02-06 06:47:14,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7152 to 7104. [2025-02-06 06:47:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7104 states, 5282 states have (on average 1.3048087845513063) internal successors, (6892), 5348 states have internal predecessors, (6892), 1212 states have call successors, (1212), 610 states have call predecessors, (1212), 609 states have return successors, (1214), 1196 states have call predecessors, (1214), 1200 states have call successors, (1214) [2025-02-06 06:47:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7104 states to 7104 states and 9318 transitions. [2025-02-06 06:47:14,994 INFO L78 Accepts]: Start accepts. Automaton has 7104 states and 9318 transitions. Word has length 491 [2025-02-06 06:47:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:47:14,994 INFO L471 AbstractCegarLoop]: Abstraction has 7104 states and 9318 transitions. [2025-02-06 06:47:14,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 3 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-02-06 06:47:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 7104 states and 9318 transitions. [2025-02-06 06:47:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-02-06 06:47:15,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:47:15,003 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:15,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 06:47:15,003 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:47:15,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:47:15,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1475624314, now seen corresponding path program 1 times [2025-02-06 06:47:15,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:47:15,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784320276] [2025-02-06 06:47:15,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:47:15,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms