./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 798a7b37 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-?-798a7b3-m [2025-03-04 04:00:30,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:00:30,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:00:30,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:00:30,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:00:30,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:00:30,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:00:30,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:00:30,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:00:30,458 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:00:30,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:00:30,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:00:30,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:00:30,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:00:30,459 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:00:30,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:00:30,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:00:30,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:00:30,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:00:30,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:00:30,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:00:30,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:00:30,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:00:30,460 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:00:30,460 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:00:30,460 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:00:30,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:00:30,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:00:30,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:00:30,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:00:30,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:00:30,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:00:30,461 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:00:30,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:00:30,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:00:30,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:00:30,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:00:30,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:00:30,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:00:30,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:00:30,462 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-04 04:00:30,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:00:30,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:00:30,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:00:30,698 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:00:30,698 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:00:30,699 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-04 04:00:31,862 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94febb68/2bed771b1474416bbea0b5a4073bb8a3/FLAG79b02ffdd [2025-03-04 04:00:32,359 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:00:32,360 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-04 04:00:32,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94febb68/2bed771b1474416bbea0b5a4073bb8a3/FLAG79b02ffdd [2025-03-04 04:00:32,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94febb68/2bed771b1474416bbea0b5a4073bb8a3 [2025-03-04 04:00:32,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:00:32,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:00:32,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:00:32,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:00:32,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:00:32,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:00:32" (1/1) ... [2025-03-04 04:00:32,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c21d36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:32, skipping insertion in model container [2025-03-04 04:00:32,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:00:32" (1/1) ... [2025-03-04 04:00:32,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:00:33,183 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-04 04:00:33,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:00:33,549 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:00:33,641 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-04 04:00:33,643 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-04 04:00:33,643 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-04 04:00:33,644 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-04 04:00:33,645 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [5320] [2025-03-04 04:00:33,647 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-04 04:00:33,649 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-04 04:00:33,661 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-04 04:00:33,679 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-04 04:00:33,679 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-04 04:00:33,679 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-04 04:00:33,680 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-04 04:00:33,680 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-04 04:00:33,680 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-04 04:00:33,680 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-04 04:00:33,680 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-04 04:00:33,681 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-04 04:00:33,681 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-04 04:00:33,681 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-04 04:00:33,681 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-04 04:00:33,681 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-04 04:00:33,681 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-04 04:00:33,681 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-04 04:00:33,687 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-04 04:00:33,688 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-04 04:00:33,688 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-04 04:00:33,688 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-04 04:00:33,688 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-04 04:00:33,690 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-04 04:00:33,690 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-04 04:00:33,693 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-04 04:00:33,693 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-04 04:00:33,694 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-04 04:00:33,694 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-04 04:00:33,694 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-04 04:00:33,695 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-04 04:00:33,695 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-04 04:00:33,695 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-04 04:00:33,695 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-04 04:00:33,695 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-04 04:00:33,696 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-04 04:00:33,697 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-04 04:00:33,697 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-04 04:00:33,697 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-04 04:00:33,697 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-04 04:00:33,697 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-04 04:00:33,697 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-04 04:00:33,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:00:33,842 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:00:33,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:33 WrapperNode [2025-03-04 04:00:33,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:00:33,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:00:33,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:00:33,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:00:33,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:33" (1/1) ... [2025-03-04 04:00:33,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:33" (1/1) ... [2025-03-04 04:00:33,978 INFO L138 Inliner]: procedures = 180, calls = 596, calls flagged for inlining = 99, calls inlined = 93, statements flattened = 2725 [2025-03-04 04:00:33,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:00:33,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:00:33,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:00:33,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:00:33,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:33" (1/1) ... [2025-03-04 04:00:33,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:33" (1/1) ... [2025-03-04 04:00:34,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:33" (1/1) ... [2025-03-04 04:00:34,208 INFO L175 MemorySlicer]: Split 317 memory accesses to 7 slices as follows [2, 28, 229, 20, 13, 24, 1]. 72 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 0, 6, 15, 0, 0, 0]. The 152 writes are split as follows [0, 13, 100, 2, 13, 24, 0]. [2025-03-04 04:00:34,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:33" (1/1) ... [2025-03-04 04:00:34,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:33" (1/1) ... [2025-03-04 04:00:34,276 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:33" (1/1) ... [2025-03-04 04:00:34,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:33" (1/1) ... [2025-03-04 04:00:34,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:33" (1/1) ... [2025-03-04 04:00:34,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:33" (1/1) ... [2025-03-04 04:00:34,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:00:34,356 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:00:34,356 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:00:34,356 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:00:34,357 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:33" (1/1) ... [2025-03-04 04:00:34,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:00:34,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:00:34,385 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-04 04:00:34,390 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-04 04:00:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-04 04:00:34,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-04 04:00:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:00:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:00:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:00:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:00:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:00:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:00:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:00:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_push [2025-03-04 04:00:34,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_push [2025-03-04 04:00:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2025-03-04 04:00:34,409 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2025-03-04 04:00:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 04:00:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 04:00:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 04:00:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 04:00:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 04:00:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 04:00:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 04:00:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:00:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:00:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:00:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:00:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:00:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:00:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:00:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:00:34,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:00:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:00:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:00:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:00:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:00:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:00:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:00:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:00:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt_byte [2025-03-04 04:00:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt_byte [2025-03-04 04:00:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure ap_put [2025-03-04 04:00:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_put [2025-03-04 04:00:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2025-03-04 04:00:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2025-03-04 04:00:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-04 04:00:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-04 04:00:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-04 04:00:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-04 04:00:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-04 04:00:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-04 04:00:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-04 04:00:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-04 04:00:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-04 04:00:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-04 04:00:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-04 04:00:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-04 04:00:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_hangup [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_hangup [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_close [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_close [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_poll [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_poll [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-04 04:00:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:00:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:00:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:00:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-03-04 04:00:34,414 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-03-04 04:00:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure ap_get [2025-03-04 04:00:34,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_get [2025-03-04 04:00:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2025-03-04 04:00:34,415 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2025-03-04 04:00:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:00:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:00:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:00:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:00:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2025-03-04 04:00:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2025-03-04 04:00:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-04 04:00:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 04:00:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-04 04:00:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure async_lcp_peek [2025-03-04 04:00:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure async_lcp_peek [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-03-04 04:00:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 04:00:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-04 04:00:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:00:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_ioctl [2025-03-04 04:00:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_ioctl [2025-03-04 04:00:34,416 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-03-04 04:00:34,416 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-03-04 04:00:34,805 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:00:34,808 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:00:35,240 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:00:35,277 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5759: havoc #t~bitwise124;havoc #t~mem125;havoc #t~bitwise126; [2025-03-04 04:00:35,302 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5314: havoc #t~mem1;havoc #t~bitwise2; [2025-03-04 04:00:35,334 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5327: havoc __fswab16_#t~bitwise3#1; [2025-03-04 04:00:35,558 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7647: havoc #t~nondet424; [2025-03-04 04:00:35,604 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7719: havoc #t~nondet430; [2025-03-04 04:00:35,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7643: havoc #t~nondet423; [2025-03-04 04:00:44,517 INFO L1325 $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-04 04:00:44,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7767: havoc tty_unregister_ldisc_#t~nondet439#1; [2025-03-04 04:00:44,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5455: havoc __kmalloc_#t~ret35#1.base, __kmalloc_#t~ret35#1.offset; [2025-03-04 04:00:44,518 INFO L1325 $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-04 04:00:44,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7708: havoc ppp_register_channel_#t~nondet428#1; [2025-03-04 04:00:44,518 INFO L1325 $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-04 04:00:44,518 INFO L1325 $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-04 04:00:44,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5569: havoc skb_is_nonlinear_#t~mem59#1; [2025-03-04 04:00:44,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5540: havoc skb_queue_empty_#t~mem55#1.base, skb_queue_empty_#t~mem55#1.offset; [2025-03-04 04:00:44,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7722: havoc skb_pull_#t~ret431#1.base, skb_pull_#t~ret431#1.offset; [2025-03-04 04:00:44,518 INFO L1325 $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-04 04:00:44,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7725: havoc skb_push_#t~ret432#1.base, skb_push_#t~ret432#1.offset; [2025-03-04 04:00:44,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7759: havoc tty_register_ldisc_#t~nondet437#1; [2025-03-04 04:00:44,518 INFO L1325 $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-04 04:00:44,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7663: havoc _raw_spin_lock_irqsave_#t~nondet425#1; [2025-03-04 04:00:44,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7763: havoc tty_termios_baud_rate_#t~nondet438#1; [2025-03-04 04:00:44,626 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7695: havoc ppp_channel_index_#t~nondet427#1; [2025-03-04 04:00:44,626 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7691: havoc n_tty_ioctl_helper_#t~nondet426#1; [2025-03-04 04:00:44,626 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7712: havoc ppp_unit_number_#t~nondet429#1; [2025-03-04 04:00:44,626 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7755: havoc tty_mode_ioctl_#t~nondet436#1; [2025-03-04 04:00:44,932 INFO L? ?]: Removed 1325 outVars from TransFormulas that were not future-live. [2025-03-04 04:00:44,932 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:00:44,985 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:00:44,986 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 04:00:44,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:00:44 BoogieIcfgContainer [2025-03-04 04:00:44,987 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:00:44,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:00:44,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:00:44,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:00:44,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:00:32" (1/3) ... [2025-03-04 04:00:44,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a27ada6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:00:44, skipping insertion in model container [2025-03-04 04:00:44,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:33" (2/3) ... [2025-03-04 04:00:44,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a27ada6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:00:44, skipping insertion in model container [2025-03-04 04:00:44,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:00:44" (3/3) ... [2025-03-04 04:00:44,999 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-04 04:00:45,013 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:00:45,014 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-04 04:00:45,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:00:45,087 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;@3efa62ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:00:45,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:00:45,093 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-04 04:00:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 04:00:45,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:45,102 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-04 04:00:45,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:45,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:45,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1158550744, now seen corresponding path program 1 times [2025-03-04 04:00:45,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:45,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196898504] [2025-03-04 04:00:45,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:45,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:45,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 04:00:45,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 04:00:45,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:45,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:45,764 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-04 04:00:45,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:45,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196898504] [2025-03-04 04:00:45,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196898504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:45,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:45,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:45,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882674466] [2025-03-04 04:00:45,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:45,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:45,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:45,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:45,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:45,825 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-04 04:00:49,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:00:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:50,172 INFO L93 Difference]: Finished difference Result 2521 states and 3743 transitions. [2025-03-04 04:00:50,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:00:50,175 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-04 04:00:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:50,196 INFO L225 Difference]: With dead ends: 2521 [2025-03-04 04:00:50,197 INFO L226 Difference]: Without dead ends: 1650 [2025-03-04 04:00:50,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:50,206 INFO L435 NwaCegarLoop]: 1212 mSDtfsCounter, 1173 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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-04 04:00:50,207 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-04 04:00:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2025-03-04 04:00:50,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1650. [2025-03-04 04:00:50,311 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-04 04:00:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2389 transitions. [2025-03-04 04:00:50,332 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2389 transitions. Word has length 78 [2025-03-04 04:00:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:50,333 INFO L471 AbstractCegarLoop]: Abstraction has 1650 states and 2389 transitions. [2025-03-04 04:00:50,334 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-04 04:00:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2389 transitions. [2025-03-04 04:00:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 04:00:50,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:50,337 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-04 04:00:50,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 04:00:50,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:50,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:50,337 INFO L85 PathProgramCache]: Analyzing trace with hash 586309102, now seen corresponding path program 1 times [2025-03-04 04:00:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:50,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706236420] [2025-03-04 04:00:50,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:50,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:50,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 04:00:50,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 04:00:50,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:50,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:50,786 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-04 04:00:50,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:50,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706236420] [2025-03-04 04:00:50,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706236420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:50,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:50,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:00:50,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690662460] [2025-03-04 04:00:50,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:50,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:00:50,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:50,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:00:50,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:00:50,789 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-04 04:00:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:51,110 INFO L93 Difference]: Finished difference Result 4899 states and 7129 transitions. [2025-03-04 04:00:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:00:51,111 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-04 04:00:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:51,133 INFO L225 Difference]: With dead ends: 4899 [2025-03-04 04:00:51,133 INFO L226 Difference]: Without dead ends: 3265 [2025-03-04 04:00:51,140 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-04 04:00:51,141 INFO L435 NwaCegarLoop]: 1193 mSDtfsCounter, 1205 mSDsluCounter, 3540 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 4733 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-04 04:00:51,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 4733 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:00:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2025-03-04 04:00:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3261. [2025-03-04 04:00:51,231 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-04 04:00:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3261 states to 3261 states and 4751 transitions. [2025-03-04 04:00:51,248 INFO L78 Accepts]: Start accepts. Automaton has 3261 states and 4751 transitions. Word has length 82 [2025-03-04 04:00:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:51,248 INFO L471 AbstractCegarLoop]: Abstraction has 3261 states and 4751 transitions. [2025-03-04 04:00:51,248 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-04 04:00:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3261 states and 4751 transitions. [2025-03-04 04:00:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 04:00:51,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:51,256 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-04 04:00:51,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:00:51,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:51,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:51,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1694724329, now seen corresponding path program 1 times [2025-03-04 04:00:51,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:51,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822765443] [2025-03-04 04:00:51,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:51,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:51,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 04:00:51,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 04:00:51,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:51,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:51,484 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-04 04:00:51,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:51,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822765443] [2025-03-04 04:00:51,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822765443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:51,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:51,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:51,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707220565] [2025-03-04 04:00:51,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:51,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:51,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:51,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:51,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:51,486 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-04 04:00:51,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:51,753 INFO L93 Difference]: Finished difference Result 8130 states and 11848 transitions. [2025-03-04 04:00:51,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:00:51,754 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-04 04:00:51,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:51,779 INFO L225 Difference]: With dead ends: 8130 [2025-03-04 04:00:51,779 INFO L226 Difference]: Without dead ends: 4893 [2025-03-04 04:00:51,790 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-04 04:00:51,793 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:51,793 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.2s Time] [2025-03-04 04:00:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2025-03-04 04:00:51,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4881. [2025-03-04 04:00:51,913 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-04 04:00:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 7116 transitions. [2025-03-04 04:00:51,938 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 7116 transitions. Word has length 137 [2025-03-04 04:00:51,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:51,940 INFO L471 AbstractCegarLoop]: Abstraction has 4881 states and 7116 transitions. [2025-03-04 04:00:51,940 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-04 04:00:51,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 7116 transitions. [2025-03-04 04:00:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 04:00:51,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:51,954 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-04 04:00:51,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:00:51,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:51,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:51,955 INFO L85 PathProgramCache]: Analyzing trace with hash -643625220, now seen corresponding path program 1 times [2025-03-04 04:00:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:51,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269802468] [2025-03-04 04:00:51,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:52,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 04:00:52,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 04:00:52,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:52,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:52,187 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-04 04:00:52,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:52,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269802468] [2025-03-04 04:00:52,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269802468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:52,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:52,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:52,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240172952] [2025-03-04 04:00:52,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:52,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:52,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:52,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:52,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:52,189 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-04 04:00:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:52,519 INFO L93 Difference]: Finished difference Result 11948 states and 17306 transitions. [2025-03-04 04:00:52,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:00:52,520 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-04 04:00:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:52,558 INFO L225 Difference]: With dead ends: 11948 [2025-03-04 04:00:52,558 INFO L226 Difference]: Without dead ends: 7091 [2025-03-04 04:00:52,573 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-04 04:00:52,575 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-04 04:00:52,575 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-04 04:00:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7091 states. [2025-03-04 04:00:52,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7091 to 7077. [2025-03-04 04:00:52,799 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-04 04:00:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7077 states to 7077 states and 10202 transitions. [2025-03-04 04:00:52,837 INFO L78 Accepts]: Start accepts. Automaton has 7077 states and 10202 transitions. Word has length 167 [2025-03-04 04:00:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:52,838 INFO L471 AbstractCegarLoop]: Abstraction has 7077 states and 10202 transitions. [2025-03-04 04:00:52,838 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-04 04:00:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 7077 states and 10202 transitions. [2025-03-04 04:00:52,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 04:00:52,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:52,850 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-04 04:00:52,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:00:52,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:52,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:52,851 INFO L85 PathProgramCache]: Analyzing trace with hash -575862863, now seen corresponding path program 1 times [2025-03-04 04:00:52,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:52,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302610697] [2025-03-04 04:00:52,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:52,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:52,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 04:00:52,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 04:00:52,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:52,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:53,101 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-04 04:00:53,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:53,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302610697] [2025-03-04 04:00:53,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302610697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:53,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:53,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:53,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111920102] [2025-03-04 04:00:53,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:53,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:53,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:53,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:53,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:53,103 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-04 04:00:57,111 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-04 04:00:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:57,497 INFO L93 Difference]: Finished difference Result 17087 states and 24588 transitions. [2025-03-04 04:00:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:00:57,497 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-04 04:00:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:57,544 INFO L225 Difference]: With dead ends: 17087 [2025-03-04 04:00:57,544 INFO L226 Difference]: Without dead ends: 10045 [2025-03-04 04:00:57,565 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-04 04:00:57,566 INFO L435 NwaCegarLoop]: 1237 mSDtfsCounter, 853 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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-04 04:00:57,566 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-04 04:00:57,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10045 states. [2025-03-04 04:00:57,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10045 to 10021. [2025-03-04 04:00:57,800 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-04 04:00:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10021 states to 10021 states and 14302 transitions. [2025-03-04 04:00:57,926 INFO L78 Accepts]: Start accepts. Automaton has 10021 states and 14302 transitions. Word has length 160 [2025-03-04 04:00:57,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:57,926 INFO L471 AbstractCegarLoop]: Abstraction has 10021 states and 14302 transitions. [2025-03-04 04:00:57,927 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-04 04:00:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 10021 states and 14302 transitions. [2025-03-04 04:00:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-04 04:00:57,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:57,938 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-04 04:00:57,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:00:57,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:57,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:57,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1709090539, now seen corresponding path program 1 times [2025-03-04 04:00:57,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:57,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273190783] [2025-03-04 04:00:57,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:57,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:58,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 04:00:58,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 04:00:58,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:58,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:58,109 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-04 04:00:58,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:58,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273190783] [2025-03-04 04:00:58,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273190783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:58,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:58,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:58,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049856053] [2025-03-04 04:00:58,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:58,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:58,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:58,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:58,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:58,111 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-04 04:00:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:58,338 INFO L93 Difference]: Finished difference Result 15054 states and 21633 transitions. [2025-03-04 04:00:58,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:00:58,342 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-04 04:00:58,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:58,393 INFO L225 Difference]: With dead ends: 15054 [2025-03-04 04:00:58,394 INFO L226 Difference]: Without dead ends: 10041 [2025-03-04 04:00:58,417 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-04 04:00:58,419 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-04 04:00:58,419 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-04 04:00:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10041 states. [2025-03-04 04:00:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10041 to 10041. [2025-03-04 04:00:58,726 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-04 04:00:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10041 states to 10041 states and 14322 transitions. [2025-03-04 04:00:58,762 INFO L78 Accepts]: Start accepts. Automaton has 10041 states and 14322 transitions. Word has length 165 [2025-03-04 04:00:58,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:58,763 INFO L471 AbstractCegarLoop]: Abstraction has 10041 states and 14322 transitions. [2025-03-04 04:00:58,764 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-04 04:00:58,764 INFO L276 IsEmpty]: Start isEmpty. Operand 10041 states and 14322 transitions. [2025-03-04 04:00:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 04:00:58,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:58,775 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-04 04:00:58,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:00:58,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:58,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:58,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1689543686, now seen corresponding path program 1 times [2025-03-04 04:00:58,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:58,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960858139] [2025-03-04 04:00:58,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:58,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:58,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 04:00:58,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 04:00:58,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:58,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:59,433 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-04 04:00:59,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:59,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960858139] [2025-03-04 04:00:59,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960858139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:00:59,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654365644] [2025-03-04 04:00:59,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:59,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:00:59,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:00:59,436 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-04 04:00:59,437 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-04 04:00:59,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 04:01:00,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 04:01:00,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:00,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:00,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 04:01:00,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:01:00,335 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-04 04:01:00,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:01:01,483 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-04 04:01:01,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654365644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:01:01,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:01:01,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2025-03-04 04:01:01,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522939577] [2025-03-04 04:01:01,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:01:01,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 04:01:01,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:01,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 04:01:01,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-04 04:01:01,486 INFO L87 Difference]: Start difference. First operand 10041 states and 14322 transitions. Second operand has 14 states, 14 states have (on average 12.142857142857142) internal successors, (170), 13 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-04 04:01:05,494 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-04 04:01:09,502 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-04 04:01:13,510 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-04 04:01:17,515 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-04 04:01:21,519 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-04 04:01:25,526 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-04 04:01:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:29,801 INFO L93 Difference]: Finished difference Result 22643 states and 32459 transitions. [2025-03-04 04:01:29,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 04:01:29,802 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.142857142857142) internal successors, (170), 13 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-04 04:01:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:29,851 INFO L225 Difference]: With dead ends: 22643 [2025-03-04 04:01:29,852 INFO L226 Difference]: Without dead ends: 12637 [2025-03-04 04:01:29,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 333 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-04 04:01:29,886 INFO L435 NwaCegarLoop]: 1111 mSDtfsCounter, 4246 mSDsluCounter, 7808 mSDsCounter, 0 mSdLazyCounter, 4413 mSolverCounterSat, 832 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4341 SdHoareTripleChecker+Valid, 8919 SdHoareTripleChecker+Invalid, 5251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 832 IncrementalHoareTripleChecker+Valid, 4413 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.7s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:29,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4341 Valid, 8919 Invalid, 5251 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [832 Valid, 4413 Invalid, 6 Unknown, 0 Unchecked, 27.7s Time] [2025-03-04 04:01:29,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12637 states. [2025-03-04 04:01:30,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12637 to 12269. [2025-03-04 04:01:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12269 states, 10172 states have (on average 1.4267597325992922) internal successors, (14513), 10316 states have internal predecessors, (14513), 1429 states have call successors, (1429), 644 states have call predecessors, (1429), 667 states have return successors, (1590), 1416 states have call predecessors, (1590), 1428 states have call successors, (1590) [2025-03-04 04:01:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12269 states to 12269 states and 17532 transitions. [2025-03-04 04:01:30,252 INFO L78 Accepts]: Start accepts. Automaton has 12269 states and 17532 transitions. Word has length 166 [2025-03-04 04:01:30,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:30,252 INFO L471 AbstractCegarLoop]: Abstraction has 12269 states and 17532 transitions. [2025-03-04 04:01:30,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.142857142857142) internal successors, (170), 13 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-04 04:01:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 12269 states and 17532 transitions. [2025-03-04 04:01:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-04 04:01:30,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:30,268 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-04 04:01:30,279 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-04 04:01:30,473 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-04 04:01:30,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:30,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:30,473 INFO L85 PathProgramCache]: Analyzing trace with hash -737715960, now seen corresponding path program 1 times [2025-03-04 04:01:30,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:30,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368707289] [2025-03-04 04:01:30,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:30,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:30,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-04 04:01:30,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-04 04:01:30,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:30,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:30,755 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-04 04:01:30,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:30,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368707289] [2025-03-04 04:01:30,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368707289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:30,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:30,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:01:30,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154175304] [2025-03-04 04:01:30,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:30,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:01:30,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:30,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:01:30,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:01:30,757 INFO L87 Difference]: Start difference. First operand 12269 states and 17532 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-04 04:01:34,765 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-04 04:01:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:35,108 INFO L93 Difference]: Finished difference Result 28669 states and 40814 transitions. [2025-03-04 04:01:35,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:01:35,109 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-04 04:01:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:35,164 INFO L225 Difference]: With dead ends: 28669 [2025-03-04 04:01:35,164 INFO L226 Difference]: Without dead ends: 16435 [2025-03-04 04:01:35,192 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-04 04:01:35,192 INFO L435 NwaCegarLoop]: 2034 mSDtfsCounter, 868 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:35,193 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.1s Time] [2025-03-04 04:01:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16435 states. [2025-03-04 04:01:35,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16435 to 12285. [2025-03-04 04:01:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12285 states, 10188 states have (on average 1.4260895170789163) internal successors, (14529), 10332 states have internal predecessors, (14529), 1429 states have call successors, (1429), 644 states have call predecessors, (1429), 667 states have return successors, (1590), 1416 states have call predecessors, (1590), 1428 states have call successors, (1590) [2025-03-04 04:01:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12285 states to 12285 states and 17548 transitions. [2025-03-04 04:01:35,583 INFO L78 Accepts]: Start accepts. Automaton has 12285 states and 17548 transitions. Word has length 201 [2025-03-04 04:01:35,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:35,584 INFO L471 AbstractCegarLoop]: Abstraction has 12285 states and 17548 transitions. [2025-03-04 04:01:35,584 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-04 04:01:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 12285 states and 17548 transitions. [2025-03-04 04:01:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-04 04:01:35,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:35,599 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-04 04:01:35,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 04:01:35,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:35,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:35,600 INFO L85 PathProgramCache]: Analyzing trace with hash -632748343, now seen corresponding path program 1 times [2025-03-04 04:01:35,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:35,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996055250] [2025-03-04 04:01:35,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:35,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-04 04:01:35,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-04 04:01:35,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:35,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:36,040 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-04 04:01:36,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:36,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996055250] [2025-03-04 04:01:36,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996055250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:36,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:36,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:01:36,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902872678] [2025-03-04 04:01:36,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:36,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:01:36,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:36,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:01:36,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:01:36,042 INFO L87 Difference]: Start difference. First operand 12285 states and 17548 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-04 04:01:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:36,346 INFO L93 Difference]: Finished difference Result 24577 states and 35130 transitions. [2025-03-04 04:01:36,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:01:36,347 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-04 04:01:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:36,434 INFO L225 Difference]: With dead ends: 24577 [2025-03-04 04:01:36,435 INFO L226 Difference]: Without dead ends: 12327 [2025-03-04 04:01:36,448 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-04 04:01:36,448 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.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:36,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4751 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:01:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12327 states. [2025-03-04 04:01:36,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12327 to 12317. [2025-03-04 04:01:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12317 states, 10212 states have (on average 1.4250881316098707) internal successors, (14553), 10356 states have internal predecessors, (14553), 1429 states have call successors, (1429), 644 states have call predecessors, (1429), 675 states have return successors, (1600), 1424 states have call predecessors, (1600), 1428 states have call successors, (1600) [2025-03-04 04:01:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12317 states to 12317 states and 17582 transitions. [2025-03-04 04:01:36,716 INFO L78 Accepts]: Start accepts. Automaton has 12317 states and 17582 transitions. Word has length 214 [2025-03-04 04:01:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:36,717 INFO L471 AbstractCegarLoop]: Abstraction has 12317 states and 17582 transitions. [2025-03-04 04:01:36,717 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-04 04:01:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 12317 states and 17582 transitions. [2025-03-04 04:01:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-04 04:01:36,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:36,731 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-04 04:01:36,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 04:01:36,731 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:36,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:36,731 INFO L85 PathProgramCache]: Analyzing trace with hash -998397921, now seen corresponding path program 1 times [2025-03-04 04:01:36,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:36,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088701948] [2025-03-04 04:01:36,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:36,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:36,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-04 04:01:36,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-04 04:01:36,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:36,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:37,178 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-04 04:01:37,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:37,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088701948] [2025-03-04 04:01:37,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088701948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:37,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877159476] [2025-03-04 04:01:37,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:37,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:37,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:01:37,182 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-04 04:01:37,184 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-04 04:01:37,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-04 04:01:37,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-04 04:01:37,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:37,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:37,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 04:01:37,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:01:37,838 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-04 04:01:37,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:01:37,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877159476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:37,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:01:37,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-04 04:01:37,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735871459] [2025-03-04 04:01:37,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:37,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:01:37,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:37,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:01:37,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 04:01:37,840 INFO L87 Difference]: Start difference. First operand 12317 states and 17582 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-04 04:01:41,847 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-04 04:01:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:42,436 INFO L93 Difference]: Finished difference Result 28789 states and 40938 transitions. [2025-03-04 04:01:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 04:01:42,437 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-04 04:01:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:42,496 INFO L225 Difference]: With dead ends: 28789 [2025-03-04 04:01:42,496 INFO L226 Difference]: Without dead ends: 16507 [2025-03-04 04:01:42,523 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-04 04:01:42,524 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:42,524 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.3s Time] [2025-03-04 04:01:42,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16507 states. [2025-03-04 04:01:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16507 to 12325. [2025-03-04 04:01:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12325 states, 10220 states have (on average 1.4247553816046967) internal successors, (14561), 10356 states have internal predecessors, (14561), 1429 states have call successors, (1429), 644 states have call predecessors, (1429), 675 states have return successors, (1600), 1424 states have call predecessors, (1600), 1428 states have call successors, (1600) [2025-03-04 04:01:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12325 states to 12325 states and 17590 transitions. [2025-03-04 04:01:42,909 INFO L78 Accepts]: Start accepts. Automaton has 12325 states and 17590 transitions. Word has length 221 [2025-03-04 04:01:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:42,910 INFO L471 AbstractCegarLoop]: Abstraction has 12325 states and 17590 transitions. [2025-03-04 04:01:42,910 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-04 04:01:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 12325 states and 17590 transitions. [2025-03-04 04:01:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-04 04:01:42,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:42,927 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-04 04:01:42,938 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-04 04:01:43,127 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-04 04:01:43,128 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:43,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1978675755, now seen corresponding path program 1 times [2025-03-04 04:01:43,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:43,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718495900] [2025-03-04 04:01:43,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:43,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:43,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-04 04:01:43,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-04 04:01:43,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:43,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:43,586 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-04 04:01:43,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:43,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718495900] [2025-03-04 04:01:43,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718495900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:43,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574228065] [2025-03-04 04:01:43,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:43,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:43,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:01:43,589 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-04 04:01:43,591 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-04 04:01:44,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-04 04:01:44,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-04 04:01:44,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:44,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:44,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 2367 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 04:01:44,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:01:44,727 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-04 04:01:44,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:01:44,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574228065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:44,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:01:44,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 04:01:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336752228] [2025-03-04 04:01:44,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:44,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:01:44,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:44,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:01:44,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:01:44,729 INFO L87 Difference]: Start difference. First operand 12325 states and 17590 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-04 04:01:48,738 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-04 04:01:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:49,298 INFO L93 Difference]: Finished difference Result 16549 states and 23448 transitions. [2025-03-04 04:01:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:01:49,299 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-04 04:01:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:49,348 INFO L225 Difference]: With dead ends: 16549 [2025-03-04 04:01:49,349 INFO L226 Difference]: Without dead ends: 16523 [2025-03-04 04:01:49,355 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-04 04:01:49,356 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-04 04:01:49,356 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-04 04:01:49,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16523 states. [2025-03-04 04:01:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16523 to 14817. [2025-03-04 04:01:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14817 states, 12252 states have (on average 1.4186255305256286) internal successors, (17381), 12416 states have internal predecessors, (17381), 1736 states have call successors, (1736), 789 states have call predecessors, (1736), 828 states have return successors, (1975), 1731 states have call predecessors, (1975), 1735 states have call successors, (1975) [2025-03-04 04:01:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14817 states to 14817 states and 21092 transitions. [2025-03-04 04:01:49,780 INFO L78 Accepts]: Start accepts. Automaton has 14817 states and 21092 transitions. Word has length 259 [2025-03-04 04:01:49,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:49,780 INFO L471 AbstractCegarLoop]: Abstraction has 14817 states and 21092 transitions. [2025-03-04 04:01:49,781 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-04 04:01:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 14817 states and 21092 transitions. [2025-03-04 04:01:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-04 04:01:49,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:49,795 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-04 04:01:49,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 04:01:49,995 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-04 04:01:49,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:49,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:49,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1781194213, now seen corresponding path program 1 times [2025-03-04 04:01:49,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:49,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93660952] [2025-03-04 04:01:49,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:49,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:50,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-04 04:01:50,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-04 04:01:50,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:50,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:50,601 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-04 04:01:50,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:50,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93660952] [2025-03-04 04:01:50,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93660952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:50,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:50,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:01:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020680559] [2025-03-04 04:01:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:50,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:01:50,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:50,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:01:50,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:01:50,604 INFO L87 Difference]: Start difference. First operand 14817 states and 21092 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) [2025-03-04 04:01:54,611 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-04 04:01:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:54,859 INFO L93 Difference]: Finished difference Result 22161 states and 31565 transitions. [2025-03-04 04:01:54,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:01:54,859 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 263 [2025-03-04 04:01:54,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:54,883 INFO L225 Difference]: With dead ends: 22161 [2025-03-04 04:01:54,883 INFO L226 Difference]: Without dead ends: 6251 [2025-03-04 04:01:54,901 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-04 04:01:54,902 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 1081 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:54,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 1295 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:01:54,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2025-03-04 04:01:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 6251. [2025-03-04 04:01:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6251 states, 5140 states have (on average 1.4070038910505838) internal successors, (7232), 5211 states have internal predecessors, (7232), 744 states have call successors, (744), 349 states have call predecessors, (744), 366 states have return successors, (849), 744 states have call predecessors, (849), 743 states have call successors, (849) [2025-03-04 04:01:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6251 states to 6251 states and 8825 transitions. [2025-03-04 04:01:55,068 INFO L78 Accepts]: Start accepts. Automaton has 6251 states and 8825 transitions. Word has length 263 [2025-03-04 04:01:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:55,069 INFO L471 AbstractCegarLoop]: Abstraction has 6251 states and 8825 transitions. [2025-03-04 04:01:55,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2025-03-04 04:01:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 6251 states and 8825 transitions. [2025-03-04 04:01:55,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-04 04:01:55,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:55,077 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:01:55,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 04:01:55,077 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:55,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:55,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1088303584, now seen corresponding path program 1 times [2025-03-04 04:01:55,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:55,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645704884] [2025-03-04 04:01:55,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:55,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:55,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-04 04:01:55,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-04 04:01:55,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:55,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-03-04 04:01:56,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:56,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645704884] [2025-03-04 04:01:56,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645704884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:56,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:56,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 04:01:56,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747197701] [2025-03-04 04:01:56,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:56,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 04:01:56,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:56,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 04:01:56,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 04:01:56,319 INFO L87 Difference]: Start difference. First operand 6251 states and 8825 transitions. Second operand has 8 states, 8 states have (on average 20.625) internal successors, (165), 7 states have internal predecessors, (165), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28)