./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.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-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.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 f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 19:11:59,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:11:59,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:11:59,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:11:59,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:11:59,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:11:59,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:11:59,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:11:59,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:11:59,193 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:11:59,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:11:59,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:11:59,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:11:59,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:11:59,194 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:11:59,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:11:59,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:11:59,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:11:59,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:11:59,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:11:59,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:11:59,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:11:59,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:11:59,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:11:59,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:11:59,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:11:59,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:11:59,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:11:59,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:11:59,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:11:59,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:11:59,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:11:59,196 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:11:59,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:11:59,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:11:59,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:11:59,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:11:59,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:11:59,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:11:59,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:11:59,197 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 -> f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b [2025-03-08 19:11:59,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:11:59,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:11:59,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:11:59,420 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:11:59,420 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:11:59,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2025-03-08 19:12:00,533 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26288c111/6ed5a6d79ec04af2afddd19c5884bcc5/FLAGe878d3352 [2025-03-08 19:12:00,997 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:12:00,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2025-03-08 19:12:01,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26288c111/6ed5a6d79ec04af2afddd19c5884bcc5/FLAGe878d3352 [2025-03-08 19:12:01,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26288c111/6ed5a6d79ec04af2afddd19c5884bcc5 [2025-03-08 19:12:01,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:12:01,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:12:01,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:12:01,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:12:01,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:12:01,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:12:01" (1/1) ... [2025-03-08 19:12:01,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eaa85da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:01, skipping insertion in model container [2025-03-08 19:12:01,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:12:01" (1/1) ... [2025-03-08 19:12:01,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:12:01,819 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-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2025-03-08 19:12:02,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:12:02,161 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:12:02,278 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"); [5282] [2025-03-08 19:12:02,280 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 %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5289] [2025-03-08 19:12:02,281 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"); [5297-5298] [2025-03-08 19:12:02,281 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"); [5306-5307] [2025-03-08 19:12:02,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [5320] [2025-03-08 19:12:02,286 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; incl %0": "+m" (v->counter)); [5383] [2025-03-08 19:12:02,286 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; decl %0; sete %1": "+m" (v->counter), "=qm" (c): : "memory"); [5391-5392] [2025-03-08 19:12:02,300 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-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2025-03-08 19:12:02,317 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [5963] [2025-03-08 19:12:02,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [5966] [2025-03-08 19:12:02,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [5969] [2025-03-08 19:12:02,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [5972] [2025-03-08 19:12:02,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [5975] [2025-03-08 19:12:02,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [5991-5992] [2025-03-08 19:12:02,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [5995-5996] [2025-03-08 19:12:02,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [5999-6000] [2025-03-08 19:12:02,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6003-6004] [2025-03-08 19:12:02,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6007-6008] [2025-03-08 19:12:02,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6031-6032] [2025-03-08 19:12:02,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6035-6036] [2025-03-08 19:12:02,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6039-6040] [2025-03-08 19:12:02,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6043-6044] [2025-03-08 19:12:02,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6047-6048] [2025-03-08 19:12:02,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6176] [2025-03-08 19:12:02,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6179] [2025-03-08 19:12:02,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6182] [2025-03-08 19:12:02,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6185] [2025-03-08 19:12:02,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6188] [2025-03-08 19:12:02,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu), "=r" (__val_gu): "0" (p), "i" (4UL)); [6200-6201] [2025-03-08 19:12:02,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((u32 *)argp): "ebx"); [6218-6219] [2025-03-08 19:12:02,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((u32 *)argp): "ebx"); [6222-6223] [2025-03-08 19:12:02,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((u32 *)argp): "ebx"); [6226-6227] [2025-03-08 19:12:02,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((u32 *)argp): "ebx"); [6230-6231] [2025-03-08 19:12:02,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((u32 *)argp): "ebx"); [6234-6235] [2025-03-08 19:12:02,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu___0), "=r" (__val_gu___0): "0" ((u32 *)argp), "i" (4UL)); [6247-6248] [2025-03-08 19:12:02,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((u32 *)argp): "ebx"); [6261-6262] [2025-03-08 19:12:02,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((u32 *)argp): "ebx"); [6265-6266] [2025-03-08 19:12:02,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((u32 *)argp): "ebx"); [6269-6270] [2025-03-08 19:12:02,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((u32 *)argp): "ebx"); [6273-6274] [2025-03-08 19:12:02,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((u32 *)argp): "ebx"); [6277-6278] [2025-03-08 19:12:02,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu___1), "=r" (__val_gu___1): "0" ((u32 *)argp), "i" (4UL)); [6290-6291] [2025-03-08 19:12:02,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___2): "0" (__pu_val___2), "c" (p): "ebx"); [6328-6329] [2025-03-08 19:12:02,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___2): "0" (__pu_val___2), "c" (p): "ebx"); [6332-6333] [2025-03-08 19:12:02,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___2): "0" (__pu_val___2), "c" (p): "ebx"); [6336-6337] [2025-03-08 19:12:02,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___2): "0" (__pu_val___2), "c" (p): "ebx"); [6340-6341] [2025-03-08 19:12:02,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___2): "0" (__pu_val___2), "c" (p): "ebx"); [6344-6345] [2025-03-08 19:12:02,331 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu___2), "=r" (__val_gu___2): "0" (p), "i" (4UL)); [6357-6358] [2025-03-08 19:12:02,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:12:02,424 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:12:02,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:02 WrapperNode [2025-03-08 19:12:02,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:12:02,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:12:02,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:12:02,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:12:02,430 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:12:02" (1/1) ... [2025-03-08 19:12:02,475 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:12:02" (1/1) ... [2025-03-08 19:12:02,592 INFO L138 Inliner]: procedures = 180, calls = 596, calls flagged for inlining = 99, calls inlined = 93, statements flattened = 2725 [2025-03-08 19:12:02,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:12:02,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:12:02,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:12:02,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:12:02,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:02" (1/1) ... [2025-03-08 19:12:02,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:02" (1/1) ... [2025-03-08 19:12:02,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:02" (1/1) ... [2025-03-08 19:12:02,812 INFO L175 MemorySlicer]: Split 317 memory accesses to 7 slices as follows [2, 229, 1, 13, 20, 28, 24]. 72 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 6, 0, 0, 15, 0, 0]. The 152 writes are split as follows [0, 100, 0, 13, 2, 13, 24]. [2025-03-08 19:12:02,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:02" (1/1) ... [2025-03-08 19:12:02,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:02" (1/1) ... [2025-03-08 19:12:02,878 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:02" (1/1) ... [2025-03-08 19:12:02,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:02" (1/1) ... [2025-03-08 19:12:02,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:02" (1/1) ... [2025-03-08 19:12:02,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:02" (1/1) ... [2025-03-08 19:12:02,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:12:02,926 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:12:02,926 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:12:02,926 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:12:02,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:02" (1/1) ... [2025-03-08 19:12:02,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:12:02,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:12:02,953 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:12:02,956 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:12:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-08 19:12:02,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-08 19:12:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:12:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:12:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:12:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:12:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:12:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:12:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:12:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_push [2025-03-08 19:12:02,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_push [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2025-03-08 19:12:02,980 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 19:12:02,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:12:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt_byte [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt_byte [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure ap_put [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_put [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_hangup [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_hangup [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:12:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:12:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:12:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 19:12:02,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 19:12:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-08 19:12:02,982 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-08 19:12:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 19:12:02,982 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 19:12:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_close [2025-03-08 19:12:02,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_close [2025-03-08 19:12:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:12:02,984 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_poll [2025-03-08 19:12:02,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_poll [2025-03-08 19:12:02,984 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2025-03-08 19:12:02,984 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2025-03-08 19:12:02,984 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-08 19:12:02,984 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-08 19:12:02,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:12:02,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:12:02,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:12:02,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-03-08 19:12:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure ap_get [2025-03-08 19:12:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_get [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2025-03-08 19:12:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2025-03-08 19:12:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2025-03-08 19:12:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-08 19:12:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 19:12:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-08 19:12:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure async_lcp_peek [2025-03-08 19:12:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure async_lcp_peek [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:12:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-03-08 19:12:02,986 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-03-08 19:12:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-08 19:12:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-08 19:12:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-08 19:12:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-08 19:12:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-08 19:12:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-08 19:12:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-08 19:12:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-08 19:12:02,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-08 19:12:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-08 19:12:02,986 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-08 19:12:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:12:02,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:12:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_ioctl [2025-03-08 19:12:02,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_ioctl [2025-03-08 19:12:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-03-08 19:12:02,986 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-03-08 19:12:03,377 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:12:03,379 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:12:03,792 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 19:12:03,823 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5759: havoc #t~bitwise124;havoc #t~mem125;havoc #t~bitwise126; [2025-03-08 19:12:03,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5314: havoc #t~mem1;havoc #t~bitwise2; [2025-03-08 19:12:03,895 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5327: havoc __fswab16_#t~bitwise3#1; [2025-03-08 19:12:04,119 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7647: havoc #t~nondet424; [2025-03-08 19:12:04,145 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7719: havoc #t~nondet430; [2025-03-08 19:12:04,234 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7643: havoc #t~nondet423; [2025-03-08 19:12:12,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5586: havoc skb_tailroom_#t~ite71#1;havoc skb_tailroom_#t~mem69#1;havoc skb_tailroom_#t~mem70#1; [2025-03-08 19:12:12,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7767: havoc tty_unregister_ldisc_#t~nondet439#1; [2025-03-08 19:12:12,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5455: havoc __kmalloc_#t~ret35#1.base, __kmalloc_#t~ret35#1.offset; [2025-03-08 19:12:12,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5556: call ULTIMATE.dealloc(skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset);havoc skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset; [2025-03-08 19:12:12,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7708: havoc ppp_register_channel_#t~nondet428#1; [2025-03-08 19:12:12,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830: call ULTIMATE.dealloc(ppp_asynctty_open_~#__key~2#1.base, ppp_asynctty_open_~#__key~2#1.offset);havoc ppp_asynctty_open_~#__key~2#1.base, ppp_asynctty_open_~#__key~2#1.offset;call ULTIMATE.dealloc(ppp_asynctty_open_~#__key___0~0#1.base, ppp_asynctty_open_~#__key___0~0#1.offset);havoc ppp_asynctty_open_~#__key___0~0#1.base, ppp_asynctty_open_~#__key___0~0#1.offset; [2025-03-08 19:12:12,960 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5700: call ULTIMATE.dealloc(sema_init_~#__key~1#1.base, sema_init_~#__key~1#1.offset);havoc sema_init_~#__key~1#1.base, sema_init_~#__key~1#1.offset;call ULTIMATE.dealloc(sema_init_~#__constr_expr_0~0#1.base, sema_init_~#__constr_expr_0~0#1.offset);havoc sema_init_~#__constr_expr_0~0#1.base, sema_init_~#__constr_expr_0~0#1.offset; [2025-03-08 19:12:12,960 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5569: havoc skb_is_nonlinear_#t~mem59#1; [2025-03-08 19:12:12,960 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5540: havoc skb_queue_empty_#t~mem55#1.base, skb_queue_empty_#t~mem55#1.offset; [2025-03-08 19:12:12,960 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7722: havoc skb_pull_#t~ret431#1.base, skb_pull_#t~ret431#1.offset; [2025-03-08 19:12:12,960 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5578: havoc skb_headroom_#t~mem66#1.base, skb_headroom_#t~mem66#1.offset;havoc skb_headroom_#t~mem67#1.base, skb_headroom_#t~mem67#1.offset; [2025-03-08 19:12:12,960 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7725: havoc skb_push_#t~ret432#1.base, skb_push_#t~ret432#1.offset; [2025-03-08 19:12:12,960 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7759: havoc tty_register_ldisc_#t~nondet437#1; [2025-03-08 19:12:12,960 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6143: call ULTIMATE.dealloc(ppp_async_ioctl_~#accm~0#1.base, ppp_async_ioctl_~#accm~0#1.offset);havoc ppp_async_ioctl_~#accm~0#1.base, ppp_async_ioctl_~#accm~0#1.offset; [2025-03-08 19:12:12,960 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7663: havoc _raw_spin_lock_irqsave_#t~nondet425#1; [2025-03-08 19:12:12,960 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7763: havoc tty_termios_baud_rate_#t~nondet438#1; [2025-03-08 19:12:13,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7695: havoc ppp_channel_index_#t~nondet427#1; [2025-03-08 19:12:13,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7691: havoc n_tty_ioctl_helper_#t~nondet426#1; [2025-03-08 19:12:13,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7712: havoc ppp_unit_number_#t~nondet429#1; [2025-03-08 19:12:13,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7755: havoc tty_mode_ioctl_#t~nondet436#1; [2025-03-08 19:12:13,484 INFO L? ?]: Removed 1325 outVars from TransFormulas that were not future-live. [2025-03-08 19:12:13,485 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:12:13,523 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:12:13,523 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 19:12:13,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:12:13 BoogieIcfgContainer [2025-03-08 19:12:13,524 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:12:13,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:12:13,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:12:13,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:12:13,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:12:01" (1/3) ... [2025-03-08 19:12:13,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6127be7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:12:13, skipping insertion in model container [2025-03-08 19:12:13,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:02" (2/3) ... [2025-03-08 19:12:13,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6127be7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:12:13, skipping insertion in model container [2025-03-08 19:12:13,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:12:13" (3/3) ... [2025-03-08 19:12:13,531 INFO L128 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2025-03-08 19:12:13,542 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:12:13,543 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i that has 45 procedures, 891 locations, 1 initial locations, 17 loop locations, and 1 error locations. [2025-03-08 19:12:13,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:12:13,608 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;@507e49b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:12:13,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:12:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 860 states, 702 states have (on average 1.4544159544159545) internal successors, (1021), 716 states have internal predecessors, (1021), 119 states have call successors, (119), 38 states have call predecessors, (119), 37 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-08 19:12:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 19:12:13,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:13,623 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:13,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:13,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:13,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1158550744, now seen corresponding path program 1 times [2025-03-08 19:12:13,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:13,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770584593] [2025-03-08 19:12:13,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:13,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:13,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 19:12:13,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 19:12:13,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:13,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 19:12:14,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:14,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770584593] [2025-03-08 19:12:14,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770584593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:14,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:14,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:14,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171633159] [2025-03-08 19:12:14,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:14,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:14,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:14,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:14,391 INFO L87 Difference]: Start difference. First operand has 860 states, 702 states have (on average 1.4544159544159545) internal successors, (1021), 716 states have internal predecessors, (1021), 119 states have call successors, (119), 38 states have call predecessors, (119), 37 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 19:12:18,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:18,682 INFO L93 Difference]: Finished difference Result 2521 states and 3743 transitions. [2025-03-08 19:12:18,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:18,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78 [2025-03-08 19:12:18,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:18,710 INFO L225 Difference]: With dead ends: 2521 [2025-03-08 19:12:18,710 INFO L226 Difference]: Without dead ends: 1650 [2025-03-08 19:12:18,721 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:12:18,723 INFO L435 NwaCegarLoop]: 1212 mSDtfsCounter, 1173 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:18,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 2396 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 19:12:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2025-03-08 19:12:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1650. [2025-03-08 19:12:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1362 states have (on average 1.4390602055800295) internal successors, (1960), 1378 states have internal predecessors, (1960), 215 states have call successors, (215), 73 states have call predecessors, (215), 72 states have return successors, (214), 214 states have call predecessors, (214), 214 states have call successors, (214) [2025-03-08 19:12:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2389 transitions. [2025-03-08 19:12:18,855 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2389 transitions. Word has length 78 [2025-03-08 19:12:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:18,856 INFO L471 AbstractCegarLoop]: Abstraction has 1650 states and 2389 transitions. [2025-03-08 19:12:18,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 19:12:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2389 transitions. [2025-03-08 19:12:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 19:12:18,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:18,862 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:18,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:12:18,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:18,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:18,864 INFO L85 PathProgramCache]: Analyzing trace with hash 586309102, now seen corresponding path program 1 times [2025-03-08 19:12:18,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:18,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651297711] [2025-03-08 19:12:18,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:18,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:18,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 19:12:19,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 19:12:19,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:19,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 19:12:19,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:19,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651297711] [2025-03-08 19:12:19,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651297711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:19,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:19,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:12:19,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257997301] [2025-03-08 19:12:19,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:19,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:12:19,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:19,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:12:19,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:12:19,308 INFO L87 Difference]: Start difference. First operand 1650 states and 2389 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 19:12:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:19,690 INFO L93 Difference]: Finished difference Result 4899 states and 7129 transitions. [2025-03-08 19:12:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:12:19,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2025-03-08 19:12:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:19,706 INFO L225 Difference]: With dead ends: 4899 [2025-03-08 19:12:19,706 INFO L226 Difference]: Without dead ends: 3265 [2025-03-08 19:12:19,710 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:12:19,711 INFO L435 NwaCegarLoop]: 1197 mSDtfsCounter, 1205 mSDsluCounter, 3548 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 4745 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:19,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 4745 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:12:19,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2025-03-08 19:12:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3261. [2025-03-08 19:12:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3261 states, 2698 states have (on average 1.4403261675315049) internal successors, (3886), 2730 states have internal predecessors, (3886), 418 states have call successors, (418), 145 states have call predecessors, (418), 144 states have return successors, (447), 417 states have call predecessors, (447), 417 states have call successors, (447) [2025-03-08 19:12:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3261 states to 3261 states and 4751 transitions. [2025-03-08 19:12:19,821 INFO L78 Accepts]: Start accepts. Automaton has 3261 states and 4751 transitions. Word has length 82 [2025-03-08 19:12:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:19,822 INFO L471 AbstractCegarLoop]: Abstraction has 3261 states and 4751 transitions. [2025-03-08 19:12:19,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 19:12:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3261 states and 4751 transitions. [2025-03-08 19:12:19,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 19:12:19,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:19,834 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-08 19:12:19,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:12:19,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:19,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:19,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1694724329, now seen corresponding path program 1 times [2025-03-08 19:12:19,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:19,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357466692] [2025-03-08 19:12:19,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:19,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:19,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 19:12:19,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 19:12:19,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:19,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-08 19:12:20,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:20,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357466692] [2025-03-08 19:12:20,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357466692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:20,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:20,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:20,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435951821] [2025-03-08 19:12:20,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:20,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:20,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:20,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:20,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:20,063 INFO L87 Difference]: Start difference. First operand 3261 states and 4751 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 19:12:20,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:20,335 INFO L93 Difference]: Finished difference Result 8130 states and 11848 transitions. [2025-03-08 19:12:20,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:20,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 137 [2025-03-08 19:12:20,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:20,363 INFO L225 Difference]: With dead ends: 8130 [2025-03-08 19:12:20,363 INFO L226 Difference]: Without dead ends: 4893 [2025-03-08 19:12:20,373 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:12:20,374 INFO L435 NwaCegarLoop]: 1200 mSDtfsCounter, 647 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:20,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 2318 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:12:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2025-03-08 19:12:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4881. [2025-03-08 19:12:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4881 states, 4056 states have (on average 1.4464990138067062) internal successors, (5867), 4099 states have internal predecessors, (5867), 605 states have call successors, (605), 220 states have call predecessors, (605), 219 states have return successors, (644), 601 states have call predecessors, (644), 604 states have call successors, (644) [2025-03-08 19:12:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 7116 transitions. [2025-03-08 19:12:20,567 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 7116 transitions. Word has length 137 [2025-03-08 19:12:20,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:20,568 INFO L471 AbstractCegarLoop]: Abstraction has 4881 states and 7116 transitions. [2025-03-08 19:12:20,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 19:12:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 7116 transitions. [2025-03-08 19:12:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 19:12:20,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:20,581 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-08 19:12:20,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:12:20,582 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:20,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:20,582 INFO L85 PathProgramCache]: Analyzing trace with hash -643625220, now seen corresponding path program 1 times [2025-03-08 19:12:20,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:20,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687063115] [2025-03-08 19:12:20,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:20,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:20,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 19:12:20,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 19:12:20,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:20,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2025-03-08 19:12:20,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:20,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687063115] [2025-03-08 19:12:20,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687063115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:20,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:20,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:20,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398377735] [2025-03-08 19:12:20,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:20,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:20,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:20,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:20,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:20,856 INFO L87 Difference]: Start difference. First operand 4881 states and 7116 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 19:12:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:21,158 INFO L93 Difference]: Finished difference Result 11948 states and 17306 transitions. [2025-03-08 19:12:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:21,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 167 [2025-03-08 19:12:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:21,191 INFO L225 Difference]: With dead ends: 11948 [2025-03-08 19:12:21,191 INFO L226 Difference]: Without dead ends: 7091 [2025-03-08 19:12:21,203 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:12:21,204 INFO L435 NwaCegarLoop]: 1785 mSDtfsCounter, 783 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:21,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 2933 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:12:21,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7091 states. [2025-03-08 19:12:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7091 to 7077. [2025-03-08 19:12:21,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7077 states, 5882 states have (on average 1.4360761645698743) internal successors, (8447), 5950 states have internal predecessors, (8447), 847 states have call successors, (847), 348 states have call predecessors, (847), 347 states have return successors, (908), 842 states have call predecessors, (908), 846 states have call successors, (908) [2025-03-08 19:12:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7077 states to 7077 states and 10202 transitions. [2025-03-08 19:12:21,422 INFO L78 Accepts]: Start accepts. Automaton has 7077 states and 10202 transitions. Word has length 167 [2025-03-08 19:12:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:21,423 INFO L471 AbstractCegarLoop]: Abstraction has 7077 states and 10202 transitions. [2025-03-08 19:12:21,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 19:12:21,424 INFO L276 IsEmpty]: Start isEmpty. Operand 7077 states and 10202 transitions. [2025-03-08 19:12:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 19:12:21,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:21,435 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:21,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:12:21,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:21,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:21,436 INFO L85 PathProgramCache]: Analyzing trace with hash -575862863, now seen corresponding path program 1 times [2025-03-08 19:12:21,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:21,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993649797] [2025-03-08 19:12:21,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:21,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 19:12:21,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 19:12:21,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:21,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-03-08 19:12:21,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:21,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993649797] [2025-03-08 19:12:21,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993649797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:21,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:21,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:21,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11861123] [2025-03-08 19:12:21,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:21,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:21,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:21,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:21,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:21,681 INFO L87 Difference]: Start difference. First operand 7077 states and 10202 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 19:12:25,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:26,066 INFO L93 Difference]: Finished difference Result 17087 states and 24588 transitions. [2025-03-08 19:12:26,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:26,067 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), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2025-03-08 19:12:26,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:26,124 INFO L225 Difference]: With dead ends: 17087 [2025-03-08 19:12:26,124 INFO L226 Difference]: Without dead ends: 10045 [2025-03-08 19:12:26,148 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:12:26,149 INFO L435 NwaCegarLoop]: 1237 mSDtfsCounter, 853 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:26,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 2328 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 117 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 19:12:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10045 states. [2025-03-08 19:12:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10045 to 10021. [2025-03-08 19:12:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10021 states, 8304 states have (on average 1.4285886319845857) internal successors, (11863), 8398 states have internal predecessors, (11863), 1175 states have call successors, (1175), 542 states have call predecessors, (1175), 541 states have return successors, (1264), 1168 states have call predecessors, (1264), 1174 states have call successors, (1264) [2025-03-08 19:12:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10021 states to 10021 states and 14302 transitions. [2025-03-08 19:12:26,530 INFO L78 Accepts]: Start accepts. Automaton has 10021 states and 14302 transitions. Word has length 160 [2025-03-08 19:12:26,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:26,532 INFO L471 AbstractCegarLoop]: Abstraction has 10021 states and 14302 transitions. [2025-03-08 19:12:26,532 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), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 19:12:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 10021 states and 14302 transitions. [2025-03-08 19:12:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 19:12:26,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:26,550 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:26,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:12:26,551 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:26,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:26,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1709090539, now seen corresponding path program 1 times [2025-03-08 19:12:26,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:26,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723496530] [2025-03-08 19:12:26,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:26,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:26,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 19:12:26,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 19:12:26,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:26,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 19:12:26,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:26,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723496530] [2025-03-08 19:12:26,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723496530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:26,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:26,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:26,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165749608] [2025-03-08 19:12:26,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:26,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:26,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:26,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:26,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:26,790 INFO L87 Difference]: Start difference. First operand 10021 states and 14302 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 19:12:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:27,097 INFO L93 Difference]: Finished difference Result 15054 states and 21633 transitions. [2025-03-08 19:12:27,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:27,104 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2025-03-08 19:12:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:27,188 INFO L225 Difference]: With dead ends: 15054 [2025-03-08 19:12:27,189 INFO L226 Difference]: Without dead ends: 10041 [2025-03-08 19:12:27,212 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:12:27,213 INFO L435 NwaCegarLoop]: 1190 mSDtfsCounter, 2 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:27,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2374 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:12:27,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10041 states. [2025-03-08 19:12:27,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10041 to 10041. [2025-03-08 19:12:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10041 states, 8324 states have (on average 1.4275588659298415) internal successors, (11883), 8418 states have internal predecessors, (11883), 1175 states have call successors, (1175), 542 states have call predecessors, (1175), 541 states have return successors, (1264), 1168 states have call predecessors, (1264), 1174 states have call successors, (1264) [2025-03-08 19:12:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10041 states to 10041 states and 14322 transitions. [2025-03-08 19:12:27,487 INFO L78 Accepts]: Start accepts. Automaton has 10041 states and 14322 transitions. Word has length 165 [2025-03-08 19:12:27,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:27,487 INFO L471 AbstractCegarLoop]: Abstraction has 10041 states and 14322 transitions. [2025-03-08 19:12:27,487 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 19:12:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 10041 states and 14322 transitions. [2025-03-08 19:12:27,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 19:12:27,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:27,545 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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] [2025-03-08 19:12:27,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 19:12:27,546 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:27,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:27,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1689543686, now seen corresponding path program 1 times [2025-03-08 19:12:27,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:27,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903809627] [2025-03-08 19:12:27,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:27,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:27,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 19:12:27,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 19:12:27,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:27,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-03-08 19:12:28,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:28,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903809627] [2025-03-08 19:12:28,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903809627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:12:28,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612419372] [2025-03-08 19:12:28,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:28,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:12:28,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:12:28,229 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:12:28,230 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:12:28,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 19:12:28,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 19:12:28,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:28,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:28,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 19:12:28,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:12:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 88 proven. 5 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-08 19:12:28,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:12:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 19:12:29,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612419372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:12:29,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:12:29,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2025-03-08 19:12:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777468349] [2025-03-08 19:12:29,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:12:29,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 19:12:29,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:29,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 19:12:29,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-08 19:12:29,920 INFO L87 Difference]: Start difference. First operand 10041 states and 14322 transitions. Second operand has 15 states, 15 states have (on average 11.333333333333334) internal successors, (170), 14 states have internal predecessors, (170), 9 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 9 states have call predecessors, (38), 8 states have call successors, (38) [2025-03-08 19:12:33,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:37,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:41,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:45,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:49,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:53,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:57,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:13:02,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:13:02,071 INFO L93 Difference]: Finished difference Result 28284 states and 40804 transitions. [2025-03-08 19:13:02,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 19:13:02,073 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.333333333333334) internal successors, (170), 14 states have internal predecessors, (170), 9 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 9 states have call predecessors, (38), 8 states have call successors, (38) Word has length 166 [2025-03-08 19:13:02,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:13:02,138 INFO L225 Difference]: With dead ends: 28284 [2025-03-08 19:13:02,138 INFO L226 Difference]: Without dead ends: 18278 [2025-03-08 19:13:02,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 333 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2025-03-08 19:13:02,169 INFO L435 NwaCegarLoop]: 1288 mSDtfsCounter, 6039 mSDsluCounter, 6847 mSDsCounter, 0 mSdLazyCounter, 3851 mSolverCounterSat, 1092 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6183 SdHoareTripleChecker+Valid, 8135 SdHoareTripleChecker+Invalid, 4950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1092 IncrementalHoareTripleChecker+Valid, 3851 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.5s IncrementalHoareTripleChecker+Time [2025-03-08 19:13:02,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6183 Valid, 8135 Invalid, 4950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1092 Valid, 3851 Invalid, 7 Unknown, 0 Unchecked, 31.5s Time] [2025-03-08 19:13:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18278 states. [2025-03-08 19:13:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18278 to 17952. [2025-03-08 19:13:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17952 states, 14902 states have (on average 1.4296067641927257) internal successors, (21304), 15102 states have internal predecessors, (21304), 2111 states have call successors, (2111), 913 states have call predecessors, (2111), 938 states have return successors, (2340), 2094 states have call predecessors, (2340), 2110 states have call successors, (2340) [2025-03-08 19:13:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17952 states to 17952 states and 25755 transitions. [2025-03-08 19:13:02,741 INFO L78 Accepts]: Start accepts. Automaton has 17952 states and 25755 transitions. Word has length 166 [2025-03-08 19:13:02,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:13:02,741 INFO L471 AbstractCegarLoop]: Abstraction has 17952 states and 25755 transitions. [2025-03-08 19:13:02,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.333333333333334) internal successors, (170), 14 states have internal predecessors, (170), 9 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 9 states have call predecessors, (38), 8 states have call successors, (38) [2025-03-08 19:13:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 17952 states and 25755 transitions. [2025-03-08 19:13:02,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 19:13:02,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:13:02,763 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:02,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 19:13:02,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:13:02,967 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:13:02,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:13:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash -737715960, now seen corresponding path program 1 times [2025-03-08 19:13:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:13:02,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666265808] [2025-03-08 19:13:02,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:13:03,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 19:13:03,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 19:13:03,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:03,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-03-08 19:13:03,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:13:03,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666265808] [2025-03-08 19:13:03,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666265808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:13:03,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:13:03,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:13:03,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692802133] [2025-03-08 19:13:03,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:13:03,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:13:03,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:13:03,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:13:03,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:13:03,311 INFO L87 Difference]: Start difference. First operand 17952 states and 25755 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 19:13:07,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:13:07,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:13:07,970 INFO L93 Difference]: Finished difference Result 41931 states and 59924 transitions. [2025-03-08 19:13:07,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:13:07,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 201 [2025-03-08 19:13:07,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:13:08,132 INFO L225 Difference]: With dead ends: 41931 [2025-03-08 19:13:08,132 INFO L226 Difference]: Without dead ends: 24014 [2025-03-08 19:13:08,158 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:13:08,158 INFO L435 NwaCegarLoop]: 2034 mSDtfsCounter, 868 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 5247 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:13:08,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 5247 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 19:13:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24014 states. [2025-03-08 19:13:08,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24014 to 17976. [2025-03-08 19:13:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17976 states, 14926 states have (on average 1.4289159855286078) internal successors, (21328), 15126 states have internal predecessors, (21328), 2111 states have call successors, (2111), 913 states have call predecessors, (2111), 938 states have return successors, (2340), 2094 states have call predecessors, (2340), 2110 states have call successors, (2340) [2025-03-08 19:13:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17976 states to 17976 states and 25779 transitions. [2025-03-08 19:13:08,730 INFO L78 Accepts]: Start accepts. Automaton has 17976 states and 25779 transitions. Word has length 201 [2025-03-08 19:13:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:13:08,731 INFO L471 AbstractCegarLoop]: Abstraction has 17976 states and 25779 transitions. [2025-03-08 19:13:08,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 19:13:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 17976 states and 25779 transitions. [2025-03-08 19:13:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 19:13:08,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:13:08,745 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:08,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 19:13:08,745 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:13:08,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:13:08,746 INFO L85 PathProgramCache]: Analyzing trace with hash -632748343, now seen corresponding path program 1 times [2025-03-08 19:13:08,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:13:08,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715271748] [2025-03-08 19:13:08,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:08,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:13:08,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 19:13:08,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 19:13:08,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:08,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-03-08 19:13:09,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:13:09,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715271748] [2025-03-08 19:13:09,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715271748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:13:09,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:13:09,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:13:09,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372359152] [2025-03-08 19:13:09,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:13:09,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:13:09,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:13:09,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:13:09,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:13:09,183 INFO L87 Difference]: Start difference. First operand 17976 states and 25779 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 19:13:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:13:09,632 INFO L93 Difference]: Finished difference Result 35979 states and 51626 transitions. [2025-03-08 19:13:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:13:09,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 214 [2025-03-08 19:13:09,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:13:09,710 INFO L225 Difference]: With dead ends: 35979 [2025-03-08 19:13:09,711 INFO L226 Difference]: Without dead ends: 18038 [2025-03-08 19:13:09,753 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:13:09,754 INFO L435 NwaCegarLoop]: 1189 mSDtfsCounter, 0 mSDsluCounter, 3562 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4751 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:13:09,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4751 Invalid, 160 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:13:09,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18038 states. [2025-03-08 19:13:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18038 to 18024. [2025-03-08 19:13:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18024 states, 14962 states have (on average 1.4278839727309183) internal successors, (21364), 15162 states have internal predecessors, (21364), 2111 states have call successors, (2111), 913 states have call predecessors, (2111), 950 states have return successors, (2355), 2106 states have call predecessors, (2355), 2110 states have call successors, (2355) [2025-03-08 19:13:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18024 states to 18024 states and 25830 transitions. [2025-03-08 19:13:10,541 INFO L78 Accepts]: Start accepts. Automaton has 18024 states and 25830 transitions. Word has length 214 [2025-03-08 19:13:10,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:13:10,541 INFO L471 AbstractCegarLoop]: Abstraction has 18024 states and 25830 transitions. [2025-03-08 19:13:10,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 19:13:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 18024 states and 25830 transitions. [2025-03-08 19:13:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-08 19:13:10,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:13:10,557 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:10,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 19:13:10,558 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:13:10,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:13:10,558 INFO L85 PathProgramCache]: Analyzing trace with hash -998397921, now seen corresponding path program 1 times [2025-03-08 19:13:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:13:10,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896056286] [2025-03-08 19:13:10,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:10,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:13:10,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 19:13:10,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 19:13:10,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:10,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-03-08 19:13:11,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:13:11,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896056286] [2025-03-08 19:13:11,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896056286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:13:11,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398237327] [2025-03-08 19:13:11,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:11,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:13:11,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:13:11,062 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:13:11,064 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:13:11,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 19:13:11,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 19:13:11,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:11,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:11,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 19:13:11,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:13:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-03-08 19:13:11,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:13:11,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398237327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:13:11,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:13:11,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-08 19:13:11,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501606875] [2025-03-08 19:13:11,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:13:11,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:13:11,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:13:11,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:13:11,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:13:11,764 INFO L87 Difference]: Start difference. First operand 18024 states and 25830 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-08 19:13:15,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:13:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:13:16,468 INFO L93 Difference]: Finished difference Result 42111 states and 60110 transitions. [2025-03-08 19:13:16,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 19:13:16,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 221 [2025-03-08 19:13:16,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:13:16,550 INFO L225 Difference]: With dead ends: 42111 [2025-03-08 19:13:16,550 INFO L226 Difference]: Without dead ends: 24122 [2025-03-08 19:13:16,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 19:13:16,582 INFO L435 NwaCegarLoop]: 2025 mSDtfsCounter, 879 mSDsluCounter, 5167 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 7192 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:13:16,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 7192 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 258 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 19:13:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24122 states. [2025-03-08 19:13:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24122 to 18036. [2025-03-08 19:13:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18036 states, 14974 states have (on average 1.4275410711900627) internal successors, (21376), 15162 states have internal predecessors, (21376), 2111 states have call successors, (2111), 913 states have call predecessors, (2111), 950 states have return successors, (2355), 2106 states have call predecessors, (2355), 2110 states have call successors, (2355) [2025-03-08 19:13:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18036 states to 18036 states and 25842 transitions. [2025-03-08 19:13:17,135 INFO L78 Accepts]: Start accepts. Automaton has 18036 states and 25842 transitions. Word has length 221 [2025-03-08 19:13:17,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:13:17,136 INFO L471 AbstractCegarLoop]: Abstraction has 18036 states and 25842 transitions. [2025-03-08 19:13:17,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-08 19:13:17,136 INFO L276 IsEmpty]: Start isEmpty. Operand 18036 states and 25842 transitions. [2025-03-08 19:13:17,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-08 19:13:17,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:13:17,150 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:17,160 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:13:17,350 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,SelfDestructingSolverStorable9 [2025-03-08 19:13:17,351 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:13:17,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:13:17,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1978675755, now seen corresponding path program 1 times [2025-03-08 19:13:17,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:13:17,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929102077] [2025-03-08 19:13:17,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:17,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:13:17,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-08 19:13:17,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-08 19:13:17,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:17,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-08 19:13:17,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:13:17,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929102077] [2025-03-08 19:13:17,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929102077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:13:17,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087154464] [2025-03-08 19:13:17,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:17,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:13:17,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:13:17,818 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:13:17,820 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:13:18,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-08 19:13:18,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-08 19:13:18,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:18,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:18,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 2367 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:13:18,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:13:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-03-08 19:13:18,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:13:18,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087154464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:13:18,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:13:18,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-08 19:13:18,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429141164] [2025-03-08 19:13:18,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:13:18,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:13:18,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:13:18,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:13:18,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:13:18,932 INFO L87 Difference]: Start difference. First operand 18036 states and 25842 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 4 states have call successors, (28), 4 states have call predecessors, (28), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-08 19:13:22,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:13:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:13:23,718 INFO L93 Difference]: Finished difference Result 24166 states and 34372 transitions. [2025-03-08 19:13:23,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:13:23,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 4 states have call successors, (28), 4 states have call predecessors, (28), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 259 [2025-03-08 19:13:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:13:23,806 INFO L225 Difference]: With dead ends: 24166 [2025-03-08 19:13:23,807 INFO L226 Difference]: Without dead ends: 24128 [2025-03-08 19:13:23,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 259 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:13:23,820 INFO L435 NwaCegarLoop]: 2013 mSDtfsCounter, 2157 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2157 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:13:23,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2157 Valid, 2714 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 268 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 19:13:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24128 states. [2025-03-08 19:13:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24128 to 22422. [2025-03-08 19:13:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22422 states, 18558 states have (on average 1.4198728311240436) internal successors, (26350), 18786 states have internal predecessors, (26350), 2657 states have call successors, (2657), 1159 states have call predecessors, (2657), 1206 states have return successors, (2989), 2656 states have call predecessors, (2989), 2656 states have call successors, (2989) [2025-03-08 19:13:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22422 states to 22422 states and 31996 transitions. [2025-03-08 19:13:24,766 INFO L78 Accepts]: Start accepts. Automaton has 22422 states and 31996 transitions. Word has length 259 [2025-03-08 19:13:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:13:24,767 INFO L471 AbstractCegarLoop]: Abstraction has 22422 states and 31996 transitions. [2025-03-08 19:13:24,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 4 states have call successors, (28), 4 states have call predecessors, (28), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-08 19:13:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 22422 states and 31996 transitions. [2025-03-08 19:13:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-08 19:13:24,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:13:24,785 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:24,797 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:13:24,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:13:24,989 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:13:24,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:13:24,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1781194213, now seen corresponding path program 1 times [2025-03-08 19:13:24,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:13:24,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629017748] [2025-03-08 19:13:24,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:24,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:13:25,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-08 19:13:25,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-08 19:13:25,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:25,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-08 19:13:25,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:13:25,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629017748] [2025-03-08 19:13:25,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629017748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:13:25,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:13:25,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:13:25,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201978166] [2025-03-08 19:13:25,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:13:25,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:13:25,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:13:25,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:13:25,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:13:25,564 INFO L87 Difference]: Start difference. First operand 22422 states and 31996 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 3 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27)