./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5bdb144d16ce690b0c83c76766410e2201d517c4cbaa861cb0d7e2bbbb9cb236 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 19:32:35,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:32:35,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:32:35,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:32:35,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:32:35,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:32:35,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:32:35,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:32:35,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:32:35,713 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:32:35,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:32:35,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:32:35,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:32:35,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:32:35,714 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:32:35,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:32:35,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:32:35,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:32:35,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:32:35,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:32:35,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:32:35,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:32:35,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:32:35,715 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:32:35,715 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:32:35,715 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:32:35,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:32:35,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:32:35,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:32:35,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:32:35,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:32:35,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:32:35,716 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:32:35,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:32:35,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:32:35,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:32:35,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:32:35,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:32:35,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:32:35,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:32:35,717 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bdb144d16ce690b0c83c76766410e2201d517c4cbaa861cb0d7e2bbbb9cb236 [2025-03-08 19:32:35,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:32:35,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:32:35,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:32:35,971 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:32:35,971 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:32:35,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i [2025-03-08 19:32:37,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93b3d606/5089145131094bbbb10374ba00e7300c/FLAG2e8dce63a [2025-03-08 19:32:37,620 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:32:37,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i [2025-03-08 19:32:37,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93b3d606/5089145131094bbbb10374ba00e7300c/FLAG2e8dce63a [2025-03-08 19:32:37,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93b3d606/5089145131094bbbb10374ba00e7300c [2025-03-08 19:32:37,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:32:37,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:32:37,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:32:37,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:32:37,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:32:37,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:32:37" (1/1) ... [2025-03-08 19:32:37,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24eea893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:37, skipping insertion in model container [2025-03-08 19:32:37,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:32:37" (1/1) ... [2025-03-08 19:32:37,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:32:38,470 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i[147706,147719] [2025-03-08 19:32:38,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:32:38,634 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:32:38,685 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-03-08 19:32:38,687 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-03-08 19:32:38,688 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-03-08 19:32:38,689 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-03-08 19:32:38,689 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [3421] [2025-03-08 19:32:38,689 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3424] [2025-03-08 19:32:38,690 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3427] [2025-03-08 19:32:38,690 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3430] [2025-03-08 19:32:38,693 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-03-08 19:32:38,693 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-03-08 19:32:38,694 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-03-08 19:32:38,694 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-03-08 19:32:38,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i[147706,147719] [2025-03-08 19:32:38,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:32:38,888 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:32:38,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:38 WrapperNode [2025-03-08 19:32:38,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:32:38,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:32:38,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:32:38,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:32:38,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:38" (1/1) ... [2025-03-08 19:32:38,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:38" (1/1) ... [2025-03-08 19:32:39,031 INFO L138 Inliner]: procedures = 224, calls = 1326, calls flagged for inlining = 80, calls inlined = 75, statements flattened = 3189 [2025-03-08 19:32:39,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:32:39,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:32:39,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:32:39,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:32:39,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:38" (1/1) ... [2025-03-08 19:32:39,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:38" (1/1) ... [2025-03-08 19:32:39,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:38" (1/1) ... [2025-03-08 19:32:39,178 INFO L175 MemorySlicer]: Split 824 memory accesses to 20 slices as follows [2, 5, 5, 1, 29, 15, 15, 1, 26, 12, 3, 5, 8, 6, 16, 647, 3, 14, 8, 3]. 79 percent of accesses are in the largest equivalence class. The 518 initializations are split as follows [2, 5, 5, 0, 0, 8, 8, 0, 0, 0, 3, 5, 8, 6, 0, 451, 3, 3, 8, 3]. The 150 writes are split as follows [0, 0, 0, 1, 29, 3, 0, 0, 26, 2, 0, 0, 0, 0, 16, 63, 0, 10, 0, 0]. [2025-03-08 19:32:39,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:38" (1/1) ... [2025-03-08 19:32:39,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:38" (1/1) ... [2025-03-08 19:32:39,227 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:38" (1/1) ... [2025-03-08 19:32:39,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:38" (1/1) ... [2025-03-08 19:32:39,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:38" (1/1) ... [2025-03-08 19:32:39,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:38" (1/1) ... [2025-03-08 19:32:39,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:32:39,291 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:32:39,292 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:32:39,292 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:32:39,293 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:38" (1/1) ... [2025-03-08 19:32:39,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:32:39,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:32:39,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 19:32:39,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 19:32:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_port_mutex_of_lp_struct [2025-03-08 19:32:39,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_port_mutex_of_lp_struct [2025-03-08 19:32:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure lp_error [2025-03-08 19:32:39,339 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_error [2025-03-08 19:32:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:32:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:32:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:32:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:32:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:32:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:32:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:32:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:32:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 19:32:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 19:32:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 19:32:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 19:32:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 19:32:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 19:32:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 19:32:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-08 19:32:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-08 19:32:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-08 19:32:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-08 19:32:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-08 19:32:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 19:32:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 19:32:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-08 19:32:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-08 19:32:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure lp_register [2025-03-08 19:32:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_register [2025-03-08 19:32:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure file_inode [2025-03-08 19:32:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure file_inode [2025-03-08 19:32:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-03-08 19:32:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-03-08 19:32:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure lp_release_parport [2025-03-08 19:32:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_release_parport [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:32:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-08 19:32:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:32:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 19:32:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-08 19:32:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2025-03-08 19:32:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_port_mutex_of_lp_struct [2025-03-08 19:32:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_port_mutex_of_lp_struct [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure lp_set_timeout [2025-03-08 19:32:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_set_timeout [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure lp_reset [2025-03-08 19:32:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_reset [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_25 [2025-03-08 19:32:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_25 [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:32:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:32:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:32:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 19:32:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 19:32:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-08 19:32:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2025-03-08 19:32:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-03-08 19:32:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure parport_write [2025-03-08 19:32:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_write [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 19:32:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 19:32:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2025-03-08 19:32:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lp_mutex [2025-03-08 19:32:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lp_mutex [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure test_ti_thread_flag [2025-03-08 19:32:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure test_ti_thread_flag [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure parport_negotiate [2025-03-08 19:32:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_negotiate [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure parport_release [2025-03-08 19:32:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_release [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_console [2025-03-08 19:32:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_console [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-08 19:32:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-08 19:32:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-08 19:32:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-08 19:32:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-08 19:32:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure parport_set_timeout [2025-03-08 19:32:39,347 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_set_timeout [2025-03-08 19:32:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:32:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:32:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:32:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:32:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-08 19:32:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure parport_claim_or_block [2025-03-08 19:32:39,350 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_claim_or_block [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure lp_do_ioctl [2025-03-08 19:32:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_do_ioctl [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2025-03-08 19:32:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-03-08 19:32:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 19:32:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-08 19:32:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure lp_claim_parport_or_block [2025-03-08 19:32:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_claim_parport_or_block [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure compat_ptr [2025-03-08 19:32:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_ptr [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2025-03-08 19:32:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-08 19:32:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-03-08 19:32:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-08 19:32:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:32:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:32:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:32:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:32:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:32:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:32:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 19:32:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 19:32:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 19:32:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 19:32:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 19:32:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 19:32:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2025-03-08 19:32:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __bad_percpu_size [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure lp_detach [2025-03-08 19:32:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_detach [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lp_mutex [2025-03-08 19:32:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lp_mutex [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-08 19:32:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure lp_negotiate [2025-03-08 19:32:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_negotiate [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2025-03-08 19:32:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait [2025-03-08 19:32:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure lp_wait_ready [2025-03-08 19:32:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_wait_ready [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2025-03-08 19:32:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2025-03-08 19:32:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 19:32:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 19:32:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 19:32:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 19:32:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure lp_write [2025-03-08 19:32:39,356 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_write [2025-03-08 19:32:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2025-03-08 19:32:39,356 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2025-03-08 19:32:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-03-08 19:32:39,356 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-03-08 19:32:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:32:39,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:32:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure parport_yield_blocking [2025-03-08 19:32:39,356 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_yield_blocking [2025-03-08 19:32:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-08 19:32:39,356 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-08 19:32:39,802 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:32:39,803 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:32:39,900 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3868: call ULTIMATE.dealloc(~#wait~0.base, ~#wait~0.offset);havoc ~#wait~0.base, ~#wait~0.offset; [2025-03-08 19:32:39,903 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 19:32:39,984 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6259: havoc parport_register_device_#t~ret597#1.base, parport_register_device_#t~ret597#1.offset; [2025-03-08 19:32:39,984 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6189: havoc device_create_#t~ret583#1.base, device_create_#t~ret583#1.offset; [2025-03-08 19:32:39,988 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3687: havoc #t~mem69.base, #t~mem69.offset; [2025-03-08 19:32:40,094 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6229: havoc #t~nondet590; [2025-03-08 19:32:40,098 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6276: havoc #t~nondet599; [2025-03-08 19:32:40,101 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6283: havoc #t~nondet600; [2025-03-08 19:32:40,113 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6252: havoc #t~nondet595; [2025-03-08 19:32:40,116 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6301: havoc #t~nondet603; [2025-03-08 19:32:40,118 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6266: havoc #t~nondet598; [2025-03-08 19:32:40,121 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6248: havoc #t~nondet594; [2025-03-08 19:32:40,270 INFO L1307 $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-03-08 19:32:40,270 INFO L1307 $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-03-08 19:32:40,285 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6179: havoc _copy_to_user_#t~nondet581#1; [2025-03-08 19:32:40,347 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6175: havoc _copy_from_user_#t~nondet580#1; [2025-03-08 19:32:40,372 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3681: havoc #t~mem68; [2025-03-08 19:32:40,464 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6293: havoc #t~nondet601; [2025-03-08 19:32:40,582 INFO L1307 $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-03-08 19:32:45,758 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6214: havoc ldv_probe_2_#t~nondet587#1; [2025-03-08 19:32:45,758 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6218: havoc ldv_release_1_#t~nondet588#1; [2025-03-08 19:32:45,758 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6186: havoc compat_get_timeval_#t~nondet582#1; [2025-03-08 19:32:45,758 INFO L1307 $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-03-08 19:32:45,758 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6222: havoc ldv_release_2_#t~nondet589#1; [2025-03-08 19:32:45,758 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6256: havoc parport_read_#t~nondet596#1; [2025-03-08 19:32:45,759 INFO L1307 $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-03-08 19:32:45,759 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6160: havoc __parport_register_driver_#t~nondet577#1; [2025-03-08 19:32:45,759 INFO L1307 $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-03-08 19:32:45,759 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6164: havoc __register_chrdev_#t~nondet578#1; [2025-03-08 19:32:45,759 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6297: havoc simple_strtoul_#t~nondet602#1; [2025-03-08 19:32:45,759 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3655: havoc __kmalloc_#t~ret65#1.base, __kmalloc_#t~ret65#1.offset; [2025-03-08 19:32:45,759 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6199: havoc ldv_close_1_#t~nondet584#1; [2025-03-08 19:32:45,759 INFO L1307 $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-03-08 19:32:45,759 INFO L1307 $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-03-08 19:32:45,759 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6171: havoc _cond_resched_#t~nondet579#1; [2025-03-08 19:32:45,759 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6138: havoc __class_create_#t~ret576#1.base, __class_create_#t~ret576#1.offset; [2025-03-08 19:32:45,759 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6206: havoc ldv_open_1_#t~nondet585#1; [2025-03-08 19:32:45,759 INFO L1307 $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-03-08 19:32:45,759 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6240: havoc noop_llseek_#t~nondet592#1; [2025-03-08 19:32:45,759 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6210: havoc ldv_probe_1_#t~nondet586#1; [2025-03-08 19:32:45,760 INFO L1307 $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-03-08 19:32:45,760 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6244: havoc parport_claim_#t~nondet593#1; [2025-03-08 19:32:46,069 INFO L? ?]: Removed 1071 outVars from TransFormulas that were not future-live. [2025-03-08 19:32:46,069 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:32:46,143 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:32:46,143 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 19:32:46,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:32:46 BoogieIcfgContainer [2025-03-08 19:32:46,143 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:32:46,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:32:46,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:32:46,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:32:46,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:32:37" (1/3) ... [2025-03-08 19:32:46,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b43f58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:32:46, skipping insertion in model container [2025-03-08 19:32:46,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:38" (2/3) ... [2025-03-08 19:32:46,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b43f58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:32:46, skipping insertion in model container [2025-03-08 19:32:46,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:32:46" (3/3) ... [2025-03-08 19:32:46,153 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i [2025-03-08 19:32:46,166 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:32:46,169 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-03-08 19:32:46,243 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:32:46,257 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;@6ddbd963, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:32:46,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:32:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 993 states, 730 states have (on average 1.3821917808219177) internal successors, (1009), 754 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-03-08 19:32:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 19:32:46,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:46,281 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-03-08 19:32:46,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:46,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:46,286 INFO L85 PathProgramCache]: Analyzing trace with hash -996032846, now seen corresponding path program 1 times [2025-03-08 19:32:46,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:46,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513333197] [2025-03-08 19:32:46,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:46,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:47,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 19:32:47,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 19:32:47,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:47,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-08 19:32:47,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:47,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513333197] [2025-03-08 19:32:47,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513333197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:32:47,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242671353] [2025-03-08 19:32:47,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:47,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:32:47,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:32:47,826 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:32:47,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 19:32:48,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 19:32:49,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 19:32:49,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:49,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:49,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 3610 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 19:32:49,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:32:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-03-08 19:32:49,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:32:49,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242671353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:49,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:32:49,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 19:32:49,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356473660] [2025-03-08 19:32:49,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:49,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 19:32:49,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:49,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 19:32:49,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 19:32:49,229 INFO L87 Difference]: Start difference. First operand has 993 states, 730 states have (on average 1.3821917808219177) internal successors, (1009), 754 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-03-08 19:32:49,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:49,425 INFO L93 Difference]: Finished difference Result 1981 states and 2857 transitions. [2025-03-08 19:32:49,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 19:32:49,427 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-03-08 19:32:49,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:49,438 INFO L225 Difference]: With dead ends: 1981 [2025-03-08 19:32:49,439 INFO L226 Difference]: Without dead ends: 981 [2025-03-08 19:32:49,445 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-03-08 19:32:49,447 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-03-08 19:32:49,447 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-03-08 19:32:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-03-08 19:32:49,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 981. [2025-03-08 19:32:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 725 states have (on average 1.3668965517241378) internal successors, (991), 742 states have internal predecessors, (991), 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-03-08 19:32:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1382 transitions. [2025-03-08 19:32:49,528 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1382 transitions. Word has length 180 [2025-03-08 19:32:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:49,528 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1382 transitions. [2025-03-08 19:32:49,529 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-03-08 19:32:49,529 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1382 transitions. [2025-03-08 19:32:49,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 19:32:49,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:49,532 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-03-08 19:32:49,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 19:32:49,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 19:32:49,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:49,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1700897096, now seen corresponding path program 1 times [2025-03-08 19:32:49,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:49,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688747561] [2025-03-08 19:32:49,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:49,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:50,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 19:32:50,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 19:32:50,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:50,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-08 19:32:50,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:50,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688747561] [2025-03-08 19:32:50,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688747561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:50,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:32:50,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:32:50,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764205845] [2025-03-08 19:32:50,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:50,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:32:50,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:50,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:32:50,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:32:50,945 INFO L87 Difference]: Start difference. First operand 981 states and 1382 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-03-08 19:32:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:51,352 INFO L93 Difference]: Finished difference Result 2866 states and 4039 transitions. [2025-03-08 19:32:51,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:32:51,353 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-03-08 19:32:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:51,365 INFO L225 Difference]: With dead ends: 2866 [2025-03-08 19:32:51,366 INFO L226 Difference]: Without dead ends: 1923 [2025-03-08 19:32:51,369 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-03-08 19:32:51,369 INFO L435 NwaCegarLoop]: 1415 mSDtfsCounter, 1336 mSDsluCounter, 2703 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 4118 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-03-08 19:32:51,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 4118 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:32:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-03-08 19:32:51,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1905. [2025-03-08 19:32:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1419 states have (on average 1.3706835799859056) internal successors, (1945), 1446 states have internal predecessors, (1945), 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-03-08 19:32:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2688 transitions. [2025-03-08 19:32:51,443 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2688 transitions. Word has length 180 [2025-03-08 19:32:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:51,443 INFO L471 AbstractCegarLoop]: Abstraction has 1905 states and 2688 transitions. [2025-03-08 19:32:51,444 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-03-08 19:32:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2688 transitions. [2025-03-08 19:32:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 19:32:51,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:51,446 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-03-08 19:32:51,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:32:51,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:51,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:51,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1116780347, now seen corresponding path program 1 times [2025-03-08 19:32:51,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:51,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39510503] [2025-03-08 19:32:51,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:51,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:52,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 19:32:52,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 19:32:52,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:52,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-08 19:32:52,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:52,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39510503] [2025-03-08 19:32:52,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39510503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:52,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:32:52,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:32:52,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055757044] [2025-03-08 19:32:52,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:52,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:32:52,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:52,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:32:52,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:32:52,462 INFO L87 Difference]: Start difference. First operand 1905 states and 2688 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-03-08 19:32:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:52,883 INFO L93 Difference]: Finished difference Result 3793 states and 5351 transitions. [2025-03-08 19:32:52,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:32:52,885 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-03-08 19:32:52,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:52,899 INFO L225 Difference]: With dead ends: 3793 [2025-03-08 19:32:52,900 INFO L226 Difference]: Without dead ends: 1926 [2025-03-08 19:32:52,903 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-03-08 19:32:52,906 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1378 mSDsluCounter, 2705 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 4053 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:52,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 4053 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:32:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2025-03-08 19:32:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1913. [2025-03-08 19:32:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1427 states have (on average 1.368605466012614) internal successors, (1953), 1454 states have internal predecessors, (1953), 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-03-08 19:32:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2696 transitions. [2025-03-08 19:32:52,996 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2696 transitions. Word has length 181 [2025-03-08 19:32:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:52,997 INFO L471 AbstractCegarLoop]: Abstraction has 1913 states and 2696 transitions. [2025-03-08 19:32:52,997 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-03-08 19:32:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2696 transitions. [2025-03-08 19:32:52,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-08 19:32:52,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:53,000 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-03-08 19:32:53,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:32:53,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:53,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:53,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2057003727, now seen corresponding path program 1 times [2025-03-08 19:32:53,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:53,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318646237] [2025-03-08 19:32:53,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:53,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:53,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 19:32:53,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 19:32:53,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:53,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-08 19:32:53,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:53,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318646237] [2025-03-08 19:32:53,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318646237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:53,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:32:53,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:32:53,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626660108] [2025-03-08 19:32:53,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:53,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:32:53,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:53,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:32:53,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:32:53,832 INFO L87 Difference]: Start difference. First operand 1913 states and 2696 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-03-08 19:32:54,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:54,152 INFO L93 Difference]: Finished difference Result 4337 states and 6060 transitions. [2025-03-08 19:32:54,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:32:54,153 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-03-08 19:32:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:54,164 INFO L225 Difference]: With dead ends: 4337 [2025-03-08 19:32:54,164 INFO L226 Difference]: Without dead ends: 2462 [2025-03-08 19:32:54,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:32:54,170 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 432 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:54,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 2600 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:32:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2025-03-08 19:32:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2400. [2025-03-08 19:32:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 1800 states have (on average 1.3666666666666667) internal successors, (2460), 1831 states have internal predecessors, (2460), 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-03-08 19:32:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3341 transitions. [2025-03-08 19:32:54,245 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3341 transitions. Word has length 184 [2025-03-08 19:32:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:54,245 INFO L471 AbstractCegarLoop]: Abstraction has 2400 states and 3341 transitions. [2025-03-08 19:32:54,245 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-03-08 19:32:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3341 transitions. [2025-03-08 19:32:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 19:32:54,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:54,247 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-03-08 19:32:54,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:32:54,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:54,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:54,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1073019466, now seen corresponding path program 1 times [2025-03-08 19:32:54,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:54,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294744158] [2025-03-08 19:32:54,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:54,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:54,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 19:32:54,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 19:32:54,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:54,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-08 19:32:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:55,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294744158] [2025-03-08 19:32:55,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294744158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:55,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:32:55,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:32:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555611688] [2025-03-08 19:32:55,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:55,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:32:55,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:55,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:32:55,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:32:55,134 INFO L87 Difference]: Start difference. First operand 2400 states and 3341 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-03-08 19:32:59,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:32:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:59,569 INFO L93 Difference]: Finished difference Result 6888 states and 9598 transitions. [2025-03-08 19:32:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:32:59,570 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-03-08 19:32:59,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:59,592 INFO L225 Difference]: With dead ends: 6888 [2025-03-08 19:32:59,592 INFO L226 Difference]: Without dead ends: 4526 [2025-03-08 19:32:59,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:32:59,600 INFO L435 NwaCegarLoop]: 1369 mSDtfsCounter, 1277 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 2630 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:59,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 2630 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 19:32:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2025-03-08 19:32:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 4513. [2025-03-08 19:32:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4513 states, 3391 states have (on average 1.3703922146859333) internal successors, (4647), 3440 states have internal predecessors, (4647), 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-03-08 19:32:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4513 states to 4513 states and 6286 transitions. [2025-03-08 19:32:59,745 INFO L78 Accepts]: Start accepts. Automaton has 4513 states and 6286 transitions. Word has length 191 [2025-03-08 19:32:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:59,746 INFO L471 AbstractCegarLoop]: Abstraction has 4513 states and 6286 transitions. [2025-03-08 19:32:59,746 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-03-08 19:32:59,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4513 states and 6286 transitions. [2025-03-08 19:32:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 19:32:59,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:59,749 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-03-08 19:32:59,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:32:59,749 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:59,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash 132547475, now seen corresponding path program 1 times [2025-03-08 19:32:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:59,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220610553] [2025-03-08 19:32:59,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:59,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:00,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 19:33:00,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 19:33:00,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:00,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-08 19:33:00,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:00,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220610553] [2025-03-08 19:33:00,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220610553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:00,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:00,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:33:00,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136519249] [2025-03-08 19:33:00,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:00,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:33:00,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:00,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:33:00,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:00,694 INFO L87 Difference]: Start difference. First operand 4513 states and 6286 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-03-08 19:33:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:00,910 INFO L93 Difference]: Finished difference Result 4515 states and 6287 transitions. [2025-03-08 19:33:00,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:33:00,911 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-03-08 19:33:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:00,933 INFO L225 Difference]: With dead ends: 4515 [2025-03-08 19:33:00,934 INFO L226 Difference]: Without dead ends: 4512 [2025-03-08 19:33:00,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:00,939 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1325 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 1348 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-03-08 19:33:00,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 1348 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:33:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2025-03-08 19:33:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4512. [2025-03-08 19:33:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4512 states, 3391 states have (on average 1.370097316425833) internal successors, (4646), 3439 states have internal predecessors, (4646), 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-03-08 19:33:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4512 states to 4512 states and 6284 transitions. [2025-03-08 19:33:01,106 INFO L78 Accepts]: Start accepts. Automaton has 4512 states and 6284 transitions. Word has length 190 [2025-03-08 19:33:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:01,109 INFO L471 AbstractCegarLoop]: Abstraction has 4512 states and 6284 transitions. [2025-03-08 19:33:01,109 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-03-08 19:33:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 4512 states and 6284 transitions. [2025-03-08 19:33:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 19:33:01,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:01,112 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-03-08 19:33:01,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 19:33:01,112 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:01,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash -186891612, now seen corresponding path program 1 times [2025-03-08 19:33:01,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:01,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603210972] [2025-03-08 19:33:01,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:01,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:01,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 19:33:01,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 19:33:01,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:01,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-08 19:33:01,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:01,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603210972] [2025-03-08 19:33:01,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603210972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:01,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:01,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:33:01,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754517641] [2025-03-08 19:33:01,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:01,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:33:01,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:01,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:33:01,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:01,931 INFO L87 Difference]: Start difference. First operand 4512 states and 6284 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-03-08 19:33:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:02,118 INFO L93 Difference]: Finished difference Result 4514 states and 6285 transitions. [2025-03-08 19:33:02,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:33:02,119 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-03-08 19:33:02,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:02,139 INFO L225 Difference]: With dead ends: 4514 [2025-03-08 19:33:02,140 INFO L226 Difference]: Without dead ends: 4511 [2025-03-08 19:33:02,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:02,142 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 1322 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 1346 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-03-08 19:33:02,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 1346 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:33:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4511 states. [2025-03-08 19:33:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4511 to 4511. [2025-03-08 19:33:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4511 states, 3391 states have (on average 1.369802418165733) internal successors, (4645), 3438 states have internal predecessors, (4645), 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-03-08 19:33:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4511 states to 4511 states and 6282 transitions. [2025-03-08 19:33:02,346 INFO L78 Accepts]: Start accepts. Automaton has 4511 states and 6282 transitions. Word has length 191 [2025-03-08 19:33:02,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:02,347 INFO L471 AbstractCegarLoop]: Abstraction has 4511 states and 6282 transitions. [2025-03-08 19:33:02,347 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-03-08 19:33:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 4511 states and 6282 transitions. [2025-03-08 19:33:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 19:33:02,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:02,350 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-03-08 19:33:02,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 19:33:02,350 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:02,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:02,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1499569740, now seen corresponding path program 1 times [2025-03-08 19:33:02,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:02,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74884706] [2025-03-08 19:33:02,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:02,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:02,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 19:33:02,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 19:33:02,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:02,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-08 19:33:03,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:03,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74884706] [2025-03-08 19:33:03,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74884706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:03,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:03,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:33:03,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111445006] [2025-03-08 19:33:03,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:03,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:33:03,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:03,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:33:03,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:03,125 INFO L87 Difference]: Start difference. First operand 4511 states and 6282 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-03-08 19:33:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:03,380 INFO L93 Difference]: Finished difference Result 5009 states and 6786 transitions. [2025-03-08 19:33:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:33:03,385 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-03-08 19:33:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:03,415 INFO L225 Difference]: With dead ends: 5009 [2025-03-08 19:33:03,415 INFO L226 Difference]: Without dead ends: 5005 [2025-03-08 19:33:03,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:03,420 INFO L435 NwaCegarLoop]: 1353 mSDtfsCounter, 1010 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1768 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-03-08 19:33:03,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1768 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:33:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5005 states. [2025-03-08 19:33:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5005 to 5001. [2025-03-08 19:33:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5001 states, 3715 states have (on average 1.3448183041722745) internal successors, (4996), 3760 states have internal predecessors, (4996), 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-03-08 19:33:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5001 states to 5001 states and 6775 transitions. [2025-03-08 19:33:03,617 INFO L78 Accepts]: Start accepts. Automaton has 5001 states and 6775 transitions. Word has length 192 [2025-03-08 19:33:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:03,617 INFO L471 AbstractCegarLoop]: Abstraction has 5001 states and 6775 transitions. [2025-03-08 19:33:03,617 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-03-08 19:33:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 5001 states and 6775 transitions. [2025-03-08 19:33:03,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 19:33:03,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:03,621 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-03-08 19:33:03,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 19:33:03,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:03,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:03,623 INFO L85 PathProgramCache]: Analyzing trace with hash 757080229, now seen corresponding path program 1 times [2025-03-08 19:33:03,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:03,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690850882] [2025-03-08 19:33:03,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:03,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:04,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 19:33:04,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 19:33:04,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:04,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-08 19:33:04,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:04,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690850882] [2025-03-08 19:33:04,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690850882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:04,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:04,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:33:04,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644164195] [2025-03-08 19:33:04,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:04,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:33:04,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:04,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:33:04,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:04,615 INFO L87 Difference]: Start difference. First operand 5001 states and 6775 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-03-08 19:33:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:04,811 INFO L93 Difference]: Finished difference Result 5003 states and 6776 transitions. [2025-03-08 19:33:04,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:33:04,812 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-03-08 19:33:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:04,831 INFO L225 Difference]: With dead ends: 5003 [2025-03-08 19:33:04,831 INFO L226 Difference]: Without dead ends: 5000 [2025-03-08 19:33:04,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:04,834 INFO L435 NwaCegarLoop]: 1340 mSDtfsCounter, 1314 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 1340 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-03-08 19:33:04,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 1340 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:33:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5000 states. [2025-03-08 19:33:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5000 to 5000. [2025-03-08 19:33:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5000 states, 3715 states have (on average 1.3445491251682369) internal successors, (4995), 3759 states have internal predecessors, (4995), 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-03-08 19:33:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5000 states to 5000 states and 6773 transitions. [2025-03-08 19:33:05,030 INFO L78 Accepts]: Start accepts. Automaton has 5000 states and 6773 transitions. Word has length 193 [2025-03-08 19:33:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:05,030 INFO L471 AbstractCegarLoop]: Abstraction has 5000 states and 6773 transitions. [2025-03-08 19:33:05,030 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-03-08 19:33:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 5000 states and 6773 transitions. [2025-03-08 19:33:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 19:33:05,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:05,033 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-03-08 19:33:05,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 19:33:05,033 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:05,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:05,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1993751509, now seen corresponding path program 1 times [2025-03-08 19:33:05,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:05,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821739542] [2025-03-08 19:33:05,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:05,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 19:33:05,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 19:33:05,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:05,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-08 19:33:05,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:05,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821739542] [2025-03-08 19:33:05,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821739542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:05,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:05,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:33:05,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487444495] [2025-03-08 19:33:05,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:05,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:33:05,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:05,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:33:05,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:05,810 INFO L87 Difference]: Start difference. First operand 5000 states and 6773 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-03-08 19:33:06,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:06,235 INFO L93 Difference]: Finished difference Result 14802 states and 20163 transitions. [2025-03-08 19:33:06,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:33:06,236 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-03-08 19:33:06,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:06,275 INFO L225 Difference]: With dead ends: 14802 [2025-03-08 19:33:06,276 INFO L226 Difference]: Without dead ends: 9803 [2025-03-08 19:33:06,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:06,295 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 1313 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 2978 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-03-08 19:33:06,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 2978 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:33:06,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9803 states. [2025-03-08 19:33:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9803 to 9761. [2025-03-08 19:33:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9761 states, 7273 states have (on average 1.3460745222054173) internal successors, (9790), 7363 states have internal predecessors, (9790), 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-03-08 19:33:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9761 states to 9761 states and 13287 transitions. [2025-03-08 19:33:06,685 INFO L78 Accepts]: Start accepts. Automaton has 9761 states and 13287 transitions. Word has length 194 [2025-03-08 19:33:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:06,685 INFO L471 AbstractCegarLoop]: Abstraction has 9761 states and 13287 transitions. [2025-03-08 19:33:06,686 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-03-08 19:33:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 9761 states and 13287 transitions. [2025-03-08 19:33:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-08 19:33:06,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:06,693 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-03-08 19:33:06,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 19:33:06,693 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:06,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:06,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1686048034, now seen corresponding path program 1 times [2025-03-08 19:33:06,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:06,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958426806] [2025-03-08 19:33:06,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:06,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:07,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-08 19:33:07,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-08 19:33:07,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:07,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-03-08 19:33:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:07,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958426806] [2025-03-08 19:33:07,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958426806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:07,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:07,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:33:07,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595438568] [2025-03-08 19:33:07,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:07,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:33:07,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:07,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:33:07,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:07,520 INFO L87 Difference]: Start difference. First operand 9761 states and 13287 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-03-08 19:33:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:08,226 INFO L93 Difference]: Finished difference Result 19508 states and 26557 transitions. [2025-03-08 19:33:08,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:33:08,227 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-03-08 19:33:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:08,260 INFO L225 Difference]: With dead ends: 19508 [2025-03-08 19:33:08,260 INFO L226 Difference]: Without dead ends: 9785 [2025-03-08 19:33:08,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:08,284 INFO L435 NwaCegarLoop]: 1337 mSDtfsCounter, 3 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2670 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:33:08,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2670 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 19:33:08,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9785 states. [2025-03-08 19:33:08,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9785 to 9765. [2025-03-08 19:33:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9765 states, 7277 states have (on average 1.3458842929778756) internal successors, (9794), 7367 states have internal predecessors, (9794), 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-03-08 19:33:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9765 states to 9765 states and 13291 transitions. [2025-03-08 19:33:08,674 INFO L78 Accepts]: Start accepts. Automaton has 9765 states and 13291 transitions. Word has length 254 [2025-03-08 19:33:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:08,675 INFO L471 AbstractCegarLoop]: Abstraction has 9765 states and 13291 transitions. [2025-03-08 19:33:08,675 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-03-08 19:33:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 9765 states and 13291 transitions. [2025-03-08 19:33:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-08 19:33:08,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:08,682 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-03-08 19:33:08,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 19:33:08,682 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:08,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:08,682 INFO L85 PathProgramCache]: Analyzing trace with hash 132117828, now seen corresponding path program 1 times [2025-03-08 19:33:08,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:08,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719158459] [2025-03-08 19:33:08,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:08,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:09,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 19:33:09,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 19:33:09,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:09,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-08 19:33:09,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:09,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719158459] [2025-03-08 19:33:09,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719158459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:33:09,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914183589] [2025-03-08 19:33:09,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:09,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:33:09,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:33:09,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:33:09,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 19:33:10,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 19:33:11,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 19:33:11,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:11,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:11,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 4151 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:33:11,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:33:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-03-08 19:33:11,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:33:11,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914183589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:11,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:33:11,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:33:11,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821479943] [2025-03-08 19:33:11,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:11,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:33:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:11,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:33:11,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:33:11,371 INFO L87 Difference]: Start difference. First operand 9765 states and 13291 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-03-08 19:33:15,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:33:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:15,706 INFO L93 Difference]: Finished difference Result 15228 states and 20652 transitions. [2025-03-08 19:33:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:33:15,707 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-03-08 19:33:15,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:15,729 INFO L225 Difference]: With dead ends: 15228 [2025-03-08 19:33:15,729 INFO L226 Difference]: Without dead ends: 5497 [2025-03-08 19:33:15,749 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-03-08 19:33:15,750 INFO L435 NwaCegarLoop]: 1341 mSDtfsCounter, 9 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2676 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-03-08 19:33:15,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2676 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 19:33:15,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5497 states. [2025-03-08 19:33:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5497 to 5476. [2025-03-08 19:33:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5476 states, 4067 states have (on average 1.3358741086796164) internal successors, (5433), 4118 states have internal predecessors, (5433), 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-03-08 19:33:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 7382 transitions. [2025-03-08 19:33:15,957 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 7382 transitions. Word has length 266 [2025-03-08 19:33:15,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:15,958 INFO L471 AbstractCegarLoop]: Abstraction has 5476 states and 7382 transitions. [2025-03-08 19:33:15,958 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-03-08 19:33:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 7382 transitions. [2025-03-08 19:33:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-08 19:33:15,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:15,963 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-03-08 19:33:15,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 19:33:16,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 19:33:16,164 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:16,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2096840290, now seen corresponding path program 1 times [2025-03-08 19:33:16,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:16,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672104122] [2025-03-08 19:33:16,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:16,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:16,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-08 19:33:16,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-08 19:33:16,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:16,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-03-08 19:33:17,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:17,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672104122] [2025-03-08 19:33:17,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672104122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:33:17,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827095936] [2025-03-08 19:33:17,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:17,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:33:17,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:33:17,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:33:17,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 19:33:18,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-08 19:33:18,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-08 19:33:18,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:18,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:18,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 4231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:33:18,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:33:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 255 proven. 1 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 19:33:18,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:33:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-03-08 19:33:19,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827095936] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:33:19,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:33:19,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 19:33:19,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173042001] [2025-03-08 19:33:19,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:33:19,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 19:33:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:19,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 19:33:19,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:33:19,039 INFO L87 Difference]: Start difference. First operand 5476 states and 7382 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-03-08 19:33:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:19,649 INFO L93 Difference]: Finished difference Result 10775 states and 14540 transitions. [2025-03-08 19:33:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:33:19,650 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-03-08 19:33:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:19,670 INFO L225 Difference]: With dead ends: 10775 [2025-03-08 19:33:19,670 INFO L226 Difference]: Without dead ends: 5548 [2025-03-08 19:33:19,682 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-03-08 19:33:19,682 INFO L435 NwaCegarLoop]: 1337 mSDtfsCounter, 6 mSDsluCounter, 5324 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6661 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 19:33:19,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6661 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 19:33:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2025-03-08 19:33:19,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5548. [2025-03-08 19:33:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5548 states, 4115 states have (on average 1.3319562575941677) internal successors, (5481), 4166 states have internal predecessors, (5481), 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-03-08 19:33:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5548 states to 5548 states and 7478 transitions. [2025-03-08 19:33:19,889 INFO L78 Accepts]: Start accepts. Automaton has 5548 states and 7478 transitions. Word has length 283 [2025-03-08 19:33:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:19,890 INFO L471 AbstractCegarLoop]: Abstraction has 5548 states and 7478 transitions. [2025-03-08 19:33:19,890 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-03-08 19:33:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand 5548 states and 7478 transitions. [2025-03-08 19:33:19,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-08 19:33:19,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:19,895 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-03-08 19:33:19,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 19:33:20,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:33:20,096 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:20,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:20,097 INFO L85 PathProgramCache]: Analyzing trace with hash 458914476, now seen corresponding path program 2 times [2025-03-08 19:33:20,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:20,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549674280] [2025-03-08 19:33:20,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:33:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:20,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 319 statements into 2 equivalence classes. [2025-03-08 19:33:20,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 319 statements. [2025-03-08 19:33:20,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 19:33:20,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2025-03-08 19:33:20,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:20,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549674280] [2025-03-08 19:33:20,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549674280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:20,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:20,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:33:20,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393188850] [2025-03-08 19:33:20,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:20,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:33:20,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:20,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:33:20,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:20,967 INFO L87 Difference]: Start difference. First operand 5548 states and 7478 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-03-08 19:33:24,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:33:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:25,221 INFO L93 Difference]: Finished difference Result 5556 states and 7484 transitions. [2025-03-08 19:33:25,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:33:25,221 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-03-08 19:33:25,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:25,240 INFO L225 Difference]: With dead ends: 5556 [2025-03-08 19:33:25,240 INFO L226 Difference]: Without dead ends: 5553 [2025-03-08 19:33:25,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:25,243 INFO L435 NwaCegarLoop]: 1454 mSDtfsCounter, 423 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 2501 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:33:25,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 2501 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:33:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5553 states. [2025-03-08 19:33:25,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5553 to 5547. [2025-03-08 19:33:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5547 states, 4115 states have (on average 1.3309842041312272) internal successors, (5477), 4165 states have internal predecessors, (5477), 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-03-08 19:33:25,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5547 states to 5547 states and 7473 transitions. [2025-03-08 19:33:25,449 INFO L78 Accepts]: Start accepts. Automaton has 5547 states and 7473 transitions. Word has length 319 [2025-03-08 19:33:25,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:25,450 INFO L471 AbstractCegarLoop]: Abstraction has 5547 states and 7473 transitions. [2025-03-08 19:33:25,450 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-03-08 19:33:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 5547 states and 7473 transitions. [2025-03-08 19:33:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-08 19:33:25,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:25,460 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] [2025-03-08 19:33:25,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 19:33:25,460 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:25,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:25,462 INFO L85 PathProgramCache]: Analyzing trace with hash -176101489, now seen corresponding path program 1 times [2025-03-08 19:33:25,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:25,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289786895] [2025-03-08 19:33:25,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:25,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:26,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-08 19:33:26,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-08 19:33:26,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:26,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-03-08 19:33:26,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:26,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289786895] [2025-03-08 19:33:26,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289786895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:26,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:26,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:33:26,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332409533] [2025-03-08 19:33:26,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:26,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:33:26,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:26,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:33:26,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:33:26,567 INFO L87 Difference]: Start difference. First operand 5547 states and 7473 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-03-08 19:33:30,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:33:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:30,957 INFO L93 Difference]: Finished difference Result 10868 states and 14638 transitions. [2025-03-08 19:33:30,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:33:30,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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 353 [2025-03-08 19:33:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:31,010 INFO L225 Difference]: With dead ends: 10868 [2025-03-08 19:33:31,010 INFO L226 Difference]: Without dead ends: 5545 [2025-03-08 19:33:31,017 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-03-08 19:33:31,017 INFO L435 NwaCegarLoop]: 1338 mSDtfsCounter, 10 mSDsluCounter, 3999 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5337 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-03-08 19:33:31,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5337 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 19:33:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5545 states. [2025-03-08 19:33:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5545 to 5509. [2025-03-08 19:33:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5509 states, 4086 states have (on average 1.330396475770925) internal successors, (5436), 4139 states have internal predecessors, (5436), 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-03-08 19:33:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 7418 transitions. [2025-03-08 19:33:31,181 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 7418 transitions. Word has length 353 [2025-03-08 19:33:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:31,181 INFO L471 AbstractCegarLoop]: Abstraction has 5509 states and 7418 transitions. [2025-03-08 19:33:31,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-03-08 19:33:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 7418 transitions. [2025-03-08 19:33:31,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-08 19:33:31,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:31,190 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-03-08 19:33:31,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 19:33:31,190 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:31,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:31,191 INFO L85 PathProgramCache]: Analyzing trace with hash -538378690, now seen corresponding path program 1 times [2025-03-08 19:33:31,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:31,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488468330] [2025-03-08 19:33:31,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:31,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:31,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-08 19:33:31,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-08 19:33:31,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:31,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2025-03-08 19:33:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:32,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488468330] [2025-03-08 19:33:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488468330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:32,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:32,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:33:32,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709242116] [2025-03-08 19:33:32,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:32,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:33:32,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:32,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:33:32,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:32,155 INFO L87 Difference]: Start difference. First operand 5509 states and 7418 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-03-08 19:33:36,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:33:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:36,552 INFO L93 Difference]: Finished difference Result 10768 states and 14507 transitions. [2025-03-08 19:33:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:33:36,554 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-03-08 19:33:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:36,571 INFO L225 Difference]: With dead ends: 10768 [2025-03-08 19:33:36,571 INFO L226 Difference]: Without dead ends: 5511 [2025-03-08 19:33:36,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:36,581 INFO L435 NwaCegarLoop]: 2172 mSDtfsCounter, 1278 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 3463 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:33:36,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 3463 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 19:33:36,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5511 states. [2025-03-08 19:33:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5511 to 5462. [2025-03-08 19:33:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5462 states, 4047 states have (on average 1.3286384976525822) internal successors, (5377), 4102 states have internal predecessors, (5377), 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-03-08 19:33:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5462 states to 5462 states and 7326 transitions. [2025-03-08 19:33:36,749 INFO L78 Accepts]: Start accepts. Automaton has 5462 states and 7326 transitions. Word has length 369 [2025-03-08 19:33:36,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:36,750 INFO L471 AbstractCegarLoop]: Abstraction has 5462 states and 7326 transitions. [2025-03-08 19:33:36,750 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-03-08 19:33:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 5462 states and 7326 transitions. [2025-03-08 19:33:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-08 19:33:36,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:36,758 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-03-08 19:33:36,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 19:33:36,758 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:36,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:36,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2083215046, now seen corresponding path program 1 times [2025-03-08 19:33:36,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:36,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081903324] [2025-03-08 19:33:36,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:36,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:37,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-08 19:33:37,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-08 19:33:37,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:37,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-03-08 19:33:37,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:37,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081903324] [2025-03-08 19:33:37,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081903324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:37,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:37,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:33:37,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624864991] [2025-03-08 19:33:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:37,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:33:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:37,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:33:37,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:37,592 INFO L87 Difference]: Start difference. First operand 5462 states and 7326 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-03-08 19:33:41,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:33:42,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:42,103 INFO L93 Difference]: Finished difference Result 13045 states and 17466 transitions. [2025-03-08 19:33:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:33:42,103 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-03-08 19:33:42,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:42,133 INFO L225 Difference]: With dead ends: 13045 [2025-03-08 19:33:42,133 INFO L226 Difference]: Without dead ends: 7835 [2025-03-08 19:33:42,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:42,146 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 911 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:33:42,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 2819 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 87 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 19:33:42,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7835 states. [2025-03-08 19:33:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7835 to 7671. [2025-03-08 19:33:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7671 states, 5714 states have (on average 1.333391669583479) internal successors, (7619), 5801 states have internal predecessors, (7619), 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-03-08 19:33:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7671 states to 7671 states and 10240 transitions. [2025-03-08 19:33:42,611 INFO L78 Accepts]: Start accepts. Automaton has 7671 states and 10240 transitions. Word has length 370 [2025-03-08 19:33:42,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:42,611 INFO L471 AbstractCegarLoop]: Abstraction has 7671 states and 10240 transitions. [2025-03-08 19:33:42,612 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-03-08 19:33:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 7671 states and 10240 transitions. [2025-03-08 19:33:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-08 19:33:42,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:42,620 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-03-08 19:33:42,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 19:33:42,620 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:42,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:42,620 INFO L85 PathProgramCache]: Analyzing trace with hash -527062563, now seen corresponding path program 1 times [2025-03-08 19:33:42,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:42,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288338696] [2025-03-08 19:33:42,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:42,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:43,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-08 19:33:43,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-08 19:33:43,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:43,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-03-08 19:33:43,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:43,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288338696] [2025-03-08 19:33:43,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288338696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:33:43,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334690322] [2025-03-08 19:33:43,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:43,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:33:43,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:33:43,810 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:33:43,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 19:33:45,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-08 19:33:45,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-08 19:33:45,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:45,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:45,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 5007 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 19:33:45,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:33:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 255 proven. 40 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-08 19:33:45,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:33:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-03-08 19:33:46,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334690322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:33:46,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:33:46,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 19:33:46,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690775165] [2025-03-08 19:33:46,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:33:46,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 19:33:46,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:46,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 19:33:46,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-08 19:33:46,199 INFO L87 Difference]: Start difference. First operand 7671 states and 10240 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-03-08 19:33:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:47,003 INFO L93 Difference]: Finished difference Result 15186 states and 20290 transitions. [2025-03-08 19:33:47,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 19:33:47,004 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-03-08 19:33:47,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:47,027 INFO L225 Difference]: With dead ends: 15186 [2025-03-08 19:33:47,027 INFO L226 Difference]: Without dead ends: 7767 [2025-03-08 19:33:47,041 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-03-08 19:33:47,041 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 3 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3993 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 19:33:47,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3993 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 19:33:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7767 states. [2025-03-08 19:33:47,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7767 to 7767. [2025-03-08 19:33:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7767 states, 5778 states have (on average 1.329698857736241) internal successors, (7683), 5865 states have internal predecessors, (7683), 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-03-08 19:33:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7767 states to 7767 states and 10368 transitions. [2025-03-08 19:33:47,335 INFO L78 Accepts]: Start accepts. Automaton has 7767 states and 10368 transitions. Word has length 369 [2025-03-08 19:33:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:47,335 INFO L471 AbstractCegarLoop]: Abstraction has 7767 states and 10368 transitions. [2025-03-08 19:33:47,336 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-03-08 19:33:47,336 INFO L276 IsEmpty]: Start isEmpty. Operand 7767 states and 10368 transitions. [2025-03-08 19:33:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-03-08 19:33:47,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:47,341 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-03-08 19:33:47,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 19:33:47,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 19:33:47,542 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:47,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:47,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1249615685, now seen corresponding path program 2 times [2025-03-08 19:33:47,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:47,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277201227] [2025-03-08 19:33:47,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:33:47,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:48,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 417 statements into 2 equivalence classes. [2025-03-08 19:33:48,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 88 of 417 statements. [2025-03-08 19:33:48,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 19:33:48,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1223 trivial. 0 not checked. [2025-03-08 19:33:48,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:48,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277201227] [2025-03-08 19:33:48,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277201227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:48,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:48,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:33:48,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196847156] [2025-03-08 19:33:48,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:48,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:33:48,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:48,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:33:48,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:33:48,549 INFO L87 Difference]: Start difference. First operand 7767 states and 10368 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-03-08 19:33:49,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:49,051 INFO L93 Difference]: Finished difference Result 8088 states and 10694 transitions. [2025-03-08 19:33:49,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:33:49,052 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-03-08 19:33:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:49,078 INFO L225 Difference]: With dead ends: 8088 [2025-03-08 19:33:49,079 INFO L226 Difference]: Without dead ends: 7041 [2025-03-08 19:33:49,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:33:49,084 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 0 mSDsluCounter, 5358 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6701 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:33:49,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6701 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:33:49,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7041 states. [2025-03-08 19:33:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7041 to 7041. [2025-03-08 19:33:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7041 states, 5235 states have (on average 1.318815663801337) internal successors, (6904), 5303 states have internal predecessors, (6904), 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-03-08 19:33:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7041 states to 7041 states and 9292 transitions. [2025-03-08 19:33:49,308 INFO L78 Accepts]: Start accepts. Automaton has 7041 states and 9292 transitions. Word has length 417 [2025-03-08 19:33:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:49,308 INFO L471 AbstractCegarLoop]: Abstraction has 7041 states and 9292 transitions. [2025-03-08 19:33:49,308 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-03-08 19:33:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand 7041 states and 9292 transitions. [2025-03-08 19:33:49,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-08 19:33:49,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:49,316 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-03-08 19:33:49,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 19:33:49,316 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:49,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:49,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1133770001, now seen corresponding path program 1 times [2025-03-08 19:33:49,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:49,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739817053] [2025-03-08 19:33:49,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:49,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:50,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-08 19:33:50,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-08 19:33:50,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:50,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1231 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1223 trivial. 0 not checked. [2025-03-08 19:33:50,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:50,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739817053] [2025-03-08 19:33:50,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739817053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:50,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:50,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:33:50,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394016355] [2025-03-08 19:33:50,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:50,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:33:50,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:50,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:33:50,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:33:50,670 INFO L87 Difference]: Start difference. First operand 7041 states and 9292 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-03-08 19:33:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:50,992 INFO L93 Difference]: Finished difference Result 9737 states and 12807 transitions. [2025-03-08 19:33:50,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:33:50,992 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-03-08 19:33:50,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:51,011 INFO L225 Difference]: With dead ends: 9737 [2025-03-08 19:33:51,011 INFO L226 Difference]: Without dead ends: 7027 [2025-03-08 19:33:51,016 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-03-08 19:33:51,016 INFO L435 NwaCegarLoop]: 1336 mSDtfsCounter, 0 mSDsluCounter, 5338 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6674 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-03-08 19:33:51,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6674 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:33:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7027 states. [2025-03-08 19:33:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7027 to 7027. [2025-03-08 19:33:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7027 states, 5225 states have (on average 1.3186602870813398) internal successors, (6890), 5293 states have internal predecessors, (6890), 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-03-08 19:33:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7027 states to 7027 states and 9274 transitions. [2025-03-08 19:33:51,256 INFO L78 Accepts]: Start accepts. Automaton has 7027 states and 9274 transitions. Word has length 430 [2025-03-08 19:33:51,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:51,256 INFO L471 AbstractCegarLoop]: Abstraction has 7027 states and 9274 transitions. [2025-03-08 19:33:51,257 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-03-08 19:33:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 7027 states and 9274 transitions. [2025-03-08 19:33:51,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-08 19:33:51,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:51,267 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-03-08 19:33:51,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 19:33:51,267 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:51,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:51,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1889840730, now seen corresponding path program 1 times [2025-03-08 19:33:51,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:51,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123517620] [2025-03-08 19:33:51,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:51,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:51,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-08 19:33:51,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-08 19:33:51,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:51,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:52,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2025-03-08 19:33:52,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:52,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123517620] [2025-03-08 19:33:52,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123517620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:52,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:52,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:33:52,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366384147] [2025-03-08 19:33:52,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:52,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:33:52,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:52,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:33:52,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:52,227 INFO L87 Difference]: Start difference. First operand 7027 states and 9274 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-03-08 19:33:52,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:52,618 INFO L93 Difference]: Finished difference Result 13802 states and 18256 transitions. [2025-03-08 19:33:52,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:33:52,619 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-03-08 19:33:52,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:52,650 INFO L225 Difference]: With dead ends: 13802 [2025-03-08 19:33:52,650 INFO L226 Difference]: Without dead ends: 7027 [2025-03-08 19:33:52,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:33:52,666 INFO L435 NwaCegarLoop]: 1333 mSDtfsCounter, 0 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2660 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:33:52,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2660 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:33:52,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7027 states. [2025-03-08 19:33:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7027 to 7027. [2025-03-08 19:33:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7027 states, 5225 states have (on average 1.3152153110047846) internal successors, (6872), 5293 states have internal predecessors, (6872), 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-03-08 19:33:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7027 states to 7027 states and 9256 transitions. [2025-03-08 19:33:52,890 INFO L78 Accepts]: Start accepts. Automaton has 7027 states and 9256 transitions. Word has length 477 [2025-03-08 19:33:52,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:52,890 INFO L471 AbstractCegarLoop]: Abstraction has 7027 states and 9256 transitions. [2025-03-08 19:33:52,890 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-03-08 19:33:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 7027 states and 9256 transitions. [2025-03-08 19:33:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-08 19:33:52,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:52,901 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-03-08 19:33:52,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 19:33:52,901 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:52,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:52,902 INFO L85 PathProgramCache]: Analyzing trace with hash -227136938, now seen corresponding path program 1 times [2025-03-08 19:33:52,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:52,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818106987] [2025-03-08 19:33:52,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:52,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:53,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-08 19:33:53,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-08 19:33:53,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:53,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2025-03-08 19:33:54,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818106987] [2025-03-08 19:33:54,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818106987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:54,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:33:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237143892] [2025-03-08 19:33:54,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:54,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:33:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:54,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:33:54,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:33:54,080 INFO L87 Difference]: Start difference. First operand 7027 states and 9256 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-03-08 19:33:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:54,532 INFO L93 Difference]: Finished difference Result 9723 states and 12765 transitions. [2025-03-08 19:33:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:33:54,533 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-03-08 19:33:54,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:54,561 INFO L225 Difference]: With dead ends: 9723 [2025-03-08 19:33:54,561 INFO L226 Difference]: Without dead ends: 7025 [2025-03-08 19:33:54,569 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-03-08 19:33:54,573 INFO L435 NwaCegarLoop]: 1333 mSDtfsCounter, 0 mSDsluCounter, 5325 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6658 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:33:54,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6658 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:33:54,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7025 states. [2025-03-08 19:33:54,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7025 to 7025. [2025-03-08 19:33:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7025 states, 5223 states have (on average 1.314953092092667) internal successors, (6868), 5291 states have internal predecessors, (6868), 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-03-08 19:33:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 9252 transitions. [2025-03-08 19:33:54,876 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 9252 transitions. Word has length 480 [2025-03-08 19:33:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:54,877 INFO L471 AbstractCegarLoop]: Abstraction has 7025 states and 9252 transitions. [2025-03-08 19:33:54,877 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-03-08 19:33:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 9252 transitions. [2025-03-08 19:33:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-08 19:33:54,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:54,889 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-03-08 19:33:54,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 19:33:54,889 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:54,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1793850983, now seen corresponding path program 1 times [2025-03-08 19:33:54,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:54,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58394370] [2025-03-08 19:33:54,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:33:54,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:55,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-08 19:33:55,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-08 19:33:55,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:55,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2025-03-08 19:33:56,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:56,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58394370] [2025-03-08 19:33:56,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58394370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:33:56,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:33:56,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:33:56,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611698646] [2025-03-08 19:33:56,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:33:56,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:33:56,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:56,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:33:56,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:33:56,171 INFO L87 Difference]: Start difference. First operand 7025 states and 9252 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)