./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.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-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.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 3aefe7c24f7dbfd113682bd81b91ef3b049ad438c933de49acd0f78d1e093848 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:56:00,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:56:00,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:56:00,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:56:00,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:56:00,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:56:00,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:56:00,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:56:00,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:56:00,377 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:56:00,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:56:00,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:56:00,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:56:00,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:56:00,378 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:56:00,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:56:00,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:56:00,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:56:00,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:56:00,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:56:00,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:56:00,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:56:00,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:56:00,379 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:56:00,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:56:00,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:56:00,379 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 -> 3aefe7c24f7dbfd113682bd81b91ef3b049ad438c933de49acd0f78d1e093848 [2025-03-04 03:56:00,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:56:00,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:56:00,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:56:00,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:56:00,663 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:56:00,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2025-03-04 03:56:01,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1da5bf75/33bc4e42ffd34b73b7afdd6e1c382184/FLAG837af1fee [2025-03-04 03:56:02,487 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:56:02,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2025-03-04 03:56:02,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1da5bf75/33bc4e42ffd34b73b7afdd6e1c382184/FLAG837af1fee [2025-03-04 03:56:03,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1da5bf75/33bc4e42ffd34b73b7afdd6e1c382184 [2025-03-04 03:56:03,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:56:03,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:56:03,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:56:03,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:56:03,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:56:03,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:56:03" (1/1) ... [2025-03-04 03:56:03,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@557ea9f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:03, skipping insertion in model container [2025-03-04 03:56:03,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:56:03" (1/1) ... [2025-03-04 03:56:03,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:56:04,139 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-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i[133672,133685] [2025-03-04 03:56:04,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:56:04,243 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:56:04,302 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"); [3073] [2025-03-04 03:56:04,307 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3087-3088] [2025-03-04 03:56:04,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [3102] [2025-03-04 03:56:04,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3105] [2025-03-04 03:56:04,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3108] [2025-03-04 03:56:04,309 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3111] [2025-03-04 03:56:04,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& kernel_stack)); [3173] [2025-03-04 03:56:04,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3176] [2025-03-04 03:56:04,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3179] [2025-03-04 03:56:04,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3182] [2025-03-04 03:56:04,475 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-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i[133672,133685] [2025-03-04 03:56:04,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:56:04,534 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:56:04,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:04 WrapperNode [2025-03-04 03:56:04,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:56:04,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:56:04,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:56:04,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:56:04,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:04" (1/1) ... [2025-03-04 03:56:04,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:04" (1/1) ... [2025-03-04 03:56:04,693 INFO L138 Inliner]: procedures = 191, calls = 833, calls flagged for inlining = 89, calls inlined = 75, statements flattened = 2334 [2025-03-04 03:56:04,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:56:04,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:56:04,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:56:04,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:56:04,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:04" (1/1) ... [2025-03-04 03:56:04,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:04" (1/1) ... [2025-03-04 03:56:04,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:04" (1/1) ... [2025-03-04 03:56:04,861 INFO L175 MemorySlicer]: Split 435 memory accesses to 14 slices as follows [2, 7, 2, 7, 7, 35, 9, 113, 5, 8, 3, 234, 2, 1]. 54 percent of accesses are in the largest equivalence class. The 39 initializations are split as follows [2, 7, 0, 7, 7, 7, 9, 0, 0, 0, 0, 0, 0, 0]. The 171 writes are split as follows [0, 0, 0, 0, 0, 28, 0, 103, 5, 1, 0, 34, 0, 0]. [2025-03-04 03:56:04,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:04" (1/1) ... [2025-03-04 03:56:04,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:04" (1/1) ... [2025-03-04 03:56:04,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:04" (1/1) ... [2025-03-04 03:56:04,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:04" (1/1) ... [2025-03-04 03:56:04,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:04" (1/1) ... [2025-03-04 03:56:04,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:04" (1/1) ... [2025-03-04 03:56:05,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:56:05,009 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:56:05,009 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:56:05,009 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:56:05,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:04" (1/1) ... [2025-03-04 03:56:05,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:56:05,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:56:05,039 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 03:56:05,043 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 03:56:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:56:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:56:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:56:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:56:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:56:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:56:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 03:56:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure input_event_size [2025-03-04 03:56:05,063 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event_size [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 03:56:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 03:56:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 03:56:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 03:56:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:56:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:56:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 03:56:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2025-03-04 03:56:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2025-03-04 03:56:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-03-04 03:56:05,067 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-03-04 03:56:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_request_done [2025-03-04 03:56:05,067 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_request_done [2025-03-04 03:56:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 03:56:05,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 03:56:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-04 03:56:05,067 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-04 03:56:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 03:56:05,067 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 03:56:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_flat [2025-03-04 03:56:05,067 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_flat [2025-03-04 03:56:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:56:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:56:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:56:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:56:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:56:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:56:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 03:56:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 03:56:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 03:56:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 03:56:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 03:56:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 03:56:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 03:56:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 03:56:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-04 03:56:05,069 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-04 03:56:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-03-04 03:56:05,069 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-03-04 03:56:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 03:56:05,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 03:56:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure input_alloc_absinfo [2025-03-04 03:56:05,069 INFO L138 BoogieDeclarations]: Found implementation of procedure input_alloc_absinfo [2025-03-04 03:56:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2025-03-04 03:56:05,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2025-03-04 03:56:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 03:56:05,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 03:56:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_request_find [2025-03-04 03:56:05,069 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_request_find [2025-03-04 03:56:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_uinput_device [2025-03-04 03:56:05,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_uinput_device [2025-03-04 03:56:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:56:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_allocate_device [2025-03-04 03:56:05,070 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_allocate_device [2025-03-04 03:56:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-03-04 03:56:05,070 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-03-04 03:56:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:56:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_ioctl_handler [2025-03-04 03:56:05,070 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_ioctl_handler [2025-03-04 03:56:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:56:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:56:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:56:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:56:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:56:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:56:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 03:56:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 03:56:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 03:56:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 03:56:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 03:56:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 03:56:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 03:56:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 03:56:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:56:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2025-03-04 03:56:05,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __bad_percpu_size [2025-03-04 03:56:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_ff_upload_from_user [2025-03-04 03:56:05,073 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_ff_upload_from_user [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_destroy_device [2025-03-04 03:56:05,073 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_destroy_device [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_max [2025-03-04 03:56:05,073 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_max [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-03-04 03:56:05,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-03-04 03:56:05,073 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2025-03-04 03:56:05,073 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-03-04 03:56:05,073 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_min [2025-03-04 03:56:05,073 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_min [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 03:56:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure is_compat_task [2025-03-04 03:56:05,074 INFO L138 BoogieDeclarations]: Found implementation of procedure is_compat_task [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-04 03:56:05,074 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait [2025-03-04 03:56:05,074 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 03:56:05,074 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 03:56:05,074 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-04 03:56:05,074 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2025-03-04 03:56:05,074 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-04 03:56:05,074 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-04 03:56:05,074 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 03:56:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2025-03-04 03:56:05,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2025-03-04 03:56:05,078 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 03:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-04 03:56:05,079 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-04 03:56:05,079 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-03-04 03:56:05,079 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-03-04 03:56:05,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:56:05,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:56:05,079 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-04 03:56:05,079 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-04 03:56:05,542 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:56:05,546 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:56:05,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3359: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-04 03:56:14,765 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4265: call ULTIMATE.dealloc(uinput_ff_upload_to_user_~#ff_up_compat~0#1.base, uinput_ff_upload_to_user_~#ff_up_compat~0#1.offset);havoc uinput_ff_upload_to_user_~#ff_up_compat~0#1.base, uinput_ff_upload_to_user_~#ff_up_compat~0#1.offset; [2025-03-04 03:56:14,766 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5407: havoc strndup_user_#t~ret537#1.base, strndup_user_#t~ret537#1.offset; [2025-03-04 03:56:14,767 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4899-1: ldv_mutex_lock_interruptible_12_#res#1 := ldv_mutex_lock_interruptible_12_~ldv_func_res~4#1; [2025-03-04 03:56:14,767 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5350: havoc input_register_device_#t~nondet528#1; [2025-03-04 03:56:14,767 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4360: call ULTIMATE.dealloc(~#ff_up~0#1.base, ~#ff_up~0#1.offset);havoc ~#ff_up~0#1.base, ~#ff_up~0#1.offset;call ULTIMATE.dealloc(~#ff_erase~0#1.base, ~#ff_erase~0#1.offset);havoc ~#ff_erase~0#1.base, ~#ff_erase~0#1.offset; [2025-03-04 03:56:14,767 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336: havoc input_ff_create_#t~nondet526#1; [2025-03-04 03:56:14,974 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5383: havoc #t~nondet533; [2025-03-04 03:56:14,988 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3426: havoc #t~mem114.base, #t~mem114.offset;havoc #t~ite117;havoc #t~mem115.base, #t~mem115.offset;havoc #t~mem116; [2025-03-04 03:56:15,063 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5401: havoc #t~nondet536; [2025-03-04 03:56:15,081 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3369: havoc __kmalloc_#t~ret94#1.base, __kmalloc_#t~ret94#1.offset; [2025-03-04 03:56:15,090 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5286: havoc #t~nondet520; [2025-03-04 03:56:15,121 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080: havoc #t~mem1;havoc #t~bitwise2; [2025-03-04 03:56:15,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3474: havoc #t~mem128.base, #t~mem128.offset;havoc #t~ite131;havoc #t~mem129.base, #t~mem129.offset;havoc #t~mem130; [2025-03-04 03:56:15,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5290: havoc _copy_to_user_#t~nondet521#1; [2025-03-04 03:56:15,155 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3604: havoc #t~mem162.base, #t~mem162.offset; [2025-03-04 03:56:15,179 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5312: havoc dev_set_drvdata_#t~nondet523#1; [2025-03-04 03:56:15,179 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3394: havoc input_allocate_device_#t~ret103#1.base, input_allocate_device_#t~ret103#1.offset; [2025-03-04 03:56:15,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4311: call ULTIMATE.dealloc(~#ff_up_compat~1.base, ~#ff_up_compat~1.offset);havoc ~#ff_up_compat~1.base, ~#ff_up_compat~1.offset; [2025-03-04 03:56:15,290 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3444: havoc #t~mem120.base, #t~mem120.offset;havoc #t~ite123;havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122; [2025-03-04 03:56:16,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4165: call ULTIMATE.dealloc(uinput_read_~#__wait~1#1.base, uinput_read_~#__wait~1#1.offset);havoc uinput_read_~#__wait~1#1.base, uinput_read_~#__wait~1#1.offset; [2025-03-04 03:56:16,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5372: havoc misc_deregister_#t~nondet531#1; [2025-03-04 03:56:16,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5356: havoc kstrndup_#t~ret529#1.base, kstrndup_#t~ret529#1.offset; [2025-03-04 03:56:16,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4878-1: ldv_mutex_lock_interruptible_10_#res#1 := ldv_mutex_lock_interruptible_10_~ldv_func_res~3#1; [2025-03-04 03:56:16,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5376: havoc misc_register_#t~nondet532#1; [2025-03-04 03:56:16,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394: havoc nonseekable_open_#t~nondet535#1; [2025-03-04 03:56:16,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5328: havoc input_event_from_user_#t~nondet524#1; [2025-03-04 03:56:16,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5346: havoc input_mt_init_slots_#t~nondet527#1; [2025-03-04 03:56:16,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4126: call ULTIMATE.dealloc(uinput_events_to_user_~#event~0#1.base, uinput_events_to_user_~#event~0#1.offset);havoc uinput_events_to_user_~#event~0#1.base, uinput_events_to_user_~#event~0#1.offset; [2025-03-04 03:56:16,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4060: call ULTIMATE.dealloc(uinput_inject_event_~#ev~0#1.base, uinput_inject_event_~#ev~0#1.offset);havoc uinput_inject_event_~#ev~0#1.base, uinput_inject_event_~#ev~0#1.offset; [2025-03-04 03:56:16,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5365: havoc memdup_user_#t~ret530#1.base, memdup_user_#t~ret530#1.offset; [2025-03-04 03:56:16,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5332: havoc input_event_to_user_#t~nondet525#1; [2025-03-04 03:56:16,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3864: call ULTIMATE.dealloc(uinput_open_~#__key~1#1.base, uinput_open_~#__key~1#1.offset);havoc uinput_open_~#__key~1#1.base, uinput_open_~#__key~1#1.offset;call ULTIMATE.dealloc(uinput_open_~#__key___0~0#1.base, uinput_open_~#__key___0~0#1.offset);havoc uinput_open_~#__key___0~0#1.base, uinput_open_~#__key___0~0#1.offset;call ULTIMATE.dealloc(uinput_open_~#__key___1~0#1.base, uinput_open_~#__key___1~0#1.offset);havoc uinput_open_~#__key___1~0#1.base, uinput_open_~#__key___1~0#1.offset;call ULTIMATE.dealloc(uinput_open_~#__key___2~0#1.base, uinput_open_~#__key___2~0#1.offset);havoc uinput_open_~#__key___2~0#1.base, uinput_open_~#__key___2~0#1.offset; [2025-03-04 03:56:16,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4857-1: ldv_mutex_lock_interruptible_8_#res#1 := ldv_mutex_lock_interruptible_8_~ldv_func_res~2#1; [2025-03-04 03:56:17,021 INFO L? ?]: Removed 1200 outVars from TransFormulas that were not future-live. [2025-03-04 03:56:17,021 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:56:17,060 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:56:17,060 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 03:56:17,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:56:17 BoogieIcfgContainer [2025-03-04 03:56:17,061 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:56:17,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:56:17,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:56:17,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:56:17,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:56:03" (1/3) ... [2025-03-04 03:56:17,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4797b15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:56:17, skipping insertion in model container [2025-03-04 03:56:17,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:04" (2/3) ... [2025-03-04 03:56:17,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4797b15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:56:17, skipping insertion in model container [2025-03-04 03:56:17,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:56:17" (3/3) ... [2025-03-04 03:56:17,068 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2025-03-04 03:56:17,079 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:56:17,080 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i that has 58 procedures, 780 locations, 1 initial locations, 29 loop locations, and 1 error locations. [2025-03-04 03:56:17,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:56:17,166 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;@5d4fe858, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:56:17,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:56:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 715 states, 527 states have (on average 1.3586337760910816) internal successors, (716), 541 states have internal predecessors, (716), 142 states have call successors, (142), 44 states have call predecessors, (142), 44 states have return successors, (142), 140 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-04 03:56:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 03:56:17,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:17,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:56:17,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:17,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:17,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2086304081, now seen corresponding path program 1 times [2025-03-04 03:56:17,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:17,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058474328] [2025-03-04 03:56:17,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:17,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:17,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 03:56:17,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 03:56:17,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:17,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:56:17,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:17,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058474328] [2025-03-04 03:56:17,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058474328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:17,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:17,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:56:17,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103318949] [2025-03-04 03:56:17,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:17,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:56:17,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:17,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:56:17,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:56:17,699 INFO L87 Difference]: Start difference. First operand has 715 states, 527 states have (on average 1.3586337760910816) internal successors, (716), 541 states have internal predecessors, (716), 142 states have call successors, (142), 44 states have call predecessors, (142), 44 states have return successors, (142), 140 states have call predecessors, (142), 142 states have call successors, (142) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:56:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:18,602 INFO L93 Difference]: Finished difference Result 1419 states and 2003 transitions. [2025-03-04 03:56:18,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:56:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-04 03:56:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:18,621 INFO L225 Difference]: With dead ends: 1419 [2025-03-04 03:56:18,621 INFO L226 Difference]: Without dead ends: 708 [2025-03-04 03:56:18,631 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 03:56:18,634 INFO L435 NwaCegarLoop]: 981 mSDtfsCounter, 980 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:18,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 981 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 03:56:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-03-04 03:56:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2025-03-04 03:56:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 523 states have (on average 1.3518164435946463) internal successors, (707), 534 states have internal predecessors, (707), 141 states have call successors, (141), 44 states have call predecessors, (141), 43 states have return successors, (137), 135 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-04 03:56:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 985 transitions. [2025-03-04 03:56:18,746 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 985 transitions. Word has length 14 [2025-03-04 03:56:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:18,749 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 985 transitions. [2025-03-04 03:56:18,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:56:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 985 transitions. [2025-03-04 03:56:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 03:56:18,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:18,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:56:18,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 03:56:18,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:18,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash 250325395, now seen corresponding path program 1 times [2025-03-04 03:56:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:18,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675220007] [2025-03-04 03:56:18,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:18,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 03:56:18,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 03:56:18,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:18,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:56:19,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:19,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675220007] [2025-03-04 03:56:19,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675220007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:19,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:19,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:56:19,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183686862] [2025-03-04 03:56:19,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:19,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:56:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:19,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:56:19,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:56:19,010 INFO L87 Difference]: Start difference. First operand 708 states and 985 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:56:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:20,053 INFO L93 Difference]: Finished difference Result 710 states and 986 transitions. [2025-03-04 03:56:20,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:56:20,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-04 03:56:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:20,062 INFO L225 Difference]: With dead ends: 710 [2025-03-04 03:56:20,065 INFO L226 Difference]: Without dead ends: 707 [2025-03-04 03:56:20,066 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 03:56:20,067 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 973 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:20,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 975 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 03:56:20,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-04 03:56:20,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2025-03-04 03:56:20,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 523 states have (on average 1.349904397705545) internal successors, (706), 533 states have internal predecessors, (706), 140 states have call successors, (140), 44 states have call predecessors, (140), 43 states have return successors, (137), 135 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-04 03:56:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 983 transitions. [2025-03-04 03:56:20,122 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 983 transitions. Word has length 15 [2025-03-04 03:56:20,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:20,123 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 983 transitions. [2025-03-04 03:56:20,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:56:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 983 transitions. [2025-03-04 03:56:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 03:56:20,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:20,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:56:20,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:56:20,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:20,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:20,125 INFO L85 PathProgramCache]: Analyzing trace with hash -830440046, now seen corresponding path program 1 times [2025-03-04 03:56:20,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:20,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529160981] [2025-03-04 03:56:20,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:20,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:20,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 03:56:20,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 03:56:20,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:20,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:56:20,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:20,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529160981] [2025-03-04 03:56:20,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529160981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:20,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:20,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:56:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298221360] [2025-03-04 03:56:20,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:20,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:56:20,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:20,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:56:20,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:56:20,325 INFO L87 Difference]: Start difference. First operand 707 states and 983 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:56:21,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:56:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:21,560 INFO L93 Difference]: Finished difference Result 2049 states and 2871 transitions. [2025-03-04 03:56:21,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:56:21,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-04 03:56:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:21,573 INFO L225 Difference]: With dead ends: 2049 [2025-03-04 03:56:21,573 INFO L226 Difference]: Without dead ends: 1342 [2025-03-04 03:56:21,577 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 03:56:21,578 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 966 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:21,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 2495 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 03:56:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-04 03:56:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1339. [2025-03-04 03:56:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 994 states have (on average 1.3490945674044266) internal successors, (1341), 1012 states have internal predecessors, (1341), 264 states have call successors, (264), 82 states have call predecessors, (264), 80 states have return successors, (268), 254 states have call predecessors, (268), 258 states have call successors, (268) [2025-03-04 03:56:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1873 transitions. [2025-03-04 03:56:21,668 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1873 transitions. Word has length 16 [2025-03-04 03:56:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:21,668 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 1873 transitions. [2025-03-04 03:56:21,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 03:56:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1873 transitions. [2025-03-04 03:56:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 03:56:21,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:21,672 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:56:21,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:56:21,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:21,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:21,672 INFO L85 PathProgramCache]: Analyzing trace with hash 204166545, now seen corresponding path program 1 times [2025-03-04 03:56:21,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:21,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956315582] [2025-03-04 03:56:21,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:21,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:21,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 03:56:21,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 03:56:21,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:21,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 03:56:21,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:21,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956315582] [2025-03-04 03:56:21,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956315582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:21,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:21,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:56:21,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761384657] [2025-03-04 03:56:21,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:21,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:56:21,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:21,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:56:21,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:56:21,933 INFO L87 Difference]: Start difference. First operand 1339 states and 1873 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 03:56:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:22,064 INFO L93 Difference]: Finished difference Result 2749 states and 3862 transitions. [2025-03-04 03:56:22,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:56:22,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2025-03-04 03:56:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:22,080 INFO L225 Difference]: With dead ends: 2749 [2025-03-04 03:56:22,080 INFO L226 Difference]: Without dead ends: 1418 [2025-03-04 03:56:22,085 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 03:56:22,087 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 54 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:22,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1918 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:56:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2025-03-04 03:56:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1409. [2025-03-04 03:56:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1054 states have (on average 1.3510436432637571) internal successors, (1424), 1072 states have internal predecessors, (1424), 274 states have call successors, (274), 82 states have call predecessors, (274), 80 states have return successors, (282), 264 states have call predecessors, (282), 268 states have call successors, (282) [2025-03-04 03:56:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1980 transitions. [2025-03-04 03:56:22,187 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1980 transitions. Word has length 44 [2025-03-04 03:56:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:22,187 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 1980 transitions. [2025-03-04 03:56:22,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 03:56:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1980 transitions. [2025-03-04 03:56:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 03:56:22,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:22,190 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:56:22,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:56:22,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:22,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:22,195 INFO L85 PathProgramCache]: Analyzing trace with hash -485680070, now seen corresponding path program 1 times [2025-03-04 03:56:22,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:22,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440409430] [2025-03-04 03:56:22,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:22,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:22,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 03:56:22,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 03:56:22,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:22,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 03:56:22,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:22,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440409430] [2025-03-04 03:56:22,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440409430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:22,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:22,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:56:22,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526179678] [2025-03-04 03:56:22,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:22,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:56:22,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:22,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:56:22,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:56:22,511 INFO L87 Difference]: Start difference. First operand 1409 states and 1980 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 03:56:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:23,493 INFO L93 Difference]: Finished difference Result 2812 states and 3952 transitions. [2025-03-04 03:56:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:56:23,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2025-03-04 03:56:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:23,504 INFO L225 Difference]: With dead ends: 2812 [2025-03-04 03:56:23,504 INFO L226 Difference]: Without dead ends: 1411 [2025-03-04 03:56:23,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:56:23,513 INFO L435 NwaCegarLoop]: 1165 mSDtfsCounter, 882 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:23,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 2117 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 03:56:23,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2025-03-04 03:56:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1402. [2025-03-04 03:56:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1051 states have (on average 1.3501427212178878) internal successors, (1419), 1067 states have internal predecessors, (1419), 270 states have call successors, (270), 82 states have call predecessors, (270), 80 states have return successors, (266), 262 states have call predecessors, (266), 259 states have call successors, (266) [2025-03-04 03:56:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1955 transitions. [2025-03-04 03:56:23,573 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1955 transitions. Word has length 55 [2025-03-04 03:56:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:23,574 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 1955 transitions. [2025-03-04 03:56:23,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 03:56:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1955 transitions. [2025-03-04 03:56:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 03:56:23,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:23,576 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:56:23,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 03:56:23,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:23,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:23,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1330151941, now seen corresponding path program 1 times [2025-03-04 03:56:23,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:23,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602562996] [2025-03-04 03:56:23,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:23,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:23,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 03:56:23,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 03:56:23,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:23,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 03:56:23,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:23,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602562996] [2025-03-04 03:56:23,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602562996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:23,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:23,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:56:23,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807164784] [2025-03-04 03:56:23,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:23,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:56:23,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:23,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:56:23,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:56:23,887 INFO L87 Difference]: Start difference. First operand 1402 states and 1955 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 03:56:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:24,073 INFO L93 Difference]: Finished difference Result 1532 states and 2107 transitions. [2025-03-04 03:56:24,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:56:24,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2025-03-04 03:56:24,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:24,080 INFO L225 Difference]: With dead ends: 1532 [2025-03-04 03:56:24,080 INFO L226 Difference]: Without dead ends: 1174 [2025-03-04 03:56:24,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:56:24,083 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 2 mSDsluCounter, 3887 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4871 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:24,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4871 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:56:24,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-03-04 03:56:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1169. [2025-03-04 03:56:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 878 states have (on average 1.328018223234624) internal successors, (1166), 890 states have internal predecessors, (1166), 218 states have call successors, (218), 74 states have call predecessors, (218), 72 states have return successors, (215), 213 states have call predecessors, (215), 208 states have call successors, (215) [2025-03-04 03:56:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1599 transitions. [2025-03-04 03:56:24,125 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1599 transitions. Word has length 55 [2025-03-04 03:56:24,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:24,126 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1599 transitions. [2025-03-04 03:56:24,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 03:56:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1599 transitions. [2025-03-04 03:56:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 03:56:24,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:24,127 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-04 03:56:24,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 03:56:24,128 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:24,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:24,128 INFO L85 PathProgramCache]: Analyzing trace with hash -519339778, now seen corresponding path program 1 times [2025-03-04 03:56:24,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:24,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744122800] [2025-03-04 03:56:24,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:24,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:24,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 03:56:24,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 03:56:24,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:24,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 03:56:24,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:24,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744122800] [2025-03-04 03:56:24,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744122800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:24,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:24,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:56:24,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547126730] [2025-03-04 03:56:24,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:24,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:56:24,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:24,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:56:24,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:56:24,421 INFO L87 Difference]: Start difference. First operand 1169 states and 1599 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 03:56:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:24,605 INFO L93 Difference]: Finished difference Result 1411 states and 1922 transitions. [2025-03-04 03:56:24,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:56:24,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2025-03-04 03:56:24,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:24,615 INFO L225 Difference]: With dead ends: 1411 [2025-03-04 03:56:24,615 INFO L226 Difference]: Without dead ends: 1164 [2025-03-04 03:56:24,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:56:24,617 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 134 mSDsluCounter, 3711 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 4689 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:24,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 4689 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:56:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2025-03-04 03:56:24,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1159. [2025-03-04 03:56:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 869 states have (on average 1.3302646720368239) internal successors, (1156), 884 states have internal predecessors, (1156), 218 states have call successors, (218), 74 states have call predecessors, (218), 71 states have return successors, (211), 209 states have call predecessors, (211), 208 states have call successors, (211) [2025-03-04 03:56:24,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1585 transitions. [2025-03-04 03:56:24,665 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1585 transitions. Word has length 58 [2025-03-04 03:56:24,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:24,665 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1585 transitions. [2025-03-04 03:56:24,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 03:56:24,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1585 transitions. [2025-03-04 03:56:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 03:56:24,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:24,671 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-04 03:56:24,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 03:56:24,672 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:24,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:24,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1576634984, now seen corresponding path program 1 times [2025-03-04 03:56:24,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:24,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355903704] [2025-03-04 03:56:24,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:24,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:24,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 03:56:24,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 03:56:24,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:24,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 03:56:24,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355903704] [2025-03-04 03:56:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355903704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:24,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:24,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:56:24,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566071319] [2025-03-04 03:56:24,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:24,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:56:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:24,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:56:24,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:56:24,880 INFO L87 Difference]: Start difference. First operand 1159 states and 1585 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 03:56:24,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:24,971 INFO L93 Difference]: Finished difference Result 2316 states and 3170 transitions. [2025-03-04 03:56:24,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:56:24,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-03-04 03:56:24,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:24,978 INFO L225 Difference]: With dead ends: 2316 [2025-03-04 03:56:24,978 INFO L226 Difference]: Without dead ends: 1162 [2025-03-04 03:56:24,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:56:24,982 INFO L435 NwaCegarLoop]: 973 mSDtfsCounter, 0 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2914 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:24,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2914 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:56:24,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-03-04 03:56:25,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2025-03-04 03:56:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 871 states have (on average 1.328358208955224) internal successors, (1157), 886 states have internal predecessors, (1157), 219 states have call successors, (219), 74 states have call predecessors, (219), 71 states have return successors, (212), 210 states have call predecessors, (212), 209 states have call successors, (212) [2025-03-04 03:56:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1588 transitions. [2025-03-04 03:56:25,042 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1588 transitions. Word has length 75 [2025-03-04 03:56:25,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:25,043 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1588 transitions. [2025-03-04 03:56:25,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 03:56:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1588 transitions. [2025-03-04 03:56:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 03:56:25,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:25,047 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-04 03:56:25,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 03:56:25,047 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:25,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:25,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1008833847, now seen corresponding path program 1 times [2025-03-04 03:56:25,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:25,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910101119] [2025-03-04 03:56:25,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:25,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:25,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 03:56:25,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 03:56:25,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:25,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 03:56:25,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:25,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910101119] [2025-03-04 03:56:25,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910101119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:25,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:25,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:56:25,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43424469] [2025-03-04 03:56:25,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:25,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:56:25,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:25,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:56:25,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:56:25,376 INFO L87 Difference]: Start difference. First operand 1162 states and 1588 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 03:56:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:25,510 INFO L93 Difference]: Finished difference Result 2295 states and 3138 transitions. [2025-03-04 03:56:25,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:56:25,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 88 [2025-03-04 03:56:25,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:25,518 INFO L225 Difference]: With dead ends: 2295 [2025-03-04 03:56:25,518 INFO L226 Difference]: Without dead ends: 1141 [2025-03-04 03:56:25,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:56:25,522 INFO L435 NwaCegarLoop]: 977 mSDtfsCounter, 3 mSDsluCounter, 3886 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4863 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:25,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4863 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:56:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-04 03:56:25,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1140. [2025-03-04 03:56:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 850 states have (on average 1.3247058823529412) internal successors, (1126), 864 states have internal predecessors, (1126), 218 states have call successors, (218), 74 states have call predecessors, (218), 71 states have return successors, (212), 210 states have call predecessors, (212), 209 states have call successors, (212) [2025-03-04 03:56:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1556 transitions. [2025-03-04 03:56:25,580 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1556 transitions. Word has length 88 [2025-03-04 03:56:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:25,580 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1556 transitions. [2025-03-04 03:56:25,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 03:56:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1556 transitions. [2025-03-04 03:56:25,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 03:56:25,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:25,583 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-04 03:56:25,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 03:56:25,583 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:25,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:25,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1027924255, now seen corresponding path program 1 times [2025-03-04 03:56:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:25,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327998565] [2025-03-04 03:56:25,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:25,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 03:56:25,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 03:56:25,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:25,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 03:56:25,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:25,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327998565] [2025-03-04 03:56:25,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327998565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:56:25,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271682401] [2025-03-04 03:56:25,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:25,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:56:25,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:56:25,778 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 03:56:25,780 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 03:56:26,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 03:56:26,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 03:56:26,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:26,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:26,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:56:26,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:56:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 03:56:26,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:56:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 03:56:26,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271682401] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:56:26,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:56:26,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-04 03:56:26,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711743394] [2025-03-04 03:56:26,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:56:26,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:56:26,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:26,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:56:26,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:56:26,617 INFO L87 Difference]: Start difference. First operand 1140 states and 1556 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 03:56:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:26,836 INFO L93 Difference]: Finished difference Result 2429 states and 3342 transitions. [2025-03-04 03:56:26,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:56:26,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 90 [2025-03-04 03:56:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:26,846 INFO L225 Difference]: With dead ends: 2429 [2025-03-04 03:56:26,846 INFO L226 Difference]: Without dead ends: 1297 [2025-03-04 03:56:26,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:56:26,851 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 285 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:26,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1980 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:56:26,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2025-03-04 03:56:26,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1258. [2025-03-04 03:56:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 956 states have (on average 1.3430962343096233) internal successors, (1284), 970 states have internal predecessors, (1284), 230 states have call successors, (230), 74 states have call predecessors, (230), 71 states have return successors, (224), 222 states have call predecessors, (224), 221 states have call successors, (224) [2025-03-04 03:56:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1738 transitions. [2025-03-04 03:56:26,900 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1738 transitions. Word has length 90 [2025-03-04 03:56:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:26,900 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1738 transitions. [2025-03-04 03:56:26,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 03:56:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1738 transitions. [2025-03-04 03:56:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 03:56:26,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:26,904 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2025-03-04 03:56:26,915 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 03:56:27,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 03:56:27,109 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:27,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:27,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1002952813, now seen corresponding path program 1 times [2025-03-04 03:56:27,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:27,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56444581] [2025-03-04 03:56:27,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:27,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:27,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 03:56:27,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 03:56:27,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:27,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 03:56:27,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56444581] [2025-03-04 03:56:27,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56444581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:27,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:27,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:56:27,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736740885] [2025-03-04 03:56:27,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:27,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:56:27,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:27,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:56:27,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:56:27,419 INFO L87 Difference]: Start difference. First operand 1258 states and 1738 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 03:56:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:27,544 INFO L93 Difference]: Finished difference Result 2509 states and 3469 transitions. [2025-03-04 03:56:27,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:56:27,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2025-03-04 03:56:27,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:27,552 INFO L225 Difference]: With dead ends: 2509 [2025-03-04 03:56:27,552 INFO L226 Difference]: Without dead ends: 1259 [2025-03-04 03:56:27,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:56:27,558 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 21 mSDsluCounter, 3843 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4814 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:27,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4814 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:56:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-03-04 03:56:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1259. [2025-03-04 03:56:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 957 states have (on average 1.341692789968652) internal successors, (1284), 971 states have internal predecessors, (1284), 230 states have call successors, (230), 74 states have call predecessors, (230), 71 states have return successors, (224), 222 states have call predecessors, (224), 221 states have call successors, (224) [2025-03-04 03:56:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1738 transitions. [2025-03-04 03:56:27,601 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1738 transitions. Word has length 99 [2025-03-04 03:56:27,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:27,601 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 1738 transitions. [2025-03-04 03:56:27,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 03:56:27,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1738 transitions. [2025-03-04 03:56:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 03:56:27,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:27,605 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2025-03-04 03:56:27,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 03:56:27,606 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:27,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:27,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1641715677, now seen corresponding path program 1 times [2025-03-04 03:56:27,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:27,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592777756] [2025-03-04 03:56:27,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:27,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:27,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 03:56:27,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 03:56:27,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:27,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 03:56:27,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:27,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592777756] [2025-03-04 03:56:27,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592777756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:56:27,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708690802] [2025-03-04 03:56:27,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:27,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:56:27,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:56:28,001 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 03:56:28,003 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 03:56:28,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 03:56:28,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 03:56:28,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:28,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:28,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 03:56:28,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:56:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 03:56:28,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:56:28,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708690802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:28,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:56:28,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 8 [2025-03-04 03:56:28,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243531691] [2025-03-04 03:56:28,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:28,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 03:56:28,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:28,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 03:56:28,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 03:56:28,700 INFO L87 Difference]: Start difference. First operand 1259 states and 1738 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 03:56:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:28,868 INFO L93 Difference]: Finished difference Result 2514 states and 3472 transitions. [2025-03-04 03:56:28,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 03:56:28,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-04 03:56:28,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:28,877 INFO L225 Difference]: With dead ends: 2514 [2025-03-04 03:56:28,877 INFO L226 Difference]: Without dead ends: 1251 [2025-03-04 03:56:28,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 03:56:28,882 INFO L435 NwaCegarLoop]: 974 mSDtfsCounter, 3 mSDsluCounter, 5820 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6794 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:28,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6794 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:56:28,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-03-04 03:56:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2025-03-04 03:56:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 951 states have (on average 1.3396424815983177) internal successors, (1274), 966 states have internal predecessors, (1274), 228 states have call successors, (228), 74 states have call predecessors, (228), 71 states have return successors, (221), 219 states have call predecessors, (221), 219 states have call successors, (221) [2025-03-04 03:56:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1723 transitions. [2025-03-04 03:56:28,948 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1723 transitions. Word has length 123 [2025-03-04 03:56:28,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:28,949 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1723 transitions. [2025-03-04 03:56:28,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 03:56:28,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1723 transitions. [2025-03-04 03:56:28,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 03:56:28,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:28,956 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2025-03-04 03:56:28,966 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 03:56:29,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 03:56:29,162 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:29,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:29,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1620828673, now seen corresponding path program 1 times [2025-03-04 03:56:29,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:29,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197570805] [2025-03-04 03:56:29,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:29,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:29,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 03:56:29,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 03:56:29,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:29,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 03:56:29,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:29,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197570805] [2025-03-04 03:56:29,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197570805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:29,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:29,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:56:29,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186338866] [2025-03-04 03:56:29,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:29,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:56:29,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:29,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:56:29,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:56:29,344 INFO L87 Difference]: Start difference. First operand 1251 states and 1723 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 03:56:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:29,414 INFO L93 Difference]: Finished difference Result 2494 states and 3459 transitions. [2025-03-04 03:56:29,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:56:29,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2025-03-04 03:56:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:29,423 INFO L225 Difference]: With dead ends: 2494 [2025-03-04 03:56:29,423 INFO L226 Difference]: Without dead ends: 1251 [2025-03-04 03:56:29,428 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 03:56:29,429 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 0 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:29,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1925 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:56:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-03-04 03:56:29,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2025-03-04 03:56:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 951 states have (on average 1.3333333333333333) internal successors, (1268), 966 states have internal predecessors, (1268), 228 states have call successors, (228), 74 states have call predecessors, (228), 71 states have return successors, (221), 219 states have call predecessors, (221), 219 states have call successors, (221) [2025-03-04 03:56:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1717 transitions. [2025-03-04 03:56:29,470 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1717 transitions. Word has length 163 [2025-03-04 03:56:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:29,472 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1717 transitions. [2025-03-04 03:56:29,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 03:56:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1717 transitions. [2025-03-04 03:56:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 03:56:29,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:29,478 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2025-03-04 03:56:29,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 03:56:29,478 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:29,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:29,479 INFO L85 PathProgramCache]: Analyzing trace with hash -902585412, now seen corresponding path program 1 times [2025-03-04 03:56:29,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:29,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299999816] [2025-03-04 03:56:29,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:29,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:29,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 03:56:29,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 03:56:29,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:29,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 03:56:29,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:29,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299999816] [2025-03-04 03:56:29,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299999816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:29,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:29,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:56:29,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487239533] [2025-03-04 03:56:29,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:29,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:56:29,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:29,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:56:29,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:56:29,890 INFO L87 Difference]: Start difference. First operand 1251 states and 1717 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 03:56:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:29,997 INFO L93 Difference]: Finished difference Result 1333 states and 1816 transitions. [2025-03-04 03:56:29,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:56:29,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 166 [2025-03-04 03:56:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:30,004 INFO L225 Difference]: With dead ends: 1333 [2025-03-04 03:56:30,004 INFO L226 Difference]: Without dead ends: 1102 [2025-03-04 03:56:30,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:56:30,006 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 0 mSDsluCounter, 3862 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4832 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:30,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4832 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:56:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-03-04 03:56:30,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2025-03-04 03:56:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 845 states have (on average 1.3420118343195266) internal successors, (1134), 859 states have internal predecessors, (1134), 194 states have call successors, (194), 64 states have call predecessors, (194), 62 states have return successors, (189), 187 states have call predecessors, (189), 187 states have call successors, (189) [2025-03-04 03:56:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1517 transitions. [2025-03-04 03:56:30,044 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1517 transitions. Word has length 166 [2025-03-04 03:56:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:30,045 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1517 transitions. [2025-03-04 03:56:30,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 03:56:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1517 transitions. [2025-03-04 03:56:30,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 03:56:30,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:30,050 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 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] [2025-03-04 03:56:30,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 03:56:30,050 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:30,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:30,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1716601940, now seen corresponding path program 1 times [2025-03-04 03:56:30,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:30,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428412841] [2025-03-04 03:56:30,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:30,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:30,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 03:56:30,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 03:56:30,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:30,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 03:56:30,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:30,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428412841] [2025-03-04 03:56:30,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428412841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:30,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:30,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:56:30,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877747555] [2025-03-04 03:56:30,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:30,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:56:30,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:30,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:56:30,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:56:30,330 INFO L87 Difference]: Start difference. First operand 1102 states and 1517 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 03:56:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:30,421 INFO L93 Difference]: Finished difference Result 1212 states and 1652 transitions. [2025-03-04 03:56:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:56:30,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 175 [2025-03-04 03:56:30,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:30,423 INFO L225 Difference]: With dead ends: 1212 [2025-03-04 03:56:30,424 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 03:56:30,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:56:30,429 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 0 mSDsluCounter, 3770 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4715 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:30,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4715 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:56:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 03:56:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 03:56:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 03:56:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 03:56:30,431 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2025-03-04 03:56:30,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:30,432 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 03:56:30,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 03:56:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 03:56:30,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 03:56:30,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 03:56:30,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 03:56:30,440 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:56:30,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 03:56:34,860 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 03:56:34,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:56:34 BoogieIcfgContainer [2025-03-04 03:56:34,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 03:56:34,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 03:56:34,870 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 03:56:34,871 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 03:56:34,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:56:17" (3/4) ... [2025-03-04 03:56:34,876 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#12 [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure copy_from_user [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#11 [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#10 [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure uinput_ioctl_handler [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#7 [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#6 [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#9 [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#8 [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#13 [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __bad_percpu_size [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure input_event_size [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure uinput_ff_upload_from_user [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure uinput_destroy_device [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure input_abs_get_max [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __wake_up [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure variable_test_bit [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure get_current [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure uinput_request_done [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure signal_pending [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_lock_interruptible [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure constant_test_bit [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure input_abs_get_min [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure is_compat_task [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kfree [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure might_fault [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure prepare_to_wait [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure input_abs_get_flat [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure copy_to_user [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure input_alloc_absinfo [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kzalloc [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure spin_lock [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_check_return_value [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure uinput_request_find [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __init_waitqueue_head [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure set_bit [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure spin_unlock [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2025-03-04 03:56:34,882 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_unlock_mutex_of_uinput_device [2025-03-04 03:56:34,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure schedule [2025-03-04 03:56:34,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#1 [2025-03-04 03:56:34,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#0 [2025-03-04 03:56:34,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#3 [2025-03-04 03:56:34,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#2 [2025-03-04 03:56:34,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#5 [2025-03-04 03:56:34,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#4 [2025-03-04 03:56:34,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _copy_from_user [2025-03-04 03:56:34,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure finish_wait [2025-03-04 03:56:34,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure uinput_allocate_device [2025-03-04 03:56:34,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2025-03-04 03:56:34,912 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 223 nodes and edges [2025-03-04 03:56:34,916 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 91 nodes and edges [2025-03-04 03:56:34,919 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-04 03:56:34,923 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 03:56:34,926 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 03:56:34,929 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 03:56:35,105 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 03:56:35,106 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 03:56:35,106 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 03:56:35,107 INFO L158 Benchmark]: Toolchain (without parser) took 32079.00ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 107.1MB in the beginning and 403.6MB in the end (delta: -296.5MB). Peak memory consumption was 228.9MB. Max. memory is 16.1GB. [2025-03-04 03:56:35,107 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 03:56:35,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1507.57ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 64.7MB in the end (delta: 41.8MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2025-03-04 03:56:35,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 156.98ms. Allocated memory is still 142.6MB. Free memory was 64.7MB in the beginning and 99.4MB in the end (delta: -34.7MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2025-03-04 03:56:35,107 INFO L158 Benchmark]: Boogie Preprocessor took 313.61ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 89.0MB in the end (delta: 10.4MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. [2025-03-04 03:56:35,107 INFO L158 Benchmark]: IcfgBuilder took 12052.36ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 89.0MB in the beginning and 62.6MB in the end (delta: 26.4MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. [2025-03-04 03:56:35,108 INFO L158 Benchmark]: TraceAbstraction took 17807.18ms. Allocated memory was 201.3MB in the beginning and 671.1MB in the end (delta: 469.8MB). Free memory was 61.1MB in the beginning and 436.9MB in the end (delta: -375.8MB). Peak memory consumption was 221.0MB. Max. memory is 16.1GB. [2025-03-04 03:56:35,108 INFO L158 Benchmark]: Witness Printer took 235.46ms. Allocated memory is still 671.1MB. Free memory was 436.9MB in the beginning and 403.6MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 03:56:35,109 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1507.57ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 64.7MB in the end (delta: 41.8MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 156.98ms. Allocated memory is still 142.6MB. Free memory was 64.7MB in the beginning and 99.4MB in the end (delta: -34.7MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 313.61ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 89.0MB in the end (delta: 10.4MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. * IcfgBuilder took 12052.36ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 89.0MB in the beginning and 62.6MB in the end (delta: 26.4MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17807.18ms. Allocated memory was 201.3MB in the beginning and 671.1MB in the end (delta: 469.8MB). Free memory was 61.1MB in the beginning and 436.9MB in the end (delta: -375.8MB). Peak memory consumption was 221.0MB. Max. memory is 16.1GB. * Witness Printer took 235.46ms. Allocated memory is still 671.1MB. Free memory was 436.9MB in the beginning and 403.6MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 3073]: 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"); [3073] - GenericResultAtLocation [Line: 3087]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3087-3088] - GenericResultAtLocation [Line: 3102]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [3102] - GenericResultAtLocation [Line: 3105]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3105] - GenericResultAtLocation [Line: 3108]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3108] - GenericResultAtLocation [Line: 3111]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3111] - GenericResultAtLocation [Line: 3173]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& kernel_stack)); [3173] - GenericResultAtLocation [Line: 3176]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3176] - GenericResultAtLocation [Line: 3179]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3179] - GenericResultAtLocation [Line: 3182]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3182] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4914]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 58 procedures, 780 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4388 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4303 mSDsluCounter, 50883 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35468 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 780 IncrementalHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 15415 mSDtfsCounter, 780 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 328 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1409occurred in iteration=4, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 71 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1449 NumberOfCodeBlocks, 1449 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1521 ConstructedInterpolants, 0 QuantifiedInterpolants, 1994 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2091 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 302/316 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 03:56:35,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE